Multiprocessor Scheduling of Real-Time Tasks with Resource Requirements

Authors:
Costas Mourlas
Affiliations:
-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 4
Cited 0

Software architecture for hard real-time applications: cyclic executives vs. fixed priority executives

Real-Time Systems
Synchronization in Real-Time Systems: A Priority Inheritance Approach

Synchronization in Real-Time Systems: A Priority Inheritance Approach
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
On Satisfying Timing and Resource Constraints in Distributed Multimedia Systems

ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new synchronization strategy for real-time tasks executed in a parallel environment. This strategy makes the timing properties of the system predictable since one is able to determine analytically whether the timing requirements of a task set will be met, and if not, which task timing requirements will fail. The proposed synchronization protocol is based on the on-demand paradigm where resources are assigned only when actually required so that the system never wastes unused assignments. Simple formulae for the worst-case determination of task blocking durations as well as for the schedulability analysis of a set of tasks are described. A schedulability analysis example is also presented that illustrates the concepts of scheduling and resource allocation of a set of time critical tasks.