Adaptive work-stealing with parallelism feedback

ACM Transactions on Computer Systems

Volumn 26, Issue 3, 2008, Pages

  Agrawal, Kunal ^a   Leiserson, Charles E ^a   He, Yuxiong ^b   Hsu, Wen Jing ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Adaptive scheduling; Adversary; Instantaneous parallelism; Job scheduling; Multiprocessing; Multiprogramming; Parallel computation; Parallelism feedback; Processor allocation; Randomized algorithm; Space sharing; Span; Thread scheduling; Two level scheduling

Indexed keywords

ADAPTIVE SCHEDULING; ADVERSARY; INSTANTANEOUS PARALLELISM; JOB SCHEDULER; JOB SCHEDULING; MULTI-PROCESSOR SCHEDULING; MULTI-THREADED; MULTIPROCESSING; OPERATING ENVIRONMENT; OPTIMAL TIME; PARALLEL COMPUTATION; PARALLEL SERVERS; PARALLELISM FEEDBACK; PROCESSOR ALLOCATION; RANDOMIZED ALGORITHM; SPACE SHARING; SPAN; THREAD SCHEDULING; TWO-LEVEL SCHEDULING;

MULTIPROCESSING SYSTEMS; MULTIPROGRAMMING; PARALLEL ALGORITHMS; SERVERS; TREES (MATHEMATICS);

SCHEDULING;

EID: 52949109730     PISSN: 07342071     EISSN: 15577333     Source Type: Journal    
DOI: 10.1145/1394441.1394443     Document Type: Article

References (75)

1. ACAR, U. A., BLELLOCH, G. E., AND BLUMOFE, R. D. 2000. The data locality of work stealing. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA). 1-12.
2. AGRAWAL, K., HE, Y., HSU, W. J., AND LEISERSON, C. E. 2006a. Adaptive task scheduling with parallelism feedback. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP).
3. AGRAWAL, K., HE, Y., AND LEISERSON, C. E. 2006b. An empirical evaluation of work stealing with parallelism feedback. In Proceedings of the 2006 IEEE International Conference on Distributed Computing Systems (ICDCS'06).
4. AGRAWAL, K., HE, Y., AND LEISERSON, C. E. 2007. Adaptive work stealing with parallelism feedback. In Proceedings of the IEEE International Parallel & Distributed Processing Symposium (IPDPS '07).
5. ARORA, N. S., BLUMOFE, R. D., AND PLAXTON, C. G. 1998. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA). 119-129.
6. ASPNES, J., HERLIHY, M., AND SHAVIT, N. 1994. Counting networks. J. ACM 41, 5, 1020-1048.
7. BANSAL, N., DHAMDHERE, K., KONEMANN, J., AND SINHA, A. 2004. Non-clairvoyant scheduling for minimizing mean slowdown. Algorithmica 40, 4, 305-318.
8. BLELLOCH, G., GIBBONS, P., AND MATIAS, Y. 1999. Provably efficient scheduling for languages with fine-grained parallelism. J. ACM 46, 2, 281-321.
9. BLELLOCH, G. E., GIBBONS, P. B., AND MATIAS, Y. 1995. Provably efficient scheduling for languages with fine-grained parallelism. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA). 1-12.
10. BLELLOCH, G. E. AND GREINER, J. 1996. A provable time and space efficient implementation of NESL. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP'96). 213-225.
11. BLUMOFE, R. D. 1995. Executing multithreaded programs efficiently. Ph.D. Thesis. Massachusetts Institute of Technology.
12. BLUMOFE, R. D., JOERG, C. F., KUSZMAUL, B. C., LEISERSON, C. E., RANDALL, K. H., AND ZHOU, Y. 1995. Cilk: an efficient multithreaded runtime system. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP). 207-216.
13. BLUMOFE, R. D., JOERG, C. F., KUSZMAUL, B. C., LEISERSON, C. E., RANDALL, K. H., AND ZHOU, Y. 1996. Cilk: an efficient multithreaded runtime system. J. Parallel Distrib. Comput. 37, 1, 55-69.
14. BLUMOFE, R. D. AND LEISERSON, C. E. 1998. Space-efficient scheduling of multithreaded computations. SIAM J. Comput. 27, 1 (Feb.), 202-229.
15. BLUMOFE, R. D. AND LEISERSON, C. E. 1999. Scheduling multithreaded computations by work stealing. J. ACM 46, 5, 720-748.
16. BLUMOFE, R. D., LEISERSON, C. E., AND SONG, B. 1998. Automatic processor allocation for work-stealing jobs. unpublished.
17. BLUMOFE, R. D. AND LISIECKI, P. A. 1997. Adaptive and reliable parallel computing on networks of workstations. In Proceedings of the USENIX 1997 Annual Technical Conference (USENIX'97). pp. 133-147.
18. BLUMOFE, R. D. AND PAPADOPOULOS, D. 1998. The performance of work stealing in multiprogrammed environments. In Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), pp. 266-267.
19. BLUMOFE, R. D. AND PAPADOPOULOS, D. 1999. Hood: a user-level threads library for multiprogrammed multiprocessors. Tech. Rep., University of Texas at Austin.
20. BLUMOFE, R. D. AND PARK, D. S. 1994. Scheduling large-scale parallel computations on networks of workstations. In Proceedings of the IEEE International Symposium on High Performance Distributed Computing (HPDC'94), pp. 96-105.
21. BRENT, R. P. 1974. The parallel evaluation of general arithmetic expressions. J. ACM 21, 2, 201-206.
22. BURTON, F. W. AND SLEEP, M. R. 1981. Executing functional programs on a virtual tree of processors. In Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture (FPCA'81). 187-194.
23. CHASE, D. AND LEV, Y. 2005. Dynamic circular work-stealing deque. In Proceedings of the ACM symposium on Parallelism in Algorithms and Architectures. 21-28.
24. CHIANG, S.-H. AND VERNON, M. K. 1996. Dynamic vs. static quantum-based parallel processor allocation. In Proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). 200-223.
25. CIRNE, W. AND BERMAN, F. 2001. A model for moldable supercomputer jobs. In Proceedings of the IEEE International Parallel & Distributed Processing Symposium (IPDPS'01). IEEE Computer Society, Washington, DC, USA, pp. 50-59.
26. CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. 2001. Introduction to Algorithms (Second ed). The MIT Press and McGraw-Hill.
27. DENG, X. AND DYMOND, P. 1996. On multiprocessor system scheduling. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 82-88.
28. DENG, X., GU, N., BRECHT, T., AND LU, K. 1996. Preemptive scheduling of parallel jobs on multiprocessors. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '96), pp. 159-167. Society for Industrial and Applied Mathematics.
29. DESMOJ. 1999. DESMO-J: a framework for discrete-event modelling and simulation. http: //asi-www.informatik.uni-hamburg.de/desmoj/.
30. DOWNEY, A. B. 1998. A parallel workload model and its implications for processor allocation. Cluster Comput. 1, 1, 133-145.
31. EAGER, D. L., ZAHORJAN, J., AND LOZOWSKA, E. D. 1989. Speedup versus efficiency in parallel systems. IEEE Trans. Comput. 38, 3, 408-423.
32. EDMONDS, J. 1999. Scheduling in the dark. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC'99), pp. 179-188.
33. EDMONDS, J., CHINN, D.D., BRECHT, T., AND DENG, X. 2003. Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics. J. Sched. 6, 3, 231-250.
34. FANG, Z., TANG, P., YEW, P.-C., AND ZHU, C.-Q. 1990. Dynamic processor self-scheduling for general parallel nested loops. IEEE Trans. Comput. 39, 7, 919-929.
35. FEITELSON, D. 2005. Parallel workloads archive. http://www.cs.huji.ac.il/labs/parallel/workload/.
36. FEITELSON, D. G. 1996. Packing schemes for gang scheduling. In Proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), D. G. Feitelson and L. Rudolph, Eds. Vol. 1162, pp. 89-110. Springer.
37. FEITELSON, D. G. 1997. Job scheduling in multiprogrammed parallel systems (extended version). Tech. Rep., IBM Research Report RC 19790 (87657) 2nd Revision.
38. FINKEL, R. AND MANBER, U. 1987. DIB - A distributed implementation of backtracking. Trans. Progr. Lang. 9, 2 (Apr.), 235-256.
39. FRIGO, M., LEISERSON, C. E., AND RANDALL, K. H. 1998. The implementation of the Cilk-5 multithreaded language. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI'98), pp. 212-223.
40. GHOSAL, D., SERAZZI, G., AND TRIPATHI, S. K. 1991. The processor working set and its use in scheduling multiprocessor systems. IEEE Trans. Softw. Eng. 17, 5, 443-453.
41. GRAHAM, R. L. 1969. Bounds on multiprocessing anomalies. SIAM Journ. Appl. Math. 17, 2, 416-429.
42. GU, N. 1995. Competitive analysis of dynamic processor allocation strategies. Masters Thesis. York University.
43. HALBHERR, M., ZHOU, Y., AND JOERG, C. F. 1994. MIMD-style parallel programming with continuation-passing threads. In Proceedings of the International Workshop on Massive Parallelism: Hardware, Software, and Applications.
44. HALSTEAD JR., R. H. 1984. Implementation of Multilisp: Lisp on a multiprocessor. In Proceedings of the 1984 ACM Symposium on LISP and Functional Programming (LFP'84). Austin, Texas, pp. 9-17.
45. HARCHOL-BALTER, M. 1999. The effect of heavy-tailed job size, distributions on computer system design. In Proceedings of the Conference on Applications of Heavy Tailed Distributions in Economics.
46. HARCHOL-BALTER, M. AND DOWNEY, A. B. 1997. Exploiting process lifetime distributions for dynamic load balancing. ACM Trans. Comput. Syst. 15, 3, 253-285.
47. HENDLER, D., LEV, Y., MOIR, M., AND SHAVIT, N. 2006. A dynamic-sized nonblocking work stealing deque. Distrib. Comput. 18, 3, 189-207.
48. HENDLER, D. AND SHAVIT, N. 2002. Non-blocking steal-half work queues. In Proceedings of the Annual Symposium on Principles of Distributed Computing, 280-289.
49. HUMMEL, S. F. AND SCHONBERG, E. 1991. Low-overhead scheduling of nested parallelism. IBM J. Res. Develop. 35, 5-6, 743-765.
50. KARP, R. M. AND ZHANG, Y. 1988. A randomized parallel branch-and-bound procedure. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC'88). 290-300.
51. LELAND, W. AND OTT, T. J. 1986. Load-balancing heuristics and process behavior. In Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS). 54-69.
52. LEUTENEGGER, S. T. AND VERNON, M. K. 1990. The performance of multiprogrammed multiprocessor scheduling policies. In Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS). 226-236.
53. LUBLIN, U. AND FEITELSON, D. G. 2003. The workload on parallel supercomputers: modeling the characteristics of rigid jobs. J. Parallel Distrib. Comput. 63, 11, 1105-1122.
54. MARTORELL, X., CORBALÁN, J., NIKOLOPOULOS, D. S., NAVARRO, N., POLYCHRONOPOULOS, E. D., PAPATHEODOROU, T. S., AND LABARTA, J. 2000. A tool to schedule parallel applications on multiprocessors: the NANOS CPU manager. In Proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), 87-112.
55. MCCANN, C., VASWANI, R., AND ZAHORJAN, J. 1993. A dynamic processor allocation policy for multi-programmed shared-memory multiprocessors. ACM Trans. Comput. Syst. 11, 2, 146-178.
56. MOHR, E., KRANZ, D. A., AND HALSTEAD, JR., R. H. 1990. Lazy task creation: a technique for increasing the granularity of parallel programs. In Proceedings of the 1990 ACM Symposium on LISP and Functional Programming (LFP'90), pp. 185-197.
57. MOTWANI, R., PHILLIPS, S., AND TORNG, E. 1993. Non-clairvoyant scheduling. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'93), pp. 422-431.
58. MOTWANI, R. AND RAGHAVAN, P. 1995. Randomized Algorithms (1st Ed). Cambridge University Press.
59. NARLIKAR, G. J. AND BLELLOCH, G. E. 1999. Space-efficient scheduling of nested parallelism. ACM Trans. Prog. Lang. Syst. 21, 1, 138-173.
60. NGUYEN, T. D., VASWANI, R., AND ZAHORJAN, J. 1996a. Maximizing speedup through self-tuning of processor allocation. In Proceedings of the 10th International Parallel Processing Symposium (IPPS'96), pp. 463-468.
61. NGUYEN, T. D., VASWANI, R., AND ZAHORJAN, J. 1996b. Using runtime measured workload characteristics in parallel processor scheduling. In Proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), pp. 155-174.
62. PARSONS, E. W. AND SEVCIK, K. C. 1995. Multiprocessor scheduling for high-variability service time distributions. In Proceedings of the 9th International Parallel Processing Symposium (IPPS '95). 127-145.
63. ROSTI, E., SMIRNI, E., DOWDY, L. W., SERAZZI, G., AND CARLSON, B. M. 1994. Robust partitioning schemes of multiprocessor systems. Perform. Eval. 19, 2-3, 141-165.
64. ROSTI, E., SMIRNI, E., SERAZZI, G., AND DOWDY, L. W. 1995. Analysis of non-work-conserving processor partitioning policies. In Proceedings of the 9th International Parallel Processing Symposium (IPPS '95), pp. 165-181.
65. RUDOLPH, L., SLIVKIN-ALLALOUF, M., AND UPFAL, E. 1991. A simple load balancing scheme for task allocation in parallel machines. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA). 237-245.
66. SEN, S. 2004. Dynamic processor allocation for adaptively parallel jobs. Masters Thesis. Massachusetts Institute of Technology.
67. SEVCIK, K. C. 1989. Characterizations of parallelism in applications and their use in scheduling. In Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), pp. 171-180.
68. SEVCIK, K. C. 1994. Application scheduling and processor allocation in multiprogrammed parallel processing systems. Perform. Eval. 19, 2-3, 107-140.
69. SONG, B. 1998. Scheduling adaptively parallel jobs. Masters Thesis. Massachusetts Institute of Technology.
70. SQUILLANTE, M. S. 1995. On the benefits and limitations of dynamic partitioning in parallel computer systems. In Proceedings of the 9th International Parallel Processing Symposium (IPPS'95), pp. 219-238.
71. SUPERCOMPUTING TECHNOLOGIES GROUP. 2001. Cilk 5.3.2 Reference Manual. MIT Laboratory for Computer Science.
72. TIMOTHY B. BRECHT, K. G. 1996. Using parallel program characteristics in dynamic processor allocation policies. Perform. Eval. 27-28, 519-539.
73. TUCKER, A. AND GUPTA, A. 1989. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. In Proceedings of the Twelfth ACM Symposium on Operating Systems Principles (SOSP'89). 159-166.
74. YUE, K. K. AND LILJA, D. J. 2001. Implementing a dynamic processor allocation policy for multiprogrammed parallel applications in the Solaris™ operating system. Concurrency Computat. Pract. Exper. 13, 6, 449-464.
75. ZIPF, G. K. 1949. Human Behavior and the Principle of Least Effort. Addison-Wesley.