Multiprocessor fixed-priority scheduling with restricted interprocessor migrations

Authors:
Sanjoy K. Baruah;John Carpenter
Affiliations:
The University of North Carolina, Department of Computer Science, CB 3175 Chapel Hill, NC 27599-3175, USA (Corresponding author. E-mail: baruah@cs.unc.edu);The University of North Carolina, Department of Computer Science, CB 3175 Chapel Hill, NC 27599-3175, USA
Venue:
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Year:
2005

Citing 4
Cited 3

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT

FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems

Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Early-release fair scheduling

Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems

Partition oriented frame based fair scheduler

Journal of Parallel and Distributed Computing
DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

Real-Time Systems
Job partitioning strategies for multiprocessor scheduling of real-time periodic tasks with restricted migrations

Proceedings of the 20th International Conference on Real-Time and Network Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The priority-driven scheduling of periodic and sporadic task systems upon identical multiprocessor platforms is considered, under the restrictions that (i) each job may be assigned exactly one priority throughout its lifetime, and (ii) each job may execute upon only a single processor. It is shown that feasibility-analysis under these restrictions is intractable (NP-hard in the strong sense). A scheduling algorithm is presented that satisfies these restrictions, and that has a worst-case utilization bound comparable to the worst-case utilization bounds of partitioned scheduling algorithms, and of scheduling algorithms that retain the priority-assignment restriction but allow arbitrary interprocessor migration.