Analysis of Round-Robin Variants: Favoring Newly Arrived Jobs

Free registration required

Executive Summary

Highly varying job demands generally consist of many short jobs mixed with several long jobs. In principle, without fore knowledge of exact service times of individual jobs, processor sharing is an effective theoretical strategy for handling such demands. In practice, however, processor sharing must be implemented by time-slicing, which incurs non-negligible job switching overhead for small time-slices. A research issue is then how time-slicing performs if large time-slices have to be used. In this paper, the authors investigate several round-robin variants and the results from Discrete Event Simulation show that, by favoring newly arrived jobs, the performance of round-robin with large time-slices could be better than that of ideal processor sharing.

  • Format: PDF
  • Size: 99.7 KB