Static-priority scheduling on multiprocessors

By Björn Andersson, Sanjoy Baruah, Jan Jonsson. IEEE Real-Time Systems Symposium, 2001

379 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/b2391c5d2ab2e51396b0b983f2157b5d1bde7347

How researchers see this paper

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

In Computer Networks and Communications

In Hardware and Architecture

Citations in the corpus

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].”
Real Time Scheduling Theory: A Historical Perspective (2004, background): “In 2001, Andersson, Baruah, and Jonsson [15] showed that the utilization guarantee for any fixed-priority multiprocessor scheduling algorithm – partitioned or global, with any priority scheme – cannot be higher than (m + 1)/2 for an m-processor platform.”
A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms (2004, methodology): “In addition to these, (1, 3)- and (2, 3)-restricted algorithms were recently considered in [4] and [25], respectively.”
Scheduling and locking in multiprocessor real-time operating systems (2011, background): “partitioned onto m processors (Oh and Baker, 1998; Andersson et al., 2001; Andersson and Jonsson, 2003), where is an arbitrary small positive number.”
Energy-aware partitioning for multiprocessor real-time systems (2003, background): “In global scheduling [1, 7, 11], there is a single ready queue and task migrations among processors are allowed.”
A survey of hard real-time scheduling for multiprocessor systems (2011, methodology): “Andersson and Tovar [2006] introduced EKG, an approach to scheduling periodic tasksets with implicit deadlines, based on partitioned scheduling, but splitting some tasks into two components that execute at different times on different processors.”