PL EN


Preferences help
enabled [disable] Abstract
Number of results
2015 | 24 |
Article title

An Optimal Strategy of Resource Sharing in a Case of State-toggling Agents

Content
Title variants
Languages of publication
PL
Abstracts
PL
This paper presents an optimal scheduling solution for a case of agents sharing a resource. The amount of resource can not satisfy all agents at once and in case of runout there is a penalty. Each agent randomly toggle its state between requiring and not requiring the resource. Using the knowledge of previous state and probability of change, the scheduling algorithm is able to calculate optimal number of concuring agents for one turn, that minimizes possibility of collision yet provides as much throughput as possible. Several different scheduling strategies are tested. The optimal solution adapts automatically to the value of probability of change. Further experiments show that optimality is retained if only the average probability of a set of agents is known. A case of practical application is provided.
Publisher
Year
Volume
24
Physical description
Dates
published
2015
online
06 - 07 - 2016
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-issn-2083-8476-year-2015-volume-24-article-6346
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.