Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

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

Linus Schrage
Operations Research
Vol. 17, No. 4 (Jul. - Aug., 1969), pp. 728-742
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/168543
Page Count: 15
  • Download ($30.00)
  • Cite this Item
A Mixed-Priority Queue with Applications to the Analysis of Real-Time Systems
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
728
    728
  • Thumbnail: Page 
729
    729
  • Thumbnail: Page 
730
    730
  • Thumbnail: Page 
731
    731
  • Thumbnail: Page 
732
    732
  • Thumbnail: Page 
733
    733
  • Thumbnail: Page 
734
    734
  • Thumbnail: Page 
735
    735
  • Thumbnail: Page 
736
    736
  • Thumbnail: Page 
737
    737
  • Thumbnail: Page 
738
    738
  • Thumbnail: Page 
739
    739
  • Thumbnail: Page 
740
    740
  • Thumbnail: Page 
741
    741
  • Thumbnail: Page 
742
    742