Real-Time Multiprocessor Scheduling Algorithm Based on Information Theory Principles
Open Access
- 10 October 2017
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Embedded Systems Letters
- Vol. 9 (4) , 93-96
Abstract
Reducing job migrations is essential for any global multiprocessor scheduling algorithm. In this letter, we present a global, dynamic-priority, laxity-based algorithm that reduces the number of migrations on multiprocessor embedded systems by leveraging information theory principles. A simplification of the proposed scheduling theory is presented to reduce the overhead caused by using information theory. Our results show that the proposed algorithm is able to reduce the number of migrations by up to 41.21% when compared with other global, dynamic-priority, laxity-based algorithms. As the utilization per task set and the number of processors increase, simplified information-theoretic scheduling algorithm is able to improve its performance in terms of the number of migrations.Keywords
Funding Information
- National Science Foundation (0720856, 1219082)
This publication has 5 references indexed in Scilit:
- Multiprocessor Scheduling for Real-Time Systems2015
- EDZL Scheduling Analysis19th Euromicro Conference on Real-Time Systems (ECRTS'07), 2007
- A new algorithm for scheduling periodic, real-time tasksAlgorithmica, 1989
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948