1. Real-Time Multiprocessor Scheduling Algorithm Based on Information Theory Principles
- Author
-
Albert M. K. Cheng, A C Carlos Rincon, and Xingliang Zou
- Subjects
Rate-monotonic scheduling ,General Computer Science ,Computer science ,Distributed computing ,020206 networking & telecommunications ,02 engineering and technology ,Dynamic priority scheduling ,Parallel computing ,Information theory ,Fair-share scheduling ,Multiprocessor scheduling ,Control and Systems Engineering ,Two-level scheduling ,0202 electrical engineering, electronic engineering, information engineering ,Overhead (computing) ,020201 artificial intelligence & image processing ,Algorithm design ,Algorithm - 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.
- Published
- 2017