Real-time scheduling with resource sharing on uniform multiprocessors

Authors:
Gurulingesh Raravi;Vincent Nélis;Björn Andersson
Affiliations:
CISTER/INESC-TEC, ISEP, Polytechnic Institute of Porto, Porto, Portugal;CISTER/INESC-TEC, ISEP, Polytechnic Institute of Porto, Porto, Portugal;Carnegie Mellon University, Pittsburgh
Venue:
Proceedings of the 20th International Conference on Real-Time and Network Systems
Year:
2012

Citing 11
Cited 0

Optimal time-critical scheduling via resource augmentation (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Journal of the ACM (JACM)
Static-Priority Scheduling on Multiprocessors

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

Real-Time Systems
The partitioned dynamic-priority scheduling of sporadic task systems

Real-Time Systems
A Flexible Real-Time Locking Protocol for Multiprocessors

RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Notional Processors: An Approach for Multiprocessor Scheduling

RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling

Real-Time Systems
Provably good multiprocessor scheduling with resource sharing

Real-Time Systems
Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of ρ shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that allows a task to migrate only when it accesses or releases a resource, then our algorithm also meets the deadlines with the same restriction on the task migration, if given processors 4 + 6ρ times as fast. The proposed algorithm, by design, limits the number of migrations per job to at most two. To the best of our knowledge, this is the first result for resource sharing on uniform multiprocessors with proven performance guarantee.