Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations

The author presents a scheduling algorithm that solves the problem of finding a feasible nonpreemptive schedule whenever one exists on M identical processors for a given set of processes such that each process starts executing after its release time and completes its computation before its deadline....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on software engineering Jg. 19; H. 2; S. 139 - 154
1. Verfasser: Xu, J.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.02.1993
Institute of Electrical and Electronics Engineers
IEEE Computer Society
Schlagworte:
Algorithm design and analysis
Algorithms
Applied sciences
Automation
Computer science
Computer science; control theory; systems
Deadlines
Exact sciences and technology
Heuristic
Information processing
Microprocessors
Processor scheduling
Runtime
Schedules
Scheduling
Scheduling algorithm
Software
Software engineering
Studies
Systems development
Timing
Multiprocessor
Scheduling
Algorithm
Real time system
Priority
ISSN:0098-5589, 1939-3520
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The author presents a scheduling algorithm that solves the problem of finding a feasible nonpreemptive schedule whenever one exists on M identical processors for a given set of processes such that each process starts executing after its release time and completes its computation before its deadline. A given set of precedence relations and a given set of exclusion relations defined on ordered pairs of process segments are satisfied. This algorithm can be applied to the important problem of automated pre-run-time scheduling of processes with arbitrary precedence and exclusion relations on multiprocessors in hard-real-time systems.< >
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0098-5589
1939-3520
DOI:10.1109/32.214831