Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
Authors:
- B. AnderssonBAB. Andersson
- J. JonssonJJJ. Jonsson
- 8 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 337-346
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Design and evaluation of a feedback control EDF scheduling algorithm2003
- Using exact feasibility tests for allocating real-time tasks in multiprocessor systems2002
- QoS negotiation in real-time systems and its application to automated flight control2002
- Allocating fixed-priority periodic tasks on multiprocessor systemsReal-Time Systems, 1995
- New strategies for assigning real-time tasks to multiprocessor systemsIEEE Transactions on Computers, 1995
- A new algorithm for scheduling periodic, real-time tasksAlgorithmica, 1989
- Finding Response Times in a Real-Time SystemThe Computer Journal, 1986
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- On a Real-Time Scheduling ProblemOperations Research, 1978
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973