Abstract
We consider the problem of optimal real-time scheduling of periodic and sporadic tasks on identical multiprocessors. A number of recent papers have used the notions of fluid scheduling and deadline partitioning to guarantee optimality and improve performance. This article develops a unifying theory with the DP-Fair scheduling policy and examines how it overcomes problems faced by greedy scheduling algorithms. In addition, we present DP-Wrap, a simple DP-Fair scheduling algorithm which serves as a least common ancestor to other recent algorithms. The DP-Fair scheduling policy is extended to address the problem of scheduling sporadic task sets with arbitrary deadlines.
Similar content being viewed by others
References
Abdelzaher T, Andersson B, Jonsson J, Sharma V, Nguyen M (2002) The aperiodic multiprocessor utilization bound for liquid tasks. In: IEEE real-time and embedded technology and applications symposium (RTAS), IEEE Computer Society Press, San Jose, California
Andersson B, Bletsas K (2008) Sporadic multiprocessor scheduling with few preemptions. In: Euromicro conference on real-time systems (ECRTS)
Andersson B, Tovar E (2006) Multiprocessor scheduling with few preemptions. In: IEEE embedded and real-time computing systems and applications (RTCSA)
Andersson B, Bletsas K, Baruah SK (2008) Scheduling arbitrary deadline sporadic task systems on multiprocessors. In: IEEE real-time systems symposium (RTSS)
Baker T (2003) Multiprocessor EDF and deadline monotonic schedulability analysis. In: IEEE real-time systems symposium (RTSS)
Baker T (2005) An analysis of EDF schedulability on a multiprocessor. IEEE Trans Parallel Distrib Syst 16:460–768
Baruah SK, Carpenter J (2004) Multiprocessor fixed-priority scheduling with restricted interprocessor migrations. J Embedd Comput 1(2):195–202
Baruah SK, Cohen NK, Plaxton CG, Varvel D (1996) Proportionate progress: a notion of fairness in resource allocation. Algorithmica 15(6):600–625
Bastoni A, Brandenburg B, Anderson JH (2010) Cache-related preemption and migration delays: empirical approximation and impact on schedulability. In: 6th international workshop on operating systems platforms for embedded real-time applications (OSPERT)
Buttazzo G, Sensini F (1999) Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments. IEEE Trans Comput 48(10):1035–1052
Carpenter J, Funk S, Holman P, Srinivasan A, Anderson JH, Baruah SK (2004) A categorization of real-time multiprocessor scheduling problems and algorithms. In: Leung JYT (ed) Handbook on scheduling algorithms, methods, and models. Chapman Hall/CRC, London
Chen SY, Hsueh CW (2008) Optimal dynamic-priority real-time scheduling algorithms for uniform multiprocessors. In: IEEE real-time systems symposium (RTSS)
Cho H, Ravindran B, Jensen E (2006) An optimal real-time scheduling algorithm for multiprocessors. In: IEEE real-time systems symposium (RTSS)
Cho SK, Lee S, Han A, Lin KJ (2002) Efficient real-time scheduling algorithms for multiprocessor systems. IEICE Trans Commun E85-B(12):2859–2867
Davis RI, Burns A (2011, accepted for publication) A survey of hard real-time scheduling for multiprocessor systems. ACM Computing Surveys
Dertouzos M (1974) Control robotics: the procedural control of physical processors. In: Proceedings of the IFIP congress
Dertouzos M, Mok AK (1989) Multiprocessor scheduling in a hard real-time environment. IEEE Trans Softw Eng 15(12):1497–1506
Dhall S, Liu C (1978) On a real-time scheduling problem. Oper Res 26(1):127–140
Emberson P, Stafford R, Jonsson J, Davis RI (2010) Techniques for the synthesis of multiprocessor tasksets. In: International workshop on analysis tools and methodologies for embedded and real-time systems (WATERS), Brussels, Belgium
Fisher N, Goossens J, Baruah S (2010) Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible. Real-Time Syst 45(1–2):26–71
Franchetti F, Voronenko Y, Puschel M (2006) FFT program generation for shared memory: SMP and multicore. In: ACM/IEEE conference on supercomputing (SC06)
Funaoka K, Kato S, Yamasaki N (2008a) New abstraction for optimal real-time scheduling on multiprocessors. In: IEEE embedded and real-time computing systems and applications (RTCSA)
Funaoka K, Kato S, Yamasaki N (2008b) Work-conserving optimal real-time scheduling on multiprocessors. In: Euromicro conference on real-time systems (ECRTS)
Funk S, Nadadur V (2009) LRE-TL: an optimal multiprocessor algorithm for sporadic task sets. In: Conference on Real-Time and Network Systems (RTNS)
Hong KS, Leung JYT (1992) On-line scheduling of real-time tasks. IEEE Trans Comput 41:1326–1331
Kato S, Yamasaki N (2007) Real-time scheduling with task splitting on multiprocessors. In: IEEE embedded and real-time computing systems and applications (RTCSA)
Kato S, Yamasaki N (2008) Portioned EDF-based scheduling on multiprocessors. In: ACM international conference on embedded software (EMSOFT)
Khemka A, Shyamasundar RK (1997) An optimal multiprocessor real-time scheduling algorithm. J Parallel Distrib Comput 43(1):37–45
Lakshmanan K, de Niz D, Rajkumar R (2009) Coordinated task scheduling, allocation and synchronization on multiprocessors. In: IEEE real-time systems symposium (RTSS). IEEE Computer Society, Los Alamitos
Leung J (1989) A new algorithm for scheduling periodic, real-time tasks. Algorithmica 4(1):209–219
Lin C, Brandt SA (2005) Improving soft real-time performance through better slack management. In: IEEE real-time systems symposium (RTSS)
Lin C, Kaldewey T, Povzner A, Brandt SA (2006) Diverse soft real-time processing in an integrated system. In: IEEE real-time systems symposium (RTSS)
Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20(1):46–61
López JM, Garcia M, Diaz JL, Garcia DF (2000) Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems. In: Euromicro conference on real-time systems (ECRTS)
McNaughton R (1959) Scheduling with deadlines and loss functions. Mach Sci 6(1):1–12
Mok AK (1983) Fundamental design problems of distributed systems for the hard-real-time environment. PhD thesis, Massachusetts Institute of Technology
Oh S, Yang S (1998) A modified least-laxity-first scheduling algorithm for real-time tasks. In: IEEE embedded and real-time computing systems and applications (RTCSA)
Phillips C, Stein C, Torng E, Wein J (1997) Optimal time-critical scheduling via resource augmentation. In: ACM symposium on the theory of computing (STOC)
Sprunt B, Sha L, Lehoczky J (1989) Aperiodic task scheduling for hard-real-time systems. Real-Time Syst 1(1):27–60
Srinivasan A, Holman P, Anderson JH, Baruah SK (2003) The case for fair multiprocessor scheduling. In: International symposium on parallel and distributed processing (IPDPS)
Stafford R (2006) Random vectors with fixed sum. http://www.mathworks.com/matlabcentral/fileexchange/9700
Zhu D, Mossé D, Melhem R (2003) Multiple-resource periodic scheduling problem: how much fairness in necessary. In: IEEE real-time systems symposium (RTSS)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Funk, S., Levin, G., Sadowski, C. et al. DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling. Real-Time Syst 47, 389–429 (2011). https://doi.org/10.1007/s11241-011-9130-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-011-9130-0