Batch processor sharing with hyper-exponential service time

DOI10.1016/J.ORL.2007.11.003MaRDI QIDQ943802zbMATH OpenOpenAlexFDO

Authors Natalia Osipova

Publication date 10 September 2008

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0705.0425

zbMATH Keywords

batch processor sharingCauchy matriceshyper-exponential distributionLaplace transformtwo-level processor sharing

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Abstract: We study Batch Processor-Sharing (BPS) queuing model with hyper-exponential service time distribution and Poisson batch arrival process. One of the main goals to study BPS is the possibility of its application in size-based scheduling, which is used in differentiation between Short and Long flows in the Internet. In the case of hyper-exponential service time distribution we find an analytical expression of the expected conditional response time for the BPS queue. We show, that the expected conditional response time is a concave function of the service time. We apply the received results to the Two Level Processor-Sharing (TLPS) model with hyper-exponential service time distribution and find the expression of the expected response time for the TLPS model. TLPS scheduling discipline can be applied to size-based differentiation in TCP/IP networks and Web server request handling.

Recommendations

• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Sojourn time in a \(M^{[X]}/M/1\) processor sharing queue with batch arrivals
• On the M/G/1 foreground-background processor-sharing queue

Cites work

• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• scientific article; zbMATH DE number 3075795 (Why is no real title available?)
• On the nonoptimality of the foreground-background discipline for IMRL service times
• Sharing a Processor Among Many Job Classes
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals

Cited in

(5)

• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• Sojourn times in a processor sharing queue with multiple vacations
• scientific article; zbMATH DE number 4117617 (Why is no real title available?)
• Optimal choice of threshold in two level processor sharing

This page was built for publication: Batch processor sharing with hyper-exponential service time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943802)