An approximate analysis of the shortest queue policy on soft real-time scheduling

Authors:
Weiping Zhu
Affiliations:
School of Computer Science, The University of New South Wales, ADFA, Australia, ACT2600
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2000

Citing 0
Cited 1

Dynamic routing of real-time jobs among parallel EDF queues: A performance study

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The join the shortest queue (JSQ) policy is studied in the context of soft real-time scheduling. An approximate analysis of the JSQ is developed and presented in this paper. The result obtained from the approximate analysis is compared against the simulation one, that shows the approximate analysis is highly accurate. Thus, the approximate analysis can be applied to the development of soft real-time systems.