Feasibility Analysis of Preemptive Real-Time Systems upon Heterogeneous Multiprocessor Platforms

Authors:
Sanjoy Baruah
Affiliations:
University of North Carolina at Chapel Hill
Venue:
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Year:
2004

Citing 0
Cited 8

Provably good task assignment on heterogeneous multiprocessor platforms for a restricted case but with a stronger adversary

ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
Globally scheduled real-time multiprocessor systems with GPUs

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
Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

Real-Time Systems
Dynamic task partition for video decoding on heterogeneous dual-core platforms

ACM Transactions on Embedded Computing Systems (TECS) - Special section on ESTIMedia'12, LCTES'11, rigorous embedded systems design, and multiprocessor system-on-chip for cyber-physical systems
An optimal k-exclusion real-time locking protocol motivated by multi-GPU systems

Real-Time Systems
Task assignment algorithms for two-type heterogeneous multiprocessors

Real-Time Systems
Real-time scheduling with resource sharing on heterogeneous multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a collection of recurring tasks or processes that comprise a real-time system, and a collection of available processing units of different kinds upon which to execute them, the heterogeneous multiprocessor feasibility problem is concerned with determining whether the given tasks can be executed on the available processing units in such a manner that all timing constraints are met. A preemptive scheduling model is assumed. Under the partitioned scheduling paradigm - each task may execute on only one processor - this problem has previously been shown to be intractable. Under the global scheduling paradigm, however, a polynomial-time algorithm for heterogeneous multiprocessor feasibility analysis is presented here, and proved correct. An upper bound is derived upon the number of tasks that need to be executed upon multiple processors: even in the worst case, it is shown that this number is reasonable small (of the order of the number of processors), implying that the benefits of global scheduling are available without requiring that too many tasks be forced to execute on multiple processors.