Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation. (English) Zbl 1192.68096
Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), Chicago, IL, USA, June 13 - 15, 2004. New York, NY: ACM Press (ISBN 1-58113-852-0). 363-372, electronic only (2004).
MSC:
| 68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |
| 68W40 | Analysis of algorithms |
References:
| [1] | N. Alon, Y. Azar, G. Woeginger and T. Yadid. Approximation schemes for scheduling. Proc. of SODA, 1997.]] · Zbl 1321.90051 |
| [2] | A. Avidor, Y. Azar and J. Sgall. Ancient and new algorithms for load balancing in the lp norm. Algorithmica, 29(3):422-441, 2001.]] · Zbl 0969.68012 |
| [3] | B. Awerbuch, Y. Azar, E. Grove, M. Kao, P. Krishnan and J. Vitter. Load balancing in the lp norm. Proc. of FOCS, 1995.]] |
| [4] | N. Avrahami and Y. Azar. Minimizing total flow time and total completion time with immediate dispatching. Proc. of 15th SPAA, 2003.]] 10.1145/777412.777415 |
| [5] | B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing flow time without migration. Proc. of STOC, 1999.]] 10.1145/301250.301304 |
| [6] | N. Bansal and M. Harchol-Balter. Analysis of SRPT scheduling : Investigating unfairness. Proc. of ACM Sigmetrics, 2001.]] 10.1145/378420.378792 |
| [7] | N. Bansal and K. Pruhs. Server scheduling in the Lp norm : a rising tide lifts all boats. Proc. of STOC, 2003.]] 10.1145/780542.780580 |
| [8] | N. Bansal and K. Dhamdhere. Minimizing Weighted Flowtime. Proc. of SODA, 2003.]] |
| [9] | L. Becchetti and S. Leonardi. Non-clairvoyant scheduling to minimize average flowtime on single and parallel machines. Proc. of STOC, 2001.]] 10.1145/380752.380782 |
| [10] | L. Becchetti, S. Leonardi, and S. Muthukrishnan. Scheduling to minimize Average Stretch without Migration. Proc. of SODA, 2001.]] |
| [11] | L. Becchetti, S. Leonardi, A. M. Spaccamela, K. Pruhs. Online weighted flow time and deadline scheduling. Proc. of RANDOM-APPROX, 2001.]] |
| [12] | M. A. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and Stretch Metrics for Scheduling Continuous Job Streams. Proc. of SODA, 1998.]] |
| [13] | C. Chekuri, S. Khanna. Approximation schemes for preemptive weighted flow time. Proc. of STOC, 2002.]] 10.1145/509907.509954 |
| [14] | C. Chekuri, S. Khanna, and A. Zhu. Algorithms for Minimizing Weighted Flow Time. Proc. of STOC, 2001.]] 10.1145/380752.380778 |
| [15] | M. Crovella, R. Frangioso and M. Harchol-Balter. Connection scheduling in web servers. USENIX Symposium on Internet Technologies and Systems, 1999.]] |
| [16] | L. Epstein and J. Sgall. Approximation schemes for scheduling on uniformly related and indentical parallel machines. Proc. of ESA, 1999.]] |
| [17] | B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. JACM, 47(4):617-43, 2000.]] 10.1145/347476.347479 · Zbl 1094.68529 |
| [18] | S. Leonardi and D. Raz. Approximating total flow time on parallel machines. Proc. STOC, 1997.]] 10.1145/258533.258562 |
| [19] | R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant Scheduling. Theoretical Computer Science, 130(1):17-47, 1994.]] 10.1016/0304-3975(94)90151-1 · Zbl 0820.90056 |
| [20] | S. Muthukrishnan, R. Rajaraman, R. Shaheen, J. Gerkhe. Online scheduling to minimize average stretch. Proc. of FOCS, 1999.]] |
| [21] | C. Phillips, C. Stein, E. Torng, and J. Wein. Optimal Time Critical Scheduling Via Resource Augmentation. Proc. of STOC, 1997.]] 10.1145/258533.258570 |
| [22] | B. Schroeder and M. Harchol-Balter. Web servers under overload : how scheduling can help. Proc. of 18th International Teletraffic Congress, 2003.]] |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
