Online server allocation in a server farm via benefit task systems
- 6 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 540-549
- https://doi.org/10.1145/380752.380849
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A unified approach to approximating resource allocation and schedulingPublished by Association for Computing Machinery (ACM) ,2000
- Web traffic modeling and Web server performance analysisACM SIGMETRICS Performance Evaluation Review, 1999
- Approximating the throughput of multiple machines under real-time schedulingPublished by Association for Computing Machinery (ACM) ,1999
- Bandwidth Allocation with PreemptionSIAM Journal on Computing, 1999
- Competitive dynamic bandwidth allocationPublished by Association for Computing Machinery (ACM) ,1998
- Making commitments in the face of uncertaintyPublished by Association for Computing Machinery (ACM) ,1996
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time SystemsSIAM Journal on Computing, 1995
- An optimal on-line algorithm for metrical task systemJournal of the ACM, 1992
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and ComplexityJournal of the Operational Research Society, 1992
- Competitive algorithms for server problemsJournal of Algorithms, 1990