Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2552, Issue , 2002, Pages 63-75

  Bader, David A ^a   Sreshta, Sukanya ^a   Weisse Bernstein, Nina R ^a  

^a University of New Mexico   (United States)

Author keywords

Expression evaluation; High performance algorithm engineering; Parallel graph algorithms; Shared memory; Tree contraction

Indexed keywords

COMPUTATION THEORY; FORESTRY; MEMORY ARCHITECTURE; PARALLEL PROCESSING SYSTEMS;

EXPRESSION EVALUATION; HIGH-PERFORMANCE ALGORITHM ENGINEERING; PARALLEL GRAPH ALGORITHMS; SHARED MEMORY; TREE CONTRACTION;

TREES (MATHEMATICS);

EID: 84945304588     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36265-7_7     Document Type: Conference Paper

References (20)

1. D.A. Bader and J. Jaja. SIMPLE: A methodology for programming high performance algorithms on clusters of symmetric multiprocessors (SMPs). J. Parallel & Distributed Comput., 58 (1):92–108, 1999. 69
2. D.A. Bader, A.K. Illendula, B.M.E. Moret, and N. Weisse-Bernstein. Using PRAM algorithms on a uniform-memory-access shared-memory architecture. In G. S. Brodal, D. Frigioni, and A. Marchetti-Spaccamela, editors, Proc. 5th Int’l Workshop on Algorithm Engineering (WAE 2001), volume 2141 of Lecture Notes in Computer Science, pages 129–144, Arhus, Denmark, August 2001. Springer-Verlag. 65
3. E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S.W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. 24th Int’l Colloquium on Automata, Languages and Programming (ICALP’97), volume 1256 of Lecture Notes in Computer Science, pages 390–400, Bologna, Italy, 1997. Springer-Verlag. 65
4. A. Charlesworth. Starfire: extending the SMP envelope. IEEE Micro, 18 (1):39–49, 1998. 64
5. A. Charlesworth. The Sun Fireplane system interconnect. In Proc. Supercomputing (SC 2001), pages 1–14, Denver, CO, November 2001. 64
6. R. Cole and U. Vishkin. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica, 3:329–346, 1988. 65
7. F. Dehne, A. Ferreira, E. Caceres, S.W. Song, and A. Roncato. Efficient parallelgraph algorithms for coarse-grained multicomputers and BSP. Algorithmica, 33:183–200, 2002. 65
8. A.M. Gibbons and W. Rytter. An optimal parallel algorithm for dynamic expression evaluation and its applications. Information and Computation, 81:32–45, 1989. 65
9. B. Grayson, M. Dahlin, and V. Ramachandran. Experimental evaluation of QSM, a simple shared-memory model. In Proc. 13th Int’l Parallel Processing Symp. And 10th Symp. Parallel and Distributed Processing (IPPS/SPDP), pages 1–7, San Juan, Puerto Rico, April 1999. 65
10. D.R. Helman and J. Jaja. Designing practical efficient algorithms for symmetric multiprocessors. In Algorithm Engineering and Experimentation (ALENEX’99), volume 1619 of Lecture Notes in Computer Science, pages 37–56, Baltimore, MD, January 1999. Springer-Verlag. 70, 71
11. T.-S. Hsu and V. Ramachandran. Efficient massively parallel implementation of some combinatorial algorithms. Theoretical Computer Science, 162 (2):297–322, 1996. 65
12. T.-S. Hsu, V. Ramachandran, and N. Dean. Implementation of parallel graphalgorithms on a massively parallel SIMD computer with virtual processing. In Proc. 9th Int’l Parallel Processing Symp., pages 106–112, Santa Barbara, CA, April 1995. 65
13. J. JaJa. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, New York, 1992. 64, 66, 67
14. J. Keller, C.W. Kebler, and J. L. Traff. Practical PRAM Programming. John Wiley & Sons, 2001. 65
15. S.R. Kosaraju and A.L. Delcher. Optimal parallel evaluation of tree-structured computations by raking (extended abstract). Technical report, The Johns Hopkins University, 1987. 65, 66, 68
16. G. L. Miller and J.H. Reif. Parallel tree contraction and its application. In Proc. 26th Ann. IEEE Symp. Foundations of Computer Science (FOCS), pages 478–489, Portland, OR, October 1985. IEEE Press. 65
17. Open MP Architecture Review Board. OpenMP: A proposed industry standard API for shared memory programming. www.openmp.org, October 1997. 64
18. M. Reid-Miller. List ranking and list scan on the Cray C-90. J. Comput. Syst. Sci., 53(3):344–356, December 1996. 65
19. J.H. Reif, editor. Synthesis of Parallel Algorithms. Morgan Kaufmann Publishers, 1993. 64
20. J. Sibeyn. Better trade-offs for parallel list ranking. In Proc. 9th Ann. Symp. Parallel Algorithms and Architectures (SPAA-97), pages 221–230, Newport, RI, June 1997. ACM. 65