A Modified LRE-TL Real-Time Multiprocessor Scheduling Algorithm
A modified version of Local Remaining Execution-TL (LRE-TL) real-time multiprocessor scheduling algorithm is presented. LRE-TL uses two events to make scheduling decisions: The Bottom (B) event and the Critical (C) event. Event B occurs when a task consumes its local utilization meaning that it has to be preempted. Event C occurs when a task’s local laxity becomes zero meaning that the task should directly be scheduled for execution. Event C always results in a task migration, therefore we modified the initialization procedure of LRE-TL to select the tasks that have a higher probability of firing a C event to be scheduled for execution firstly, and thereby tasks migration will be reduced. We have conducted an independent-samples t test to compare tasks migration using the original LRE-TL algorithm and the modified algorithm. The results obtained showed that there was a significance reduction in tasks migration when the proposed solution is applied.
KeywordsReal-time Multiprocessor Scheduling Preemptions Migrations
Unable to display preview. Download preview PDF.
- 1.H. Kopetz, Real-Time Systems: Design Principles for Distributed Embedded Applications: Springer, 2011.Google Scholar
- 2.G. Nelissen, V. Berten, V. Nélis, J. Goossens, and D. Milojevic, “U-EDF: An unfair but optimal multiprocessor scheduling algorithm for sporadic tasks,” in Real-Time Systems (ECRTS), 2012 24th Euromicro Conference on, 2012, pp. 13-23.Google Scholar
- 3.S. Funk, G. Levin, C. Sadowski, I. Pye, and S. Brandt, “DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling,” Real-Time Systems, vol. 47, pp. 389-429, 2011.Google Scholar
- 4.G. Nelissen, V. Berten, J. Goossens, and D. Milojevic, “Reducing preemptions and migrations in real-time multiprocessor scheduling algorithms by releasing the fairness,” in Embedded and Real-Time Computing Systems and Applications (RTCSA), 2011 IEEE 17th International Conference on, 2011, pp. 15-24.Google Scholar
- 5.C. L. Liu and J. W. Layland, “Scheduling algorithms for multiprogramming in a hard-real-time environment,” Journal of the ACM (JACM), vol. 20, pp. 46-61, 1973.Google Scholar
- 6.S. Funk, “LRE-TL: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines,” Van Godewijckstraat 30, Dordrecht, 3311 GZ, Netherlands, 2010, pp. 332-359.Google Scholar
- 7.J. Carpenter, S. Funk, P. Holman, A. Srinivasan, J. Anderson, and S. Baruah, “A categorization of real-time multiprocessor scheduling problems and algorithms,” Handbook on Scheduling Algorithms, Methods, and Models, pages, pp. 30.1-30.19, 2004.Google Scholar
- 8.H. Cho, B. Ravindran, and E. D. Jensen, “An optimal real-time scheduling algorithm for multiprocessors,” in Real-Time Systems Symposium, 2006. RTSS’06. 27th IEEE International, 2006, pp. 101-110.Google Scholar
- 9.R. I. Davis and A. Burns, “A survey of hard real-time scheduling for multiprocessor systems,” ACM Computing Surveys (CSUR), vol. 43, p. 35, 2011.Google Scholar
- 10.S. H. Funk and A. Meka, “U-LLREF: An Optimal Scheduling Algorithm for Uniform Multiprocessors,” in The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems, 2009, p. 262.Google Scholar
- 11.Oracle. (2013, VisualVM - All-in-One Java Troubleshooting Tool. Available: https://visualvm.java.net.