article

Optimal scheduling in a multiserver stochastic network

Authors:

Mohsen Bayati,

Mayank Sharma,

Mark S. SquillanteAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 34, Issue 3

Pages 45 - 47

https://doi.org/10.1145/1215956.1215974

Published: 01 December 2006 Publication History

Get Access

Abstract

We consider a fundamental scheduling problem in a multiserver stochastic network consisting of 2 classes of customers and 2 classes of servers. Customers of class k arrive to queue k according to a Poisson process with rate λ_k, k = 1, 2. The service times of class k customers at class ℓ servers are i.i.d. following an exponential distribution with mean μ_kℓ^-1, ∀k, ℓ = 1, 2, where 0 < μ₁₁, μ₁₂, μ₂₂ < ∞ and μ₂₁ = 0. Hence, class 1 customers can be served at both classes of servers, but class 2 customers can only be served at class 2 servers. A FCFS queueing discipline is employed at each queue. The customer arrival and service processes are mutually independent of each other and of all resource allocation decisions.

References

[1]

M. Bayati, M. Sharma, M. S. Squillante. Optimal scheduling in a multiserver stochastic network. Technical Report, 2006.

Digital Library

Google Scholar

[2]

S. L. Bell and R. J. Williams. Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Prob., 11:608--649, 2001.

Crossref

Google Scholar

[3]

D. P. Bertsekas. Dynamic Programming and Optimal Control, Volume II. Athena Scientific, 2nd edition, 2001.

Digital Library

Google Scholar

[4]

N. Gans, G. Koole, and A. Mandelbaum. Telephone call centers: Tutorial, review, and research prospects. M&SOM, 5:79--141, 2003.

Digital Library

Google Scholar

[5]

M. S. Squillante and E. D. Lazowska. Using processor-cache affinity information in shared-memory multiprocessor scheduling. IEEE Trans. Par. Dist. Sys., 4(2):131--143, 1993.

Digital Library

Google Scholar

[6]

M. S. Squillante and R. D. Nelson. Analysis of task migration in shared-memory multiprocessors. Proc. ACM SIGMETRICS Conf. Meas. and Mod. Comp. Sys., pp. 143--155, 1991.

Digital Library

Google Scholar

[7]

M. S. Squillante, C. H. Xia, D. D. Yao, and L. Zhang. Threshold-based priority policies for parallel-server systems with affinity scheduling. Proc. Am. Cont. Conf., pp. 2992--2999, 2001.

Crossref

Google Scholar

Cited By

View all

Rathnayake UPetander HOtt MSeneviratne A(2012)EMUNEMobile Networks and Applications10.1007/s11036-011-0332-417:2(216-233)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1007/s11036-011-0332-4
Rathnayake UIftikhar MOtt MSeneviratne A(2011)Realistic data transfer scheduling with uncertaintyComputer Communications10.1016/j.comcom.2010.02.01234:9(1055-1065)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1016/j.comcom.2010.02.012
Rathnayake UIftikhar MOtt MSeneviratne A(2010)Mobile Data Transfer Scheduling with Uncertainty2010 IEEE International Conference on Communications10.1109/ICC.2010.5502368(1-6)Online publication date: May-2010
https://doi.org/10.1109/ICC.2010.5502368
Show More Cited By

Optimal scheduling in a multiserver stochastic network

Recommendations

A multiserver retrial queue: regenerative stability analysis

We consider a multiserver retrial GI / G / m queue with renewal input of primary customers, interarrival time with rate $\lambda=1/\mathsf{E}\tau$ , service time S , and exponential retrial times of customers blocked in the orbit. In the model, an arriving primary ...
Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System

We consider a single stage queueing system with c heterogeneous servers. Customers arrive at this system according to a renewal process with mean 1/λ and squared coefficient of variation scv C _a². An incoming customer is routed to server i with ...
Multiserver Queueing Models of Multiprocessing Systems

Conventional time sharing and multiprogramming systems have been extensively modeled as single-server queues. In contrast, multiprocessing systems must be modeled as multiserver queueing systems. This paper investigates the effect of the scheduling ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 34, Issue 3

December 2006

62 pages

ISSN:0163-5999

DOI:10.1145/1215956

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2006

Published in SIGMETRICS Volume 34, Issue 3

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
146
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Rathnayake UPetander HOtt MSeneviratne A(2012)EMUNEMobile Networks and Applications10.1007/s11036-011-0332-417:2(216-233)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1007/s11036-011-0332-4
Rathnayake UIftikhar MOtt MSeneviratne A(2011)Realistic data transfer scheduling with uncertaintyComputer Communications10.1016/j.comcom.2010.02.01234:9(1055-1065)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1016/j.comcom.2010.02.012
Rathnayake UIftikhar MOtt MSeneviratne A(2010)Mobile Data Transfer Scheduling with Uncertainty2010 IEEE International Conference on Communications10.1109/ICC.2010.5502368(1-6)Online publication date: May-2010
https://doi.org/10.1109/ICC.2010.5502368
Verloop INúñez-Queija R(2010)Asymptotically optimal parallel resource assignment with interferenceQueueing Systems: Theory and Applications10.1007/s11134-010-9171-465:1(43-92)Online publication date: 1-May-2010
https://dl.acm.org/doi/10.1007/s11134-010-9171-4

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Recommendations

A multiserver retrial queue: regenerative stability analysis

Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System

Multiserver Queueing Models of Multiprocessing Systems

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations