The feasibility of general task systems with precedence constraints on multiprocessor platforms

Authors:
Nathan Fisher;Sanjoy Baruah
Affiliations:
Department of Computer Science, Wayne State University, Detroit, USA;Department of Computer Science, The University of North Carolina at Chapel Hill, Chapel Hill, USA
Venue:
Real-Time Systems
Year:
2009

Citing 12
Cited 2

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling

IEEE Transactions on Computers
Optimal time-critical scheduling via resource augmentation (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A Multiframe Model for Real-Time Tasks

IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Generalized Multiframe Tasks

Real-Time Systems
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks

Real-Time Systems
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT

FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling

IEEE Transactions on Computers
The Partitioned Multiprocessor Scheduling of Deadline-Constrained Sporadic Task Systems

IEEE Transactions on Computers
A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium

Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

Real-Time Systems
Propagation rules of real-time constraints on physical systems simulators in a hardware-in-the loop context

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-real-time jobs executed on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration is permitted. The collection of jobs may contain precedence constraints upon the order of execution of these jobs. The derived tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.