### Abstract

The periodic real-time scheduling problem for a time-shared m-processor computing system is studied. The objective is to schedule a set of periodically occurring time-critical tasks such that all prescribed deadlines are met. Each task J//i to be scheduled requests C//i units of computation time for every T//i units of time, and each request of J must be executed, without interruption, till its completion before the next request of the same task occurs. The task systems with the properties that T//i equals kT//i// minus //1, 2 less than equivalent to i less than equivalent to n, k greater than equivalent to 2, are investigated. Optimal algorithms, together with necessary and sufficient conditions that will guarantee the existence of a feasible schedule, are developed and analyzed.

Original language | English (US) |
---|---|

Pages (from-to) | 127-132 |

Number of pages | 6 |

Journal | Proceedings of the Hawaii International Conference on System Science |

Volume | 2 |

State | Published - Dec 1 1986 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)

### Cite this

*Proceedings of the Hawaii International Conference on System Science*,

*2*, 127-132.

**ON NON-PREEMPTIVE PERIODIC SCHEDULING.** / Kong, M. C.; Deogun, J. S.

Research output: Contribution to journal › Conference article

*Proceedings of the Hawaii International Conference on System Science*, vol. 2, pp. 127-132.

}

TY - JOUR

T1 - ON NON-PREEMPTIVE PERIODIC SCHEDULING.

AU - Kong, M. C.

AU - Deogun, J. S.

PY - 1986/12/1

Y1 - 1986/12/1

N2 - The periodic real-time scheduling problem for a time-shared m-processor computing system is studied. The objective is to schedule a set of periodically occurring time-critical tasks such that all prescribed deadlines are met. Each task J//i to be scheduled requests C//i units of computation time for every T//i units of time, and each request of J must be executed, without interruption, till its completion before the next request of the same task occurs. The task systems with the properties that T//i equals kT//i// minus //1, 2 less than equivalent to i less than equivalent to n, k greater than equivalent to 2, are investigated. Optimal algorithms, together with necessary and sufficient conditions that will guarantee the existence of a feasible schedule, are developed and analyzed.

AB - The periodic real-time scheduling problem for a time-shared m-processor computing system is studied. The objective is to schedule a set of periodically occurring time-critical tasks such that all prescribed deadlines are met. Each task J//i to be scheduled requests C//i units of computation time for every T//i units of time, and each request of J must be executed, without interruption, till its completion before the next request of the same task occurs. The task systems with the properties that T//i equals kT//i// minus //1, 2 less than equivalent to i less than equivalent to n, k greater than equivalent to 2, are investigated. Optimal algorithms, together with necessary and sufficient conditions that will guarantee the existence of a feasible schedule, are developed and analyzed.

UR - http://www.scopus.com/inward/record.url?scp=0023031435&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023031435&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0023031435

VL - 2

SP - 127

EP - 132

JO - Proceedings of the Hawaii International Conference on System Sciences

JF - Proceedings of the Hawaii International Conference on System Sciences

SN - 1060-3425

ER -