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

• Autorzy: Wójtowicz, T.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

hard real-time systems; scheduling; shared resource; optimization; round robin

• Czasopismo: Schedae Informaticae
• Rocznik: 2015
• Tom: Vol. 24
• Strony: 211--220
• Opis fizyczny: Bibliogr. 9 poz., rys.

Twórcy

autor

Wójtowicz, T.

• Institute of Computer Science and Computational Mathematics Jagiellonian University ul. Łojasiewicza 6, Kraków, 30-348 Poland ,

Bibliografia

• [1] Andersson B., Raravi G., Real-time scheduling with resource sharing on heterogeneous multiprocessors, Real-Time Systems, 2014, 50(2), pp. 270–314.
• [2] Buttazzo G.C., Bertogna M., Yao G., Limited Preemptive Scheduling for Real-Time Systems. A Survey, IEEE Transactions on Industrial Informatics, 2013, 9(1), pp. 3–15, doi:10.1109/TII.2012.2188805.
• [3] Saifullah A., Li J., Agrawal K., Lu C., Gill C., Multi-core real-time scheduling for generalized parallel task models, Real-Time Systems, 2013, 49, pp. 404–435.
• [4] Shekhar M., Sarkar A., Ramaprasad H., Mueller F., Semi-Partitioned Hard-Real-Time Scheduling under Locked Cache Migration in Multicore Systems, 24th Euromicro Conference on Real-Time Systems (ECRTS), 2012, pp. 331–340, doi:10.1109/ECRTS.2012.27.
• [5] Davis R.I., Burns A., A survey of hard real-time scheduling for multiprocessor systems, ACM Computing Surveys (CSUR), 2011, 43(4), doi:10.1145/1978802.1978814.
• [6] Martyna J., Distributed Hard Real-Time Systems: Notions and Performance Measures, Zeszyty Naukowe UJ, Prace Informatyczne, 1998, 8, pp. 29–44.
• [7] Tindell K., Clark J., Holistic schedulability analysis for distributed hard real-time systems, Microprocessing and Microprogramming, 1994, 40(2–3), pp. 117–134, doi:10.1016/0165-6074(94)90080-9.
• [8] Silberschatz A., Peterson J.L., Operating Systems Concepts, Addison-Wesley, 1988, ISBN 0-201-18760-4.
• [9] Kendall D.G., Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain, The Annals of Mathematical Statistics, 1953, 24(3), pp. 338–354.

Identyfikatory

DOI

10.4467/20838476SI.16.018.4359