Fair lateness scheduling: Reducing maximum lateness in G-EDF-like scheduling

Real-Time Systems

Volumn 50, Issue 1, 2014, Pages 5-47

  Erickson, Jeremy P ^a   Anderson, James H ^a   Ward, Bryan C ^a  

^a University of North Carolina   (United States)

Author keywords

Bounded tardiness; Global edf; Global fair lateness; Soft real time

Indexed keywords

BOUNDED TARDINESS; EARLIEST DEADLINE FIRST; GLOBAL EDF; GLOBAL FAIR LATENESS; LINEAR PROGRAMS; MAXIMUM LATENESS; MULTI PROCESSOR SCHEDULING; SOFT REAL TIME;

LINEAR PROGRAMMING; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING ALGORITHMS;

SCHEDULING;

EID: 84891482341     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-013-9190-4     Document Type: Article

References (22)

1. Anderson JH, Srinivasan A (2004) Mixed pfair/erfair scheduling of asynchronous periodic tasks. J Comput Syst Sci 68(1):157-204
2. Back H, Chwa HS, Shin I (2012) Schedulability analysis and priority assignment for global job-level fixed-priority multiprocessor scheduling. In: IEEE real-time and embedded technology and applications symposium, pp 297-306
3. Baker T, Cirinei M, Bertogna M (2008) EDZL scheduling analysis. Real-Time Syst 40:264-289
4. Baruah SK, Cohen NK, Plaxton CG, Varvel DA (1996) Proportionate progress: a notion of fairness in resource allocation. Algorithmica 15:600-625
5. Baruah SK, Mok AK, Rosier LE (1990) Preemptively scheduling hard-real-time sporadic tasks on one processor. In: RTSS, pp 182-190
6. Bastoni A, Brandenburg BB, Anderson JH (2010) An empirical comparison of global, partitioned, and clustered multiprocessor EDF schedulers. In: RTSS, pp 14-24
7. Brandenburg BB (2011) Scheduling and Locking in Multiprocessor Real-Time Operating Systems. PhD thesis, The University of North Carolina at Chapel Hill
8. Chwa HS, Back H, Chen S, Lee J, Easwaran A, Shin I, Lee I (2012) Extending task-level to job-level fixed priority assignment and schedulability analysis using pseudo-deadlines. In: RTSS, pp 51-62
9. Devi UC, Anderson JH (2008) Tardiness bounds under global EDF scheduling on a multiprocessor. Real-Time Syst 38(2):133-189
10. Erickson JP, Anderson JH (2012) Fair lateness scheduling: reducing maximum lateness in g-edf-like scheduling. In: ECRTS, pp 3-12
11. Erickson JP, Devi U, Baruah SK (2010a) Improved tardiness bounds for global EDF. In: ECRTS, pp 14-23
12. Erickson JP, Guan N, Baruah SK (2010b) Tardiness bounds for global EDF with deadlines different from periods. In: OPODIS, pp 286-301. Revised version at http://cs.unc.edu/jerickso/opodis2010-tardiness.pdf
13. Kenna C, Herman J, Brandenburg BB, Mills AF, Anderson JH (2011) Soft real-time on multiprocessors: are analysis-based schedulers really worth it? In: RTSS, pp 99-103
14. Lee J, Easwaran A, Shin I (2011) Maximizing contention-free executions in multiprocessor scheduling. In: RTAS, pp 235-244
15. Lee SK (1994) On-line multiprocessor scheduling algorithms for real-time tasks. In: IEEE region 10 annual international conference, pp 607-611
16. Leontyev H, Anderson JH (2010) Generalized tardiness bounds for global multiprocessor scheduling. Real-Time Syst 44(1):26-71
17. Leontyev H, Chakraborty S, Anderson JH (2009) Multiprocessor extensions to real-time calculus. In: RTSS, pp 410-421
18. Megel T, Sirdey R, David V (2010) Minimizing task preemptions and migrations in multiprocessor optimal real-time schedules. In: RTSS, pp 37-46
19. Ogryczak W, Tamir A (2003) Minimizing the sum of the k largest functions in linear time. Inf Process Lett 85(3):117-122
20. Regnier P, Lima G, Massa E, Levin G, Brandt SRU (2011) Optimal multiprocessor real-time scheduling via reduction to uniprocessor. In: RTSS, pp 104-115
21. Srinivasan A, Baruah SK (2002) Deadline-based scheduling of periodic task systems on multiprocessors. Inf Process Lett 84(2):93-98
22. Ward BC, Erickson JP, Anderson JH (2013) A linear model for setting priority points in soft real-time systems. In: Alanfest, pp 192-205