Khemka, Ashok ; Shyamasundar, R. K. (1997) An optimal multiprocessor real-time scheduling algorithm Journal of Parallel and Distributed Computing, 43 (1). pp. 37-45. ISSN 0743-7315
Full text not available from this repository.
Official URL: http://www.sciencedirect.com/science/article/pii/S...
Related URL: http://dx.doi.org/10.1006/jpdc.1997.1327
Abstract
An optimal scheduling algorithm is described that feasibly schedules a set ofmperiodic tasks onnprocessors 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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| ID Code: | 56596 |
| Deposited On: | 24 Aug 2011 10:59 |
| Last Modified: | 24 Aug 2011 10:59 |
Repository Staff Only: item control page
