The Response Times of Priority Classes under ... - Semantic Scholar
Purdue University
Purdue e-Pubs Computer Science Technical Reports
Department of Computer Science
1981
The Response Times of Priority Classes under Preemptive Resume in M/G/m Queues A. B. Bondi J. P. Buzen Report Number: 81-404
Bondi, A. B. and Buzen, J. P., "The Response Times of Priority Classes under Preemptive Resume in M/G/m Queues" (1981). Computer Science Technical Reports. Paper 331. http://docs.lib.purdue.edu/cstech/331
This document has been made available through Purdue e-Pubs, a service of the Purdue University Libraries. Please contact [email protected] for additional information.
The Respdnse Tim.es of Priority Classes under
Preemptive Resume in M/G/m Queues· AB. Bondi Department of Computer Sciences, Purdue University, West Lafayette, Indiana J,P. Buzen BGS Systems, Inc., Waltham, Massachusetts CSD-TR No. 404, November 1982 Revised July 1983
ABSTRACT Approximations are given for the mean response times of each prIority level in a two·class multi-server M/G/m queue operattng under preemptive reswne scheduling, The results have been tested against s1mulatlons for different numbers of servers.
The Response Times of Priority Classes under Preemptive Resume in MIGlm Queues • A.B. Bondi Department of Computer Sciences, Purdue University, West Lafayette. Indiana J,P. Buzan
BGS Systems, Inc., Waltham. Massachusetts CSD-TR No. 404. November 1982 Revised July 1983
Introduction Many computer systems have central processing units which are allocated to jobs for short bursty periods whose durations have arbitrary distributions. Jobs at low
priority levels may be preempted by those at higher ones, and the mean burst size may be difl'erent at each priority level. This note examines the queueing delays of jobs at
two priority levels subject to preemptive resume scheduling. In a recent paper, Buzen and Bondi (1983) [3] derived approximate expressions for the mean response times of each priority level in an M/M/m preemptive priority queue. These approximations have been found to agree with the exact results for two class systems of Mitrani and King [8] as well as with simulation results for three classes
• This '\I."ork wa.s sUppori.ed in part by NSF grant nwnber 1I(:S78-01729, Author:;' addresses: A.B. Bondi, Dept. of Computer Sciences, Purdue University, West Luf
Purdue e-Pubs Computer Science Technical Reports
Department of Computer Science
1981
The Response Times of Priority Classes under Preemptive Resume in M/G/m Queues A. B. Bondi J. P. Buzen Report Number: 81-404
Bondi, A. B. and Buzen, J. P., "The Response Times of Priority Classes under Preemptive Resume in M/G/m Queues" (1981). Computer Science Technical Reports. Paper 331. http://docs.lib.purdue.edu/cstech/331
This document has been made available through Purdue e-Pubs, a service of the Purdue University Libraries. Please contact [email protected] for additional information.
The Respdnse Tim.es of Priority Classes under
Preemptive Resume in M/G/m Queues· AB. Bondi Department of Computer Sciences, Purdue University, West Lafayette, Indiana J,P. Buzen BGS Systems, Inc., Waltham, Massachusetts CSD-TR No. 404, November 1982 Revised July 1983
ABSTRACT Approximations are given for the mean response times of each prIority level in a two·class multi-server M/G/m queue operattng under preemptive reswne scheduling, The results have been tested against s1mulatlons for different numbers of servers.
The Response Times of Priority Classes under Preemptive Resume in MIGlm Queues • A.B. Bondi Department of Computer Sciences, Purdue University, West Lafayette. Indiana J,P. Buzan
BGS Systems, Inc., Waltham. Massachusetts CSD-TR No. 404. November 1982 Revised July 1983
Introduction Many computer systems have central processing units which are allocated to jobs for short bursty periods whose durations have arbitrary distributions. Jobs at low
priority levels may be preempted by those at higher ones, and the mean burst size may be difl'erent at each priority level. This note examines the queueing delays of jobs at
two priority levels subject to preemptive resume scheduling. In a recent paper, Buzen and Bondi (1983) [3] derived approximate expressions for the mean response times of each priority level in an M/M/m preemptive priority queue. These approximations have been found to agree with the exact results for two class systems of Mitrani and King [8] as well as with simulation results for three classes
• This '\I."ork wa.s sUppori.ed in part by NSF grant nwnber 1I(:S78-01729, Author:;' addresses: A.B. Bondi, Dept. of Computer Sciences, Purdue University, West Luf
