Çok İşlemcili Gerçek Zamanlı Sistemlerde Zamanlama Algoritmaları

Yıl 2020, Cilt: 1 Sayı: 2, 42 - 50, 15.12.2020

Muhammet Kürşat Yıldırım , Lütfi Süder , Ahmed Abd Alkader , Abdullah Elewi

Öz

Gerçek zamanlı sistemler hayatımızın birçok alanında çok önemli bir rol oynar. Bu çalışmada çok işlemcili gerçek zamanlı sistemler üzerinde çalışan zamanlama algoritmalarından olan, Evrensel Erken Biten Önce (Global Earliest Deadline First-GEDF), Bölmeli Erken Biten Önce (Partitioned Earliest Deadline First-PEDF), Bölmeli Monoton Oran (Partitioned Rate Monotonic-PRM) ve Evrensel Monoton Oran (Global Rate Monotonic-GRM) algoritmaları ele alınmıştır. Bu algoritmaların, açık kaynaklı MCRTsim uygulamasından alınan karşılaştırılmalı sonuçları verilmiştir.

Anahtar Kelimeler

Gerçek zamanlı sistemler, Çok işlemci, Zamanlama, MCRTsim

Kaynakça

• Andersson, B. (2003). Static Priority Scheduling in Multiprocessors. In PhD Thesis, Department of Comp.Eng., Chalmers University, 2003.
• Andersson, B. ve Jonsson, J. (2000). Fixed-Priority Preemptive Multiprocessor Scheduling: To Partition or not to Partition. In IEEE Int’l Conference on Real Time Computing Systems and Applications, Dec. 2000.
• Baker, T. P. (2003). Multiprocessor EDF and Deadline Monotonic Schedulability Analysis. In IEEE Real-Time Systems Symposium, Dec, 2003.
• Beitollahi, H. ve Deconinck, G. (2006). Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems. In 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06).
• Dhall, S. K. Ve Liu, C. L. (1978). On a Real-Time Scheduling Problem. In Operations Research, vol. 26, number 1, 127-140, 1978.
• Garey, M. R. ve Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. In W. H. Freeman, New York, 1979.
• Goossens, J., Funk, S., & Baruah, S. (2003). Priority-Driven Scheduling of Periodic Task Systems on Multiprocessor. In Real Time Systems, vol 25, 187-205, 2003.
• Guan, N. (2016). Techniques for Building Timing-Predictable Embedded Systems. In Springer International Publishing Switzerland, pp. 15, 2016.
• Guochuan, Z. ve Enyu, Y. (1998). The FFD Algorithm for the Bin Packing Problem with Kernel Items. In Applied Mathematics-A Journal of Chinese Universities, pp. 2, 1998.
• Ha, R. ve Liu, J. (1994). Validating Timing Constraints in Multiprocessor and Distributed Real-Time Systems. In Int’l Conf. on Distributed Computing Systems, pp. 162-171.
• Davis, R. I. ve Burns, A. (2011). A survey of hard real-time scheduling for multiprocessor systems. In ACM Comput. Surv. 43, 4, Article 35, 44 pages.
• Lauzac, S., Melhem, R. & Mosse, D. (1998). Comparison of Global and Partitioning Schemes for Scheduling RM Tasks on a Multiprocessor. In Euromicro Workshop on Real-Time Systems, June 1998.
• Liu, L. ve Layland, J. W. (1973). Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. J. ACM, 1973.
• Palamut, S., Gönültaş, T., Elewi A., & Avaroğlu, E. (2019). Task Scheduling Algorithms and Resource Access Protocols. In 2019 International Artificial Intelligence and Data Processing Symposium (IDAP), Malatya, Turkey, pp. 1-6.
• Wu, J., ve Huang, Y. (2017). MCRTsim: A simulation tool for multi-core real-time systems. In 2017 International Conference on Applied System Innovation (ICASI), 461–464.
• Zapata, O. ve Alvarez, P. (2005). EDF and RM Multiprocessor Scheduling Algorithms: Survey and Performance Evaluation. In Dept. Seccion de Computacion, CINVESTAV-IPN, Mexico City, Tech. Rep. CINVESTAV-CS-RTG-02.
• Elewi A., Shalan M., Awadalla M., & Saad E. M. (2014). Energy-efficient task allocation techniques for asymmetric multiprocessor embedded systems. In ACM Transactions on Embedded Computing Systems (TECS) 13 (2s), 1-27.
• URL-1: https://github.com/SalihPalamut/MCRTsim [Erişim Tarihi: 15.06.2020]