Average stretch without migration

Journal of Computer and System Sciences

Volumn 68, Issue 1, 2004, Pages 80-95

  Becchetti, Luca ^a   Leonardi, Stefano ^a   Muthukrishnan, S ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Average stretch; Migration; Scheduling

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; RESOURCE ALLOCATION; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING;

AVERAGE STRETCH; MIGRATION;

COMPUTATION THEORY;

EID: 0842278862     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2003.06.001     Document Type: Article

References (21)

1. S. Acharya, S. Muthukrishnan, G. Sundaram, Scheduling data delivery over multiple channels, Bell Labs Technical Memo, 1999. Available from acharya@research.bell-labs.com.
2. B. Awerbuch, Y. Azar, S. Leonardi, O. Regev, Minimizing the flow time without migration, in: Proceedings of the ACM Symposium on the Theory of Computing (STOC '99), Atlanta, GA, 1999, pp. 198-205.
3. K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
4. M. Bender, S. Chakrabarti, S. Muthukrishnan, Flow and stretch metrics for scheduling continuous job streams, in: Proceedings of Ninth ACM-SIAM Annual Symposium on Discrete Algorithms (SODA '98), San Francisco, CA, 1998, pp. 270-279.
5. A. Borodin, Ran El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, 1998.
6. M. Crovella, R. Frangioso, M., Harchol-Balter, Connection scheduling in web servers, Proceedings of the Second USENIX Symposium on Internet Technologies and Systems, Boulder, CO, 1999, pp. 243-254.
7. T.W. Doeppner, Threads, a system for the support of concurrent programming, Technical Report CS-87-11, Brown University, 1987.
8. J.E. Gehrke, S. Muthukrishnan, R. Rajaraman, A. Shaheen, Scheduling to minimize average stretch online, in: Proceedings of the Annual Symposium on Foundations of Computer Science, New York, NY, 1999, pp. 433-442.
9. S. Hameed, N. Vaidya, Log-time algorithms for scheduling single and multiple channel data broadcast. Proceedings of the International Conference on Mobile Computing and Networking (MOBICOM), Budapest, Hungary, 1997, pp. 90-99.
10. M. Harchol-Balter, M. Crovella, C. Murta, On choosing a task assignment policy for a distributed server system. Lecture Notes in Computer Science, Vol. 1469, Springer, Berlin, 1998, pp. 231-242.
11. Institute for Electrical and Electronic Engineers, POSIX P1003.4a, Threads Extensions for Portable Operating Systems, 1994.
12. R. Jain, The Art of Computer Systems Performance Analysis, Wiley, New York, 1991.
13. B. Kalyanasundaram, K. Pruhs, Eliminating migration in multi-processor scheduling, Journal of Algorithms, Special issue for the Ninth ACM-SIAM Symposium on Discrete Algorithms (SODA '99), 38:1, 2-24, 2001.
14. H. Kellerer, T. Tautenhahn, G.J. Woeginger, Approximability and nonapproximability results for minimizing total flow time on a single machine, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 1996, pp. 418-426.
15. G. Koren, A. Amir, E. Dar, The power of migration in multi-processor scheduling of real time systems, Proceedings of Ninth ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 226-235.
16. S. Leonardi, D. Raz, Approximating total flow time on parallel machines, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 110-119.
17. M. Mehta, D.J. De Witt, Dynamic memory allocation for multiple-query worloads, in: S. Baker, D. Bell (Eds.), very large data bases, VLDB 1993: Proceedings of the 19th International Conference on Very Large Data Bases, Morgan Kaufmann Publishers, Los Altos, CA, 1993, pp. 354-367.
18. F. Mueller, A library implementation of POSIX threads under UNIX, in: Proceedings of the Winter 1993 USENIX Technical Conference, San Diego, CA, January 1993, pp. 29-41.
19. D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM 28 (1985) 202-208.
20. Sun Microsystems, SunOS 5.3 System Services, November 1993.
21. H. Zhu, B. Smith, T. Yang, Hierarchical resource management for web server clusters with dynamic content, in: Proceedings of SIGMETRICS 1999, 1999, pp. 198-199.