Analysis of task migration in shared-memory multiprocessor scheduling
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Dynamic Programming and Optimal Control, Two Volume Set
Dynamic Programming and Optimal Control, Two Volume Set
Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
Commissioned Paper: Telephone Call Centers: Tutorial, Review, and Research Prospects
Manufacturing & Service Operations Management
Asymptotically optimal parallel resource assignment with interference
Queueing Systems: Theory and Applications
Realistic data transfer scheduling with uncertainty
Computer Communications
EMUNE: Architecture for Mobile Data Transfer Scheduling with Network Availability Predictions
Mobile Networks and Applications
| Hi-index | 0.01 |
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 11, μ12, μ22 21 = 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.