Space-efficient scheduling of nested parallelism

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 1, 1999, Pages 138-173

  Narlikar, Girija J ^a   Blelloch, Guy E ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Algorithms; D.1.3 Programming Techniques : Concurrent Programming Parallel programming; D.3.4 Programming Languages : Processors Runtime environments; F.2.0 Nonnumerical Algorithms and Problems : Analysis Of Algorithms and Problem Complexity

Indexed keywords

DYNAMIC SCHEDULING; MULTITHREADING; NESTED PARALLELISM;

ALGORITHMS; SCHEDULING; THEOREM PROVING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0040362680     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/314602.314607     Document Type: Article

References (45)

1. ARVIND, NIKHIL, R. S., AND PINGALI, K. 1989. I-structures: Data structures for parallel computing. ACM Trans. on Programm. Lang. Syst. 11, 4 (Oct.), 598-632.
2. BERSHAD, B. N., LAZOWSKA, E., AND LEVY, H. 1988. PRESTO : A system for object-oriented parallel programming. Soft. Pract. and Exper. 18, 8 (Aug.), 713-732.
3. BLELLOCH, G. E., CHATTERJEE, S., HARDWICK, J. C., SIPELSTEIN, J., AND ZAGHA, M. 1994. Implementation of a portable nested data-parallel language. Journal of Parallel and Distributed Computing 21, 1 (April), 4-14.
4. BLELLOCH, G. E., GIBBONS, P. B., AND MATIAS, Y. 1995. Provably efficient scheduling for languages with fine-grained parallelism. In Proc. Symposium on Parallel Algorithms and Architectures, Santa Barbara, pp. 420-430.
5. BLUMOFE, R. D., FRIGO, M., JOERG, C. F., LEISERSON, C. E., AND RANDALL, K. H. 1996. An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms. In Proc. Symp. on Parallel Algorithms and Architectures, pp. 297-308.
6. 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 Proc. Symposium on Principles and Practice of Parallel Programming, pp. 207-216.
7. BLUMOFE, R. D. AND LEISERSON, C. E. 1993. Space-efficient scheduling of multithreaded computations. In Proc. 25th ACM Symp. on Theory of Computing, pp. 362-371.
8. BLUMOFE, R. D. AND LEISERSON, C. E. 1994. Scheduling multithreaded computations by work stealing. In Proc. 35th IEEE Symp. on Foundations of Computer Science, pp. 356-368.
9. BURTON, F. W. 1988. Storage management in virtual tree machines. IEEE Trans. on Computers 37, 3, 321-328.
10. BURTON, F. W. AND SIMPSON, D. J. 1994. Space efficient execution of deterministic parallel programs. Manuscript.
11. BURTON, F. W. AND SLEEP, M. R. 1981. Executing functional programs on a virtual tree of processors. In Conference on Functional Programming Languages and Computer Architecture.
12. CHANDRA, R., GUPTA, A., AND HENNESSY, J. 1994. COOL: An object-based language for parallel programming. IEEE Computer 27, 8 (Aug.), 13-26.
13. CHANDY, K. M. AND KESSELMAN, C. 1992. Compositional c++: compositional parallel programming. In Proc. 5th. Intl. Wkshp. on Languages and Compilers for Parallel Computing, New Haven, CT, pp. 124-144.
14. CHASE, J. S., AMADOR, F. G., AND LAZOWSKA, E. D. 1989. The amber system: Parallel programming on a network of multiprocessors. In Proc. Symposium on Operating Systems Principles.
15. CHOW, J. H. AND W. L. HARRISON 1990. Switch-stacks: A scheme for microtasking nested parallel loops. In Proc. Supercomputing, New York, NY.
16. COOK, S. A. 1985. A taxonomy of problems with fast parallel algorithms. Information and Control 64, 2-22.
17. CULLER, D. E. AND ARVIND 1988. Resource requirements of dataflow programs. In Proc. Intl. Symposium on Computer Architecture.
18. FEO, J. T., CANN, D. C., AND OLDEHOEFT, R. R. 1990. A report on the Sisal language project. Journal of Parallel and Distributed Computing 10, 4 (Dec.), 349-366.
19. FREEH, V. W., LOWENTHAL, D. K., AND ANDREWS, G. R. 1994. Distributed filaments: efficient fine-grain parallelism on a cluster of workstations. In 1st Symposium on Operating Systems Design and Implementation, Monterey, CA, pp. 201-212.
20. GOLDSTEIN, S. C., CULLER, D. E., AND SCHAUSER, K. E. 1995. Enabling primitives for compiling parallel languages. In 3rd Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, Rochester, NY.
21. GREENGARD, L. 1987. The rapid evaluation of potential fields in particle systems. The MIT Press.
22. HALBHERR, M., ZHOU, Y., AND JOERG, C. F. 1994. Parallel programming based on continuation-passing thread. In Proc. 2nd International Workshop on Massive Parallelism: Hardware, Software and Applications, Capri, Italy.
23. HALSTEAD, R. H. 1985. Multilisp: A language for concurrent symbolic computation. ACM Trans. on Programming Languages and Systems 7, 4, 501-538.
24. HPF FORUM 1993. High Performance Fortran language specification, Version 1.0.
25. HSEIH, W. E., WANG, P., AND WEIHL, W. E. 1993. Computation migration: enhancing locality for distributed memory parallel systems. In Proc. Symposium on Principles and Practice of Parallel Programming, San Francisco, California.
26. HUMMEL, S. F. AND SCHONBERG, E. 1991. Low-overhead scheduling of nested parallelsim. IBM Journal of Research and Development 35, 5-6, 743-65.
27. HUMMEL, S. F., SCHONBERG, E., AND FLYNN, L. E. 1992. Factoring: a method for scheduling parallel loops. Commun. ACM 35, 8 (Aug.), 90-101.
28. IEEE 1985. Threads extension for portable operating systems (draft 6).
29. KUCK, C. D. P. D. 1987. Guided self-scheduling: a practical scheduling scheme for parallel supercomputers. IEEE Trans. on Computers C-36, 12 (Dec.), 1425-39.
30. MELLOR-CRUMMEY, J. M. 1987. Concurrent queues: Practical Fetch-and-Φ algorithms. Technical Report 229 (Nov.), University of Rochester.
31. MILLS, P. H., NYLAND, L. S., PRINS, J. F., REIF, J. H., AND WAGNER, R. A. 1990. Prototyping parallel and distributed programs in Proteus. Technical Report UNC-CH TR90-041, Computer Science Department, University of North Carolina.
32. MOHR, E., KRANZ, D., AND HALSTEAD, R. 1991. Lazy task creation: A technique for increasing the granularity of parallel programs. IEEE Trans. on Parallel and Distributed Systems 2, 3 (July), 264-280.
33. MUELLER, F. 1993. A library implementation of POSIX threads under unix. In Proc. Winter 1993 USENIX Technical Conference and Exhibition, San Diego, CA, USA, pp. 29-41.
34. NARLIKAR, G. J. 1999. Space-efficient multithreading. School of Computer Science, Carnegie Mellon University. Ph.D. thesis, to appear.
35. NARLIKAR, G. J. AND BLELLOCH, G. E. 1996. A framework for space and time efficient scheduling of parallelism. Technical Report CMU-CS-96-197, Computer Science Department, Carnegie Mellon University.
36. NARLIKAR, G. J. AND BLELLOCH, G. E. 1998. Pthreads for dynamic and irregular parallelism. In Proc. SC98: High Performance Networking and Computing, Orlando, FL. IEEE.
37. NIKHIL, R. S. 1994. Cid: A parallel, shared-memory c for distributed memory machines. In Proc. 7th. Ann. Wkshp. on Languages and Compilers for Parallel Computing, pp. 376-390.
38. POWELL, M. L., KLEIMAN, S. R., BARTON, S., SHAH, D., STEIN, D., AND WEEKS, M. 1991. SunOS multi-thread architecture. In USENIX ASSOCIATION (Ed.), Proc. Winter 1991 USENIX Conference: Dallas, TX, USA, pp. 65-80.
39. QUINLAN, J. R. 1986. Induction of decision trees. Machine learning 1, 1, 81-106.
40. RINARD, M. C., SCALES, D. J., AND LAM, M. S. 1993. Jade: A high-level, machine-independent language for parallel programming. IEEE Computer 26, 6 (June), 28-38.
41. ROGERS, A., CARLISLE, M., REPPY, J., AND HENDREN, L. 1995. Supporting dynamic data structures on distributed memory machines. ACM Trans. on Programm. Lang. Syst. 17, 2 (March), 233-263.
42. RUGGUERO, C. A. AND SARGEANT, J. 1987. Control of parallelism in the manchester dataflow machine. In Functional Programming Languages and Computer Architecture, Volume 174 of Lecture Notes in Computer Science, pp. 1-15. Springer-Verlag.
43. STRASSEN, V. 1969. Gaussian elimination is not optimal. Numerische Mathematik 13, 354-356.
44. TZEN, T. H. AND NI, L. M. 1993. Trapezoid self-scheduling: a practical scheduling scheme for parallel compilers. IEEE Trans. on Parallel and Distributed Systems 4, 1 (Jan.), 87-98.
45. VANDEVOORDE, M. T. AND ROBERTS, E. S. 1988. WorkCrews: an abstraction for controlling parallelism. International Journal of Parallel Programming 17, 4 (Aug.), 347-366.