Abstract
A time slot is defined as contention-free if the number of jobs with remaining executions in the slot is no larger than the number of processors, or contending, otherwise. Then an important property holds that in any contention-free slot, all jobs with remaining executions are guaranteed to be scheduled as long as the scheduler is work-conserving. This article aims at improving schedulability by utilizing the contention-free slots. To achieve this, this article presents a policy (called CF policy) that moves some job executions from contending slots to contention-free ones. This policy can be employed by any work-conserving, preemptive scheduling algorithm, and we show that any algorithm extended with this policy dominates the original algorithm in terms of schedulability. We also present improved schedulability tests for algorithms that employ this policy, based on the observation that interference from jobs is reduced when their executions are postponed to contention-free slots. Simulation results demonstrate that the CF policy, incorporated into existing algorithms, significantly improves schedulability of those existing algorithms.
- AUTOSAR. 2009. AUTOSAR release 4.0 specification. http://www.autosar.org.Google Scholar
- Airlines Electronic Engineering Committee. 2003. ARINC specification 653-1. Aeronautical Radio, INC., Annapolis, MD.Google Scholar
- Björn Andersson, Konstantinos Bletsas, and Sanjoy Baruah. 2008. Scheduling arbitrary-deadline sporadic task systems on multiprocessor. In Proceedings of the IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA). 197--206.Google Scholar
Digital Library
- Theodore P. Baker. 2005. Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hand real time. Tech. rep. TR-050601. Department of Computer Science, Florida State University, Tallahasee.Google Scholar
- Theodore P. Baker and Michele Cirinei. 2006. A necessary and sometimes sufficient condition for the feasibility of sets of sporadic hard-deadline tasks. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 178--190. Google Scholar
Digital Library
- Theodore P. Baker, Michele Cirinei, and Marko Bertogna. 2008. EDZL scheduling analysis. Real-Time Syst. 40, 264--289. Google Scholar
Digital Library
- Sanjoy Baruah. 2004. Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. IEEE Trans. Comput. 53, 6, 781--784. Google Scholar
Digital Library
- Sanjoy Baruah. 2007. Techniques for multiprocessor global schedulability analysis. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 119--128. Google Scholar
Digital Library
- S. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel. 1996. Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15, 6, 600--625.Google Scholar
Digital Library
- Sanjoy Baruah, Aloysius Mok, and Louis Rosier. 1990. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 182--190.Google Scholar
Cross Ref
- Marko Bertogna and Michele Cirinei. 2007. Response-time analysis for globally scheduled symmetric multiprocessor platforms. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 149--160. Google Scholar
Digital Library
- Marko Bertogna, Michele Cirinei, and Giuseppe Lipari. 2005. Improved schedulability analysis of EDF on multiprocessor platforms. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS). 209--218. Google Scholar
Digital Library
- Marko Bertogna, Michele Cirinei, and Giuseppe Lipari. 2009. Schedulability analysis of global scheduling algorithms on multiprocessor platforms. IEEE Trans. Parallel Distrib. Syst. 20, 553--566. Google Scholar
Digital Library
- Alan Burns and Sanjoy Baruah. 2008. Sustainability in real-time scheduling. J. Comput. Sci. Eng. 2, 1, 74--97.Google Scholar
Cross Ref
- S. Cho, S.-K. Lee, S. Ahn, and K.-J. Lin. 2002. Efficient real-time scheduling algorithms for multiprocessor systems. IEICE Trans. Commun. E85--B, 12, 2859--2867.Google Scholar
- Robert I. Davis and Alan Burns. 2011a. FPZL schedulability analysis. In Proceedings of the IEEE Real-Time Technology and Applications Symposium (RTAS). 245--256. Google Scholar
Digital Library
- Robert I. Davis and Alan Burns. 2011b. A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. 43, 35:1--35:44. Google Scholar
Digital Library
- M. Dertouzos. 1974. Control robotics: The procedural control of physical processors. In Proceedings of the IFIP Congress. 807--813.Google Scholar
- Nan Guan, Martin Sitgge, Wang Yi, and Ge Yu. 2009. New response time bounds for fixed priority multiprocessor scheduling. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 387--397. Google Scholar
Digital Library
- Lei Ju, Samarjit Chakraborty, and Abhik Roychoudhury. 2007. Accounting for cache-related preemption delay in dynamic priority schedulability analysis. In Proceedings of the Design, Automation & Test in Europe Conference & Exhibition (DATE). 1623--1628. Google Scholar
Digital Library
- Shinpei Kato, Nobuyoki Yamasaki, and Yutaka Ishikawa. 2009. Semi-partitioned scheduling of sporadic task systems on multiprocessors. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS). 249--258. Google Scholar
Digital Library
- Jinkyu Lee, Arvind Easwaran, and Insik Shin. 2010. LLF schedulability analysis on multiprocessor platforms. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 25--36. Google Scholar
Digital Library
- Jinkyu Lee, Arvind Easwaran, and Insik Shin. 2011a. Maximizing contention-free executions in multiprocessor scheduling. In Proceedings of the IEEE Real-Time Technology and Applications Symposium (RTAS). 235--244. Google Scholar
Digital Library
- Jinkyu Lee, Arvind Easwaran, Insik Shin, and Insup Lee. 2011b. Zero-laxity based real-time multiprocessor scheduling. J. Syst. Soft. 84, 12, 2324--2333. Google Scholar
Digital Library
- On-line multiprocessor scheduling algorithms for real-time tasks. In Proceedings of the IEEE Region 10's 9th Annual International Conference. 607--611.Google Scholar
- J. Y. T. Leung and J. Whitehead. 1982. On the complexity of fixed-priority scheduling of periodic real-time tasks. Perform. Eval. 2, 237--250.Google Scholar
Cross Ref
- J. Y.-T. Leung. 1989. A new algorithm for scheduling periodic, real-time tasks. Algorithmica 4, 209--219.Google Scholar
Digital Library
- C. L. Liu and James Layland. 1973. Scheduling algorithms for multi-programming in a hard-real-time environment. J. ACM 20, 1, 46--61. Google Scholar
Digital Library
- Aloysius Mok. 1983. Fundamental design problems of distributed systems for the hard-real-time environment. Ph.D. Dissertation, Massachusetts Institute of Technology.Google Scholar
Digital Library
- Minkyu Park, Sangchul Han, Heeheon Kim, Seongje Cho, and Yookun Cho. 2005. Comparison of deadline-based scheduling algorithms for periodic real-time tasks on multiprocessor. IEICE Trans. Info. Syst. E88-D, 658--661. Google Scholar
Digital Library
- Anand Srinivasan and Sanjoy Baruah. 2002. Deadline-based scheduling of periodic task systems on multiprocessors. Info. Process. Lett. 84, 2, 93--98. Google Scholar
Digital Library
- C. H. (Kees) van Berkel. 2009. Multi-core for mobile phones. In Proceedings of the Design, Automation & Test in Europe Conference & Exhibition (DATE). 1260--1265. Google Scholar
Digital Library
Index Terms
Contention-free executions for real-time multiprocessor scheduling
Recommendations
Maximizing Contention-Free Executions in Multiprocessor Scheduling
RTAS '11: Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications SymposiumIt is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with each other for processors, and this could produce more contention-free slots ...
Global EDF-based scheduling with laxity-driven priority promotion
This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based ...
Capturing urgency and parallelism using quasi-deadlines for real-time multiprocessor scheduling
We introduce a multiprocessor scheduling parameter called quasi-deadline.We propose two scheduling algorithms, called EQDF and EQDZL.We derive new schedulability analysis tests for EQDF and EQDZL.We address the problem of priority assignment under EQDF ...






Comments