Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems

Authors:
Sanjoy Baruah;Nathan Fisher
Affiliations:
Department of Computer Science, The University of North Carolina at Chapel Hill, Chapel Hill, USA 27599-3175;Department of Computer Science, The University of North Carolina at Chapel Hill, Chapel Hill, USA 27599-3175
Venue:
Real-Time Systems
Year:
2008

Citing 18
Cited 2

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
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)
Improvement in feasibility testing for real-time tasks

Real-Time Systems
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
A multiframe model for real-time tasks

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
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
An Event Stream Driven Approximation for the Analysis of Real-Time Systems

ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
The Partitioned Scheduling of Sporadic Real-Time Tasks on Multiprocessor Platforms

ICPPW '05 Proceedings of the 2005 International Conference on Parallel Processing Workshops
A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
An Analysis of Fixed-Priority Schedulability on a Multiprocessor

Real-Time Systems
Algorithms for Determining the Demand-Based Load of a Sporadic Task System

RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Job partitioning strategies for multiprocessor scheduling of real-time periodic tasks with restricted migrations

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for feasibility analysis of a collection of sporadic jobs where job migration between processors is forbidden. The fixed-priority scheduling of real-time jobs with job migration is analyzed, and sufficient tests of schedulability are obtained for the deadline-monotonic (dm) and the earliest-deadline-first (edf) scheduling algorithms. The feasibility and schedulability tests of this paper may be applied even when the collection of jobs is incompletely specified. The applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks is discussed. In particular, sufficient conditions for the dm scheduling of sporadic task systems are derived and compared to previously-known tests.