A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems

Authors:
Terry Shepard;J. A. Martin Gagné
Affiliations:
Royal Military College of Canada, Kingston, Ont., Canada;Royal Military College of Canada, Kingston, Ont., Canada
Venue:
IEEE Transactions on Software Engineering
Year:
1991

Citing 3
Cited 13

On synchronization in hard-real-time systems

Communications of the ACM
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations

IEEE Transactions on Software Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

A real-time systems context for the framework for information systems architecture

IBM Systems Journal
Comment on "A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems"

IEEE Transactions on Software Engineering
Combined Task and Message Scheduling in Distributed Real-Time Systems

IEEE Transactions on Parallel and Distributed Systems
Stabilizing Pre-Run-Time Schedules With the Help of GraceTime

Real-Time Systems
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control

IEEE Transactions on Computers
Temporal Reasoning for a Collaborative Planning Agent in a Dynamic Environment

Annals of Mathematics and Artificial Intelligence
Evaluation of Process Scheduling Mechanism for a Web Server Based on Its Behavior while Executing

APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
On Inspection and Verification of Software with Timing Requirements

IEEE Transactions on Software Engineering
A Time Petri Net Approach for Finding Pre-Runtime Schedules in Embedded Hard Real-Time Systems

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
A Pipeline Virtual Service Pre-Scheduling Pattern and its Application in Astronomy Data Processing

Simulation
ACO approach with learning for preemptive scheduling of real-time tasks

International Journal of Bio-Inspired Computation
Off-line (Optimal) multiprocessor scheduling of dependent periodic tasks

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Review: Pre-run-time scheduling in real-time systems: Current researches and Artificial Intelligence perspectives

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor applications with preemptable processes having release times, computation times, deadlines and arbitrary precedence and exclusion constraints. The algorithm uses a branch-and-bound implicit enumeration technique to generate a feasible schedule for each processor. The set of feasible schedules ensures that the timing specifications of the processes are observed and that all the precedence and exclusion constraints between pairs of processes are satisfied. the algorithm was tested using a model derived from the F-18 mission computer operational flight program.