Competitive Analysis of Network Load Balancing
- 1 February 1997
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 40 (2) , 162-172
- https://doi.org/10.1006/jpdc.1996.1257
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- Efficient routing and message bounds for optimal parallel algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- LogP: towards a realistic model of parallel computationPublished by Association for Computing Machinery (ACM) ,1993
- Competitive distributed job scheduling (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- Competitive snoopy cachingAlgorithmica, 1988
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Adaptive load sharing in homogeneous distributed systemsIEEE Transactions on Software Engineering, 1986
- A distributed load‐balancing policy for a multicomputerSoftware: Practice and Experience, 1985
- Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor SystemIEEE Transactions on Computers, 1979
- Bounds for LPT Schedules on Uniform ProcessorsSIAM Journal on Computing, 1977
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966