A Mixed-Priority Queue with Applications to the Analysis of Real-Time Systems

Linus Schrage
Additional contact information
Linus Schrage: University of Chicago, Chicago, Illinois

Operations Research, 1969, vol. 17, issue 4, 728-742

Abstract: Jobs arrive in a Poisson stream to a single processor. Associated with each job is a priority j = 1, 2, …. The processing time requested by a job can be partitioned into an arbitrary number of intervals of two types, (1) noninterruptible portions and (2) interruptible portions. Type 2 intervals can further be classified as preemptive-resume intervals and preemptive-repeat intervals that, in turn, can be further classified as being repeat with resampling or repeat without resampling. When a job is interrupted, a setup time (which is interruptible) must first be expended before the job can regain the processor. Steady-state moments and Laplace transforms are obtained.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.4.728 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:17:y:1969:i:4:p:728-742

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().