Learn More
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduling on each individual processor. Since the partitioning problem is easily seen to be NP-hard in the strong sense, this algorithm is not optimal. A quantitative characterization of(More)
In this 25th year anniversary paper for the IEEE Real Time Systems Symposium, we review the key results in real time scheduling theory and the historical events that led to the establishment of the current real time computing infrastructure. We conclude this paper by looking at the challenges ahead of us.
This report describes a necessary and sufficient test for the schedulability of a set of sporadic hard-deadline tasks on a multiprocessor platform, using any of a variety of scheduling policies including global fixed task-priority and earliest-deadline-first (EDF). The contribution is to establish an upper bound on the computational complexity of this(More)
We consider the schedulability of a set of independent periodic tasks under xed priority preemptive scheduling on homogeneous multiprocessor systems. Assuming there is no task migration between processors and each processor schedules tasks preemptively according to xed priorities assigned by the Rate Monotonic policy, the scheduling problem reduces to(More)