Scheduling threads for low space requirement and good locality

Theory of Computing Systems

Volumn 35, Issue 2, 2002, Pages 151-187

  Narlikar, G J ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

PARALLEL PROGRAMS;

COMPUTATION THEORY;

EID: 0036489340     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-001-1030-6     Document Type: Conference Paper

References (56)

1. A. Aggarwal, B. Alpern, A. Chandra, and M. Snir. A model for hierarchical memory. In Proc. 19th Annual ACM Symp. Theory of Computing, pages 305-314, New York City, May 1987.
2. T. E. Anderson, E. D. Lazowska, and H. M. Levy. The performance implications of thread management alternatives for shared-memory multiprocessors. Perform. Eval. Rev., 17:49-60, May 1989.
3. N. S. Arora, R. D. Blumofe, and C. G. Plaxton. Thread scheduling for multiprogrammed multiprocessors. In Proc. ACM Symp. Parallel Algorithms and Architectures, pages 119-129, 1998.
4. H. Bao, J. Bielak, O. Ghattas, L. F. Kallivokas, D. R. O'Hallaron, J. R. Shewchuk, and Jifeng Xu. Large-scale simulation of elastic wave propagation in heterogeneous media on parallel computers. Comput. Methods Appl. Mech. Eng., 152(1-2):85-102, January 1998.
5. H. Bao, J. Bielak, O. Ghattas, D. R. O'Hallaron, L. R. Kallivokas, J. R. Shewchuk, and J. Xu. Earthquake ground motion modeling on parallel computers. In Proc. Supercomputing '96, November 1996.
6. J. E. Barnes and P. Hut. A hierarchical O (N log N) force calculation algorithm. Nature, 324(4):446-449, December 1986.
7. F. Bellosa and M. Steckermeier. The performance implications of locality information usage in shared-memory multiprocessors. J. Parallel Distrib. Comput., 37(1):113-121, August 1996.
8. G. E. Blelloch, S. Chatterjee, J. C. Hardwick, J. Sipelstein, and M. Zagha. Implementation of a portable nested data-parallel language. J. Parallel Distrib. Comput., 21(1):4-14, April 1994.
9. G. E. Blelloch, P. B. Gibbons, and Y. Matias. Provably efficient scheduling for languages with fine-grained parallelism. In Proc. ACM Symp. Parallel Algorithms and Architectures, pages 1-12, Santa Barbara, CA, July 17-19, 1995.
10. G. Blelloch, P. Gibbons, Y. Matias, and G. Narlikar. Space-efficient scheduling of parallelism with synchronization variables. In Proc. ACM Symp. Parallel Algorithms and Architectures, pages 12-23, 1997.
11. R. D. Blumofe, M. Frigo, C. F. Joerg, C. E. Leiserson, and K. H. Randall. An analysis of dag-consistent distributed shared-memory algorithms. In Proc. ACM Symp. Parallel Algorithms and Architectures, pages 297-308, June 1996.
12. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: an efficient multithreaded runtime system. J. Parallel Distrib. Comput., 37(1):55-69, August 1996.
13. R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. In Proc. Symp. Foundations of Computer Science, pages 356-368, 1994.
14. R. P. Brent. The parallel evaluation of general arithmetic expressions. J. Assoc. Comput. Mach., 21(2):201-206, April 1974.
15. F. W. Burton and M. R. Sleep. Executing functional programs on a virtual tree of processors. In Proc. ACM Conf. Functional Programming Languages and Computer Architecture, pages 187-194, 1981.
16. R. Chandra, A. Gupta, and J. L. Hennessy. Data locality and load balancing in COOL. In Proc. ACM Symp. Principles and Practice of Parallel Programming, pages 239-259, 1993.
17. K. M. Chandy and C. Kesselman. Compositional c++: compositional parallel programming. In Proc. Internat. Workshop Languages and Compilers for Parallel Computing, pages 124-144, New Haven, CT, August 1992.
18. S. A. Cook. A taxonomy of problems with fast parallel algorithms. Inform, and Control, 64:2-22, 1985.
19. J. W. Cooley and J. W. Tukey. An algorithm for the machine computation of complex fourier series. Math. of Comp., 19:297-301, April 1965.
20. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms, 6th edition. The MIT Press, Cambridge, MA, and McGraw-Hill, New York, 1992.
21. D. E. Culler and G. Arvind. Resource requirements of dataflow programs. In Proc. Internal. Symp. Computer Architecture, pages 141-151, 1988.
22. D. R. Engler, G. R. Andrews, and D. K. Lowenthal. Filaments: efficient support for fine-grain parallelism. Technical Report 93-13, Dept. of Computer Science, University of Arizona, 1993.
23. R. Feldmann, P. Mysliwietz, and B. Monien. Studying overheads in massively parallel min/max-tree evaluation (extended abstract). In Proc. ACM Symp. Parallel Algorithms and Architectures, pages 94-103, 1994.
24. M. Frigo and S. G. Johnson. The fastest fourier transform in the west. Technical Report MIT-LCS-TR-728, Massachusetts Institute of Technology, September 1997.
25. M. Frigo, C. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. IEEE Symp. Foundations of Computer Science (FOCS), pages 285-298, 1999.
26. M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the Cilk-5 multithreaded language. In Proc. ACM Conf. Programming Language Design and Implementation, pages 212-223, 1998.
27. S. C. Goldstein, K. E. Schauser, and D. E. Culler. Enabling primitives for compiling parallel languages. In Proc. Workshop Languages, Compilers, and Run-Time Systems for Scalable Computers, May 1995.
28. L. Greengard. The Rapid Evaluation of Potential Fields in Particle Systems. The MIT Press, Cambridge, MA, 1987.
29. R. H. Halstead, Jr. Multilisp: a language for concurrent symbolic computation. ACM Trans. Program. Languages Systems, 7(4):501-538, 1985.
30. High Performance Fortran Forum. High performance fortran language specification version 1.0, 1993.
31. IEEE. Information Technology-Portable Operating System Interface (POSIX) - Part 1: System Application: Program Interface (API) [C Language]. IEEE/ANSI Std 1003.1. 1996 edition.
32. V. Karamcheti, J. Plevyak, and A. A. Chien. Runtime mechanisms for efficient dynamic multithreading. J. Parallel Distrib. Comput., 37(1):21-40, August 1996.
33. R. Karp and Y. Zhang. A randomized parallel branch-and-bound procedure. In Proc. Symp. Theory of Computing, pages 290-300, 1988.
34. D. A. Kranz, R. H. Halstead, Jr., and E. Mohr. Mul-T: a high-performance parallel Lisp. In Proc. ACM Conf. Programming Language Design and Implementation, pages 81-90, Portland, OR, June 21-23, 1989.
35. E. P. Markatos and T. J. LeBlanc. Locality-based scheduling in shared-memory multiprocessors. Technical Report 94, ICS-FORTH, Heraklio, Crete, 1993.
36. E. Markatos and T. LeBlanc. Locality-based scheduling in shared-memory multiprocessors. Technical Report TR93-0094, ICS-FORTH, Heraklio, Crete, 1993.
37. P. H. Mills, L. S. Nyland, J. F. Prins, J. H. Reif, and R. A. Wagner. Prototyping parallel and distributed programs in Proteus. Technical Report UNC-CH TR90-041, Computer Science Department, University of North Carolina, 1990.
38. T. Miyazaki, C. Sakamoto, M. Kuwayama, L. Saisho, and A. Fukuda. Parallel pthread library (PPL): user-level thread library with parallelism and portability. In Proc. Internat. Computer Software and Applications Conf. (COMPSAC), pages 301-306, November 1994.
39. E. Mohr, D. Kranz, and R. Halstead. Lazy task creation: a technique for increasing the granularity of parallel programs. IEEE Trans. Parallel Distrib. Systems, 2(3):264-280, July 1991.
40. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, June 1995.
41. G. J. Narlikar. Space-efficient scheduling for parallel, multithreaded computations. Ph.D. thesis, Carnegie Mellon University, 1999. Available as CMU-CS-99-119.
42. G. J. Narlikar and G. E. Blelloch. Space-efficient implementation of nested parallelism. In Proc. ACM SICPLAN Symp. Principles and Practice of Parallel Programming, pages 25-36, June 1997.
43. G. J. Narlikar and G. E. Blelloch. Pthreads for dynamic and irregular parallelism. In Proc. Supercomputing '98, November 1998.
44. G. J. Narlikar and G. E. Blelloch. Pthreads for dynamic parallelism. Technical Report CMU-CS-98-114, Computer Science Dept., Carnegie Mellon University, April 1998.
45. D. O'Hallaron. Spark98: sparse matrix kernels for shared memory and message passing systems. Technical Report CMU-CS-97-178, School of Computer Science, Carnegie Mellon University, 1997.
46. J. E. Philbin, O. J. Anshus, and C. C. Douglas. Thread scheduling for cache locality. In Internat. Conf. Architectural Support for Programming Languages and Operating Systems, pages 60-71, 1996.
47. M. L. Powell, S. R. Kleiman, S. Barton, D. Shah, D. Stein, and M. Weeks. SunOS multi-thread architecture. In Proc. Winter 1991 USENIX Technical Conf. Exhibition, pages 65-80, Dallas, TX, January 1991.
48. J. R. Quinlan. Induction of decision trees. Machine Learning, 1(1):81-106, 1986.
49. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA, 1993.
50. C. A. Ruggiero and J. Sargeant. Control of parallelism in the Manchester dataflow machine. In G. Kahn, editor, Functional Programming Languages and Computer Architecture, pages 1-16. Springer-Verlag, Berlin, 1987.
51. D. J. Simpson and F. W. Burton. Space efficient execution of deterministic parallel programs. IEEE Trans. Software Eng., 25(6):870-882, May/June 1999.
52. J. P. Singh, A. Gupta, and M. Levoy. Parallel visualization algorithms: performance and architectural implications. IEEE Computer, 27(7):45-55, July 1994.
53. D. Stein and D. Shah. Implementing lightweight threads. In Proc. Summer 1992 USENIX Technical Conf. Exhibition, pages 1-10, San Antonio, TX, 1992.
54. M. T. Vandevoorde and E. S. Roberts. WorkCrews: an abstraction for controlling parallelism. Internat. J. Parallel Progr., 17(4):347-366, August 1988.
55. B. Weissman. Performance counters and state sharing annotations: a unified approach to thread locality. In Proc. Internat. Conf. Architectural Support for Programming Languages and Operating Systems, pages 262-273, October 1998.
56. S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. The SPLASH-2 programs: characterization and methodological considerations. In Proc. Internat. Symp. Computer Architecture, pages 24-37, June 1995.