ON NON-PREEMPTIVE PERIODIC SCHEDULING.

M. C. Kong, J. S. Deogun

Research output: Contribution to journalConference article

2 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)127-132
Number of pages6
JournalProceedings of the Hawaii International Conference on System Science
Volume2
StatePublished - Dec 1 1986

Fingerprint

Scheduling

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

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

In: Proceedings of the Hawaii International Conference on System Science, Vol. 2, 01.12.1986, p. 127-132.

Research output: Contribution to journalConference article

@article{f43bb3daba1c4b63be3bed142d0224e3,
title = "ON NON-PREEMPTIVE PERIODIC SCHEDULING.",
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.",
author = "Kong, {M. C.} and Deogun, {J. S.}",
year = "1986",
month = "12",
day = "1",
language = "English (US)",
volume = "2",
pages = "127--132",
journal = "Proceedings of the Hawaii International Conference on System Sciences",
issn = "1060-3425",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

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 -