Generalized Tardiness Bounds for Global Multiprocessor Scheduling

Authors:
Hennadiy Leontyev;James H. Anderson
Affiliations:
-;-
Venue:
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Year:
2007

Citing 0
Cited 7

A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

Real-Time Systems
Generalized tardiness bounds for global multiprocessor scheduling

Real-Time Systems
Spin-based reader-writer synchronization for multiprocessor real-time systems

Real-Time Systems
An overview of interrupt accounting techniques for multiprocessor real-time systems

Journal of Systems Architecture: the EUROMICRO Journal
Data stream warehousing

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Implementation and evaluation of global and partitioned scheduling in a real-time OS

Real-Time Systems
Supporting soft real-time parallel applications on multiprocessors

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the issue of deadline tardiness under global multiprocessor scheduling algorithms. We present a general tardiness-bound derivation that is applicable to a wide variety of such algorithms (including some whose tardiness behavior has not been analyzed before). Our derivation is very general: job priorities may change rather arbitrarily at runtime, arbitrary non-preemptive regions are allowed, and capacity restrictions may exist on certain processors. Our results show that, with the exception of static-priority algorithms, most global algorithms considered previously have bounded tardiness. In addition, our results provide a simple means for checking whether tardiness is bounded under newly-developed algorithms.