Composite priority queue

  • Authors:
  • T. W. Gay;P. H. Seaman

  • Affiliations:
  • IBM System Development Division Laboratory, Poughkeepsie, New York;IBM System Development Division Laboratory, Poughkeepsie, New York

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1975

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents formulas for calculating waiting time for customers in a queue with combined preemptive and head-of-line (nonpreemptive) priority scheduling disciplines and describes the reasoning behind them. This work has been applied in the development of programmable terminal control units.