Online server allocation in a server farm via benefit task systems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 540-549

  Jayram, T S ^a   Kimbrel, Tracy ^b   Krauthgamer, Robert ^c   Schieber, Baruch ^b   Sviridenko, Maxim ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; ONLINE SYSTEMS; POLYNOMIALS; RESOURCE ALLOCATION; WEBSITES;

BENEFIT TASK SYSTEMS; WEB HOSTING;

SERVERS;

EID: 0034825323     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380849     Document Type: Conference Paper

References (20)

1. Making commitments in the face of uncertainty: How to pick a winner almost every time
2. A unified approach to approximating resource allocation and scheduling
3. Bandwidth allocation with preemption
4. Approximating the throughput of multiple machines under real-time scheduling
5. Competitive dynamic bandwidth allocation
6. On the competitiveness of online real-time task scheduling
7. Online scheduling in the presence of overload
8. An optimal on-line algorithm for metrical task system
9. Efficient online call control algorithms
10. Analysis and characterization of large-scale web server access patterns and performance
11. D-over: An optimal on-line scheduling algorithm for overloaded real-time systems
12. On-line interval scheduling
13. Competitive algorithms for server problems
14. Integrating scheduling with batching and lot sizing: A review of algorithms and complexity
15. Web traffic modeling and web server performance analysis