On Choosing a Task Assignment Policy for a Distributed Server System
- 1 November 1999
- journal article
- Published by Elsevier BV in Journal of Parallel and Distributed Computing
- Vol. 59 (2), 204-228
- https://doi.org/10.1006/jpdc.1999.1577
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Self-similarity in World Wide Web traffic: evidence and possible causesIEEE/ACM Transactions on Networking, 1997
- Exploiting process lifetime distributions for dynamic load balancingACM Transactions on Computer Systems, 1997
- Wide area traffic: the failure of Poisson modelingIEEE/ACM Transactions on Networking, 1995
- An approximation for the mean response time for shortest queue routing with general interarrival and service timesPerformance Evaluation, 1993
- An approximation to the response time for shortest queue routingACM SIGMETRICS Performance Evaluation Review, 1989
- Deciding Which Queue to Join: Some CounterexamplesOperations Research, 1986
- A simple dynamic routing problemIEEE Transactions on Automatic Control, 1980
- On the optimal assignment of customers to parallel serversJournal of Applied Probability, 1978
- Optimality of the shortest line disciplineJournal of Applied Probability, 1977