Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines

Journal of the ACM

Volumn 51, Issue 4, 2004, Pages 517-539

  Becchetti, Luca ^a   Leonardi, Stefano ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Flow time; Multilevel feedback; Probabilistic analysis; Randomized algorithms

Indexed keywords

ALGORITHMS; CONCURRENT ENGINEERING; DATA PROCESSING; MULTITASKING; PARALLEL PROCESSING SYSTEMS; PROBABILISTIC LOGICS;

FLOW TIME; MULTILEVEL FEEDBACK; PROBABILISTIC ANALYSIS; RANDOMIZED ALGORITHMS;

COMPUTER OPERATING SYSTEMS;

EID: 4243063948     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/1008731.1008732     Document Type: Article

References (21)

1. ACHARYA, S., MUTHUKRISHNAN, S., AND SUNDARAM, G. 1999. Scheduling data delivery over multiple channels. Tech. rep., Bell Labs Technical Memo. (Available from acharya@research. bell-labs. com.)
2. AWERBUCH, B., AZAR, Y., LEONARDI, S., AND REGEV, O. 2002. Minimizing the flow time without migration. SIAM J. Comput. 31, 5, 1370-1382.
3. BAKER, K. R. 1974. Introduction to Sequencing and Scheduling. Wiley, New York.
4. BANSAL, N., DHAMDHERE, K., KONEMANN, J., AND SINHA, A. 2003. Non-clairvoyant scheduling for mean slowdown. In Proceedings of the 20th Symposium on Theoretical Aspects of Computer Science (STACS). 260-270.
5. p norm: A rising tide lifts all boats. In Proceedings of the 35th Symposium on Theory of Computing (STOC). ACM, New York, 242-250.
6. BECCHETTI, L., LEONARDI, S., AND MUTHUKRISHNAN, S. 2004. Scheduling to minimize average stretch without migration. J. Comput. Syst. Sci. 68, 80-95.
7. BEN-DAVID, S., BORODIN, A., KARP, R., TARDOS, G., AND WIGDERSON, A. 1994. On the power of randomization in on-line algorithms. Algorithmica 11, 2-14.
8. BENDER, M., MUTHUKRISHNAN, S., AND RAJARAMAN, R. 2002. Improved algorithms for stretch scheduling. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 762-771.
9. BENDER, M. A., CHAKRABARTI, S., AND MUTHUKRISHNAN, S. 1998. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 270-279.
10. DOEPPNER, T. W. 1987. Threads, a system for the support of concurrent programming. Tech. Rep. CS-87-11, Brown University.
11. GEHRKE, J. E., MUTHUKRISHNAN, S., RAJARAMAN, R., AND SHAHEEN, A. 1999. Online scheduling to minimize avarage strech. In Proceedings of the 40th Annual IEEE Symposium Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, Calif., 433-443.
12. IEEE. 1994. Institute for Electrical and Electronic Engineers. POSIX P1003.4a, Threads Extensions for Portable Operating Systems.
13. KALYANASUNDARAM, B., AND PRUHS, K. 1995. Speed is as powerful as clairvoyance. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). IEEE Computer Society Press, Los Alamitos, Calif., 214-223.
14. KALYANASUNDARAM, B., AND PRUHS, K. 1997. Minimizing flow time nonclairvoyantly. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (Miami Beach, Fla., Oct. 20-22). IEEE Computer Society Press, Los Alamitos Calif., 345-352.
15. LEONARDI, S., AND RAZ, D. 1997, Approximating total flow time on parallel machines. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing. ACM, New York, 110-119.
16. MOTWANI, R., PHILLIPS, S., AND TORNG, E. 1994. Nonclairvoyant scheduling. Theoret. Comput. Sci. 130, 1, 17-47.
17. MUELLER, F. 1993. A library implementation of POSIX threads under UNIX. In Proceedings of the USENIX Winter 1993 Technical Conference. 29-42.
18. NUTT, G. 1999. Operating System Projects using Windows NT. Addison-Wesley, Reading, Mass.
19. SLEATOR, D.D., AND TARJAN, R. E. 1985, Amortized efficiency of list update and paging rules. Commun. ACM 28, 202-208.
20. SUN. 1993. Sunos 5.3 system services.
21. TANENBAUM, A. S. 1992. Modern Operating Systems. Prentice-Hall, Englewood Cliffs, N.J.