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....

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on software engineering Vol. 19; no. 2; pp. 139 - 154
Main Author:	Xu, J.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.02.1993 Institute of Electrical and Electronics Engineers IEEE Computer Society
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!