Scheduling processes with release times, deadlines, precedence and exclusion relations

An algorithm that finds an optimal schedule on a single processor for a given set of processes is presented. Each process starts executing after its release time and completes its computation before its deadline and a given set of precedence relations and exclusion relations defined on ordered pairs...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1990-03, Vol.16 (3), p.360-369
Main Authors: Xu, J., Parnas, D.L.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Automation
Computer programming
Computer science
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Councils
Deadlines
Exact sciences and technology
Optimal scheduling
Processor scheduling
Real time
Real time systems
Runtime
Schedules
Scheduling
Scheduling algorithm
Software
Timing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An algorithm that finds an optimal schedule on a single processor for a given set of processes is presented. Each process starts executing after its release time and completes its computation before its deadline and a given set of precedence relations and exclusion relations defined on ordered pairs of process segments are satisfied. This algorithm can be applied to the important and previously unsolved problem of automated pre-run-time scheduling of processes with arbitrary precedence and exclusion in hard-real-time systems.< >
ISSN:0098-5589
1939-3520
DOI:10.1109/32.48943