Efficient scheduling of strict multithreaded computations

Theory of Computing Systems

Volumn 33, Issue 3, 2000, Pages 173-232

  Fatourou, P ^a   Spirakis, P ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORESTRY; PARALLEL PROGRAMMING; SCHEDULING; TREES (MATHEMATICS);

COMMUNICATION COMPLEXITY; DISTRIBUTED MEMORY MACHINES; DISTRIBUTED SCHEDULING ALGORITHMS; EFFICIENT SCHEDULING; EXPECTED EXECUTION TIME; MEMORY REQUIREMENTS; MULTITHREADED COMPUTATION; SYNCHRONIZATION PRIMITIVE;

SCHEDULING ALGORITHMS;

EID: 0034421561     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240010002     Document Type: Article

References (57)

1. N. S. Arora, R. D. Blumofe and C. G. Plaxton, Thread scheduling for multiprogrammed multiprocessors, Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 119-129, Puerto Vallarta, Mexico, June-July 1998.
2. Arvind, R. S. Nikhil and K. K. Pingali, I-structures: data structures for parallel computing, ACM Transactions on Programming Languages and Systems, 11(4):598-632, October 1989.
3. B. Bershad, E. Lazowska, and H. Levy, Presto: a system for object-oriented parallel programming, Software - Practice and Experience, 18(8):713-732, August 1988.
4. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, New Jersey, 1989.
5. G. E. Blelloch, S. Chattejee, J. C. Hardwick, J. Sipelstein and M. Zagha, Implementation of a portable nested data-parallel language, Journal of Parallel and Distributed Computing, 21(1):4-14, April 1994.
6. G. E. Blelloch, P. B. Gibbons and Y. Matias, Provably efficient scheduling for languages with fine-grained parallelism, Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 1-12, Santa Barbara, California, July 1995.
7. G. E. Blelloch, P. B. Gibbons, Y. Matias and G. J. Narlikar, Space-efficient scheduling of parallelism with synchronization variables, Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 12-23, Newport, Rhode Island, June 1997.
8. R. D. Blumofe, Executing Multithreaded Programs Efficiently, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, September 1995.
9. R. D. Blumofe, M. Frigo, C. F. Joerg, C. E. Leiserson and K. H. Randall, An analysis of dag-consistent distributed shared-memory algorithms, Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 297-308, Padua, Italy, June 1996.
10. R. D. Blumofe, M. Frigo, C. F. Joerg, C. E. Leiserson and K. H. Randall, Dag-consistent distributed shared memory, Proceedings of the 10th International Parallel Processing Symposium, pp. 132-141, Honolulu, Hawaii, April 1996.
11. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall and Y. Zhou, Cilk: an efficient multithreaded runtime system, Journal of Parallel and Distributed Computing, 37(1):55-69, August 1996.
12. R. D. Blumofe and C. E. Leiserson, Scheduling multithreaded computations by work stealing, Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 356-368, Santa Fe, New Mexico, November 1994 (full version to appear in JACM).
13. R. D. Blumofe and C. E. Leiserson, Space-efficient scheduling of multithreaded computation, SIAM Journal on Computing, 27(1):202-229, February 1998.
14. F. W. Burton, Storage management in virtual tree machines, IEEE Transactions on Computers, 37(3):321-328, March 1988.
15. F. W. Burton, Guaranteeing good memory bounds for parallel programs, IEEE Transactions on Software Engineering, 22(10):762-773, October 1996.
16. F. W. Burton and M. R. Sleep, Executing functional programs on a virtual tree of processors, Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pp. 187-194, Portsmouth, New Hampshire, October 1981.
17. M. C. Carlisle, A. Rogers, J. H. Reppy and L. J. Handren, Early experiences with Olden, Proceedings of the 6th Annual Workshop on Languages and Compilers for Parallel Computing, Portland, Oregon, August 1993.
18. N. Carriero and D. Gelernter, Linda in context, Communications of the ACM, 32(4):444-458, 1989.
19. R. Chandra, A. Gupta and J. L. Hennessy, COOL: an object-based language for parallel programming, IEEE Computer, 27(8):13-26, August 1994.
20. K. Chandy and C. Kesselman, Compositional c++: compositional parallel programming, Proceedings of the International Workshop on Languages and Compilers for Parallel Computing, pp. 124-144, New Haven, Connecticut, August 1992.
21. D. E. Culler and Arvind, Resource requirements of dataflow programs, Proceedings of the 15th Annual International Symposium on Computer Architecture, pp. 141-150, Honolulu, Hawai, May-June 1988.
22. D. Culler, R. Karp and D. Patterson, LogP: towards a realistic model of parallel computation, Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 1-12, San Diego, California, May 1993.
23. T. Decker, Virtual data space - a universal load balancing scheme, Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, pp. 159-166, Paderborn, Germany, 1997.
24. W. Feller, An Introduction to Probability Theory and its Application, Vol. 1, Second Edition, Wiley, New York, 1957.
25. J. Feo, D. Cann and R. Oldehoeft, A report on the Sisal Language Project, Journal of Parallel and Distributed Computing, 10(4):349-366, December 1990.
26. B. Freisleben and T. Kielman, Approaches to Support Parallel Programming on Workstation Clusters: A Survey, Informatik-Bericht T.R. Nr. 95-01, Department of Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany, 1995.
27. M. Frigo, C. E. Leiserson and K. H. Randal, The implementation of the Cilk-5 multithreaded language, Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 212-223, Montreal, Canada, June 1998.
28. A. Gottlieb, B. Lubachevsky and L. Rudolph, Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors, ACM Transaction on Programming Languages and Systems, 5(2):164-189, April 1983.
29. J. Greiner and G. Blelloch, A provably time-efficient parallel implementation of full speculation, Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 309-321, St. Petersburg Beach, Florida, January 1996.
30. R. H. Halstead, Multilisp: a language for concurrent symbolic computation, ACM Transactions on Programming Languages and Systems, 7(4):501-538, October 1985.
31. High Performance Fortran Forum, High Performance Fortran Language Specification version 1.0, 1993.
32. IEEE, Information Technology - Portable Operating System Interface (POSIX) - Part I: System Application: Program Interface (API), IEEE/ANSI Std 1003.1, 1996.
33. J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, Massachusetts, November 1992.
34. R. M. Karp and Y. Zhang, Randomized parallel algorithms for backtrack search and branch-and-bound computation, Journal of the ACM, 40(3):765-789, July 1993.
35. D. Kranz, R. Halstead and E. Mohr, Mul-T: a high-performance parallel lisp, Proceedings of the Conference on Programming Language Design and Implementation, pp. 81-90, Portland, Oregon, June 1989.
36. T. G. Lewis and H. El-Rewini, Introduction to Parallel Computing, Prentice-Hall, Englewood Cliffs, New Jersey, 1992.
37. P. Liu, W. Aielo and S. Bhatt, An atomic model for message passing, Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 154-163, Velen, Germany, June 1993.
38. J. Matoušek and J. Nešetřil, Invitation to Discrete Mathematics, Oxford University Press, New York, 1998.
39. J. M. Miller, MultiScheme: A Parallel Processing System Based on MIT Scheme, Ph.D. Thesis, Massachusetts Institute of Technology, September 1987.
40. P. Mills, L. Nyland, J. Prins, J. Reif and R. Wagner, Prototyping Parallel and Distributed Programs in Proteus, UNC-CH TR90-041, Computer Science Department, University of North Carolina, 1990.
41. G. Narlikar, Scheduling threads for low space requirement and good locality, Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 83-95, Saint-Malo, France, June 1999.
42. G. Narlikar, Space-Efficient Scheduling for Parallel, Multithreaded Computations, Ph.D. Thesis, CMU-CS-99-119, School of Computer Science, Carniege Mellon University, Pittsburgh, May 1999.
43. G. Narlikar and G. Blelloch, Space-efficient implementation of nested parallelism, Proceedings of the 6th ACM SIGPLAN-SIGACT Symposium on Principles and Practice of Parallel Programming, pp. 25-36, Las Vegas, Nevada, June 1997.
44. G. Narlikar and G. Blelloch, Pthreads for dynamic and irregular parallelism, T.R. CMU-CS-98-114, School of Computer Science, Carnegie Mellon University, Pittsburgh, April 1998 (available from URL: http://www.cs.cmu.edu/afs/cs.cmu.edu/user/girija/www/publications.html).
45. R. S. Nikhil, Cid: a parallel, shared-memory C for distributed-memory machines, Proceedings of the 7th Annual Workshop on Languages and Compilers for Parallel Computing, pp. 376-390, Ithaca, New York, August 1994.
46. S. Oaks and H. Wong, JAVA Threads, First Edition, O'Reilly, Sebastopol, California, January 1997.
47. S. L. Peyton Jones, Parallel implementations of functional programming languages, Computer Journal, 32(2):175-186, 1989.
48. A. Ranade, How to emulate shared memory, Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pp. 185-194, Los Angeles, California, October 1987.
49. M. Rinard, D. Scales and M. Lam, Jade: a high-level, machine-independent language for parallel programming, IEEE Computer, 26(6):28-38, June 1993.
50. L. Rudolph, M. Slivkin-Allalouf and E. Upfal, A simple load balancing scheme for task allocation in parallel machines, Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 237-245, Hilton Head, California, July 1991.
51. V. A. Saletore, J. Jacob and M. Padala, Parallel computations on the CHARM heterogeneous workstation cluster, Proceedings of the 3rd International Symposium on High Performance Distributed Computing, pp. 203-210, San Francisco, California, August 1994.
52. P. Sanders, Lastverteilungsalgorithmen für parallele Tiefensuche, Ph.D. Thesis, University of Karlsruhe, 1997.
53. D. Stein and D. Shah, Implementing lightweight threads, Proceedings of the Summer USENIX Technical Conference and Exhibition, pp. 1-10, San Antonio, Texas, 1992.
54. S. A. Williams, Programming Models for Parallel Systems, Wiley, London, England, 1990.
55. I. C. Wu and H. T. Kung, Communication complexity for parallel divide-and-conquer, Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science), pp. 151-162, San Juan, Puerto Rico, October 1991.
56. Y. Zhang, Parallel Algorithms for Combinatorial Search Problems, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, University of California, Berkeley, Technical Report UCB/CSD 89/543, November 1989.
57. Y. Zhang and A. Ortynski, The efficiency of randomized parallel backtrack search, Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, pp. 522-529, Dallas, Texas, October 1994.