.png){kind=icon}
Return
An optimal multiprocessor real-time scheduling algorithm
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1997.1327.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisfies certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of processors and upper bounds on the number of preemptions in a given time interval and for any single task is also derived. The optimal algorithm is shown to be particularly useful when schedules are built from the integral flow values obtained from the corresponding maximum flow network. (C) 1997 Academic Press.
Keywords:
UNIFORM
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveDasatinib crosses the blood-brain barrier and is an efficient therapy for central nervous system Philadelphia chromosome–positive leukemia.png)
Blood
OAAI
BloodIF0
OAAIShareSaveReconstitution of Escherichia coli DNA photolyase with various folate derivativesBiochemistry
BiochemistryIF0
PREAI
ShareSaveShareSave
View more