Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors

By J. Goossens, Shelby H. Funk, Sanjoy Baruah. Real-time systems, 2003

330 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Flexible Real-Time Locking Protocol for Multiprocessors (2007, methodology): “for each i nk. For the FMLP-G, we inated the execution costs of tasks by their respective blocking terms and used the G-EDF schedulability test given in [ 14 , 22].”
Real Time Scheduling Theory: A Historical Perspective (2004, result): “This was followed by a number of other results by other authors on schedulability of both identical and “uniform” (meaning differing only in speed) processors [15, 33, 78, 85].”
LITMUS^RT : A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers (2006, methodology): “For G-EDF, the sufficient schedulability test in [4, 12] was used.”
Multiprocessor EDF and deadline monotonic schedulability analysis (2003, background): “…speed then the same task set is schedulable by preemptive EDF scheduling on Ñ processors that are faster by a factor of´¾ ½ Ñ µ. Based on this paper, several overlapping teams of authors have produced a series of schedulability tests for multiprocessor EDF and RM scheduling[2] [6] [7] [8] [18].”
A survey of hard real-time scheduling for multiprocessor systems (2011, methodology): “—GFB, density-based test [Goossens et al. 2003]; —BAK [Baker 2005]; —BAR [Baruah 2007]; —LOAD, processor load-based test [Baruah and Baker 2009]; —BCL, [Bertogna et al.”