Average stretch without migration

[1]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[2]  G. Grisetti,et al.  Further Reading , 1984, IEEE Spectrum.

[3]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[4]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[5]  Joseph Y.-T. Leung,et al.  Minimizing Mean Flow Time with Release Time Constraint , 1990, Theor. Comput. Sci..

[6]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[7]  S. Jørgensen.  The art of computer systems performance analysis: Techniques for Experimental Design, Measurement, Simulation and Modeling. Raj Jain. John Wiley, New York. Hardcover, 720 p. U.S. $52.95. , 1992 .

[8]  David J. DeWitt,et al.  Dynamic Memory Allocation for Multiple-Query Workloads , 1993, VLDB.

[9]  Frank Mueller,et al.  A Library Implementation of POSIX Threads under UNIX , 1993, USENIX Winter.

[10]  Leslie A. Hall,et al.  Approximation algorithms for scheduling , 1996 .

[11]  Gerhard J. Woeginger,et al.  Approximability and nonapproximability results for minimizing total flow time on a single machine , 1996, STOC '96.

[12]  David B. Shmoys,et al.  Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.

[13]  Nitin H. Vaidya,et al.  Log-time algorithms for scheduling single and multiple channel data broadcast , 1997, MobiCom '97.

[14]  Stefano Leonardi,et al.  Approximating total flow time on parallel machines , 1997, STOC '97.

[15]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[16]  Michael A. Bender,et al.  Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.

[17]  Mor Harchol-Balter,et al.  Task assignment in a distributed system (extended abstract): improving performance by unbalancing load , 1997, SIGMETRICS '98/PERFORMANCE '98.

[18]  Amihood Amir,et al.  The power of migration in multi-processor scheduling of real-time systems , 1998, SODA '98.

[19]  Yossi Azar,et al.  Minimizing the flow time without migration , 1999, STOC '99.

[20]  Tao Yang,et al.  Hierarchical resource management for Web server clusters with dynamic content , 1999, SIGMETRICS '99.

[21]  Rajmohan Rajaraman,et al.  Online scheduling to minimize average stretch , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[22]  Bala Kalyanasundaram,et al.  Eliminating migration in multi-processor scheduling , 1999, SODA '99.

[23]  Mor Harchol-Balter,et al.  Connection Scheduling in Web Servers , 1999, USENIX Symposium on Internet Technologies and Systems.

[24]  Mor Harchol-Balter,et al.  On Choosing a Task Assignment Policy for a Distributed Server System , 1998, J. Parallel Distributed Comput..

[25]  Luca Becchetti,et al.  Scheduling to minimize average stretch without migration , 2000, SODA '00.