Designing practical efficient algorithms for symmetric multiprocessors

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

Volumn 1619, Issue , 1999, Pages 37-56

  Helman, David R ^a   Jájá, Joseph ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); INTEGRATED CIRCUIT DESIGN; MEMORY ARCHITECTURE; MULTIPROCESSING SYSTEMS;

COMPUTATIONAL MODEL; DISTRIBUTED MEMORY ARCHITECTURE; MEMORY ACCESS PATTERNS; MULTI PROCESSOR SYSTEMS; PREFIX COMPUTATION; REGULAR SAMPLINGS; SCALABLE PERFORMANCE; SYMMETRIC MULTI-PROCESSORS;

COMPUTATIONAL EFFICIENCY;

EID: 84979025439     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48518-x_3     Document Type: Conference Paper

References (18)

1. A. Aggarwal, B. Alpern, A. Chandra, and M. Snir. A Model for Heirarchical Memory. In Proceedings of the 19th Annual ACM Symposium of Theory of Computing, pages 305-314, May 1987.
2. A. Aggarwal, A. Chandra, and M. Snir. Heirarchical Memory with Block Transfer. In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pages 204-216, October 1987.
3. A. Aggarwal and J. Vitter. The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM, 31:1116-1127, 1988.
4. B. Alpern, L. Carter, E. Feig, and T. Selker. The Uniform Memory Hierarchy Model of Compuatation. Algorithmica, 12:72-109, 1994.
5. R. Anderson and G. Miller. Deterministic Parallel List Ranking. In Proceedings Third Aegean Workshop on Computing, AWOC 88, pages 81-90, Corfu, Greece, June/July 1988. Springer-Verlag.
6. G.E. Blelloch, P.B. Gibbons, Y. Matias, and M. Zagha. Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 8(9):943-958, 1997.
7. P.B. Gibbons, Y. Matias, and V. Ramachandran. The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms. SIAM Journal on Computing, 1997. To appear.
8. D.R. Helman and J. JáJá. Prefix Computations on Symmetric Multiprocessors. Technical Report CS-TR-3915 and UMIACS-TR-98-38, UMIACS and Electrical Engineering, University of Maryland, College Park, MD, July 1998.
9. D.R. Helman and J. JáJá. Sorting on Clusters of SMPs. In Proceedings of the 12th International Parallel Processing Symposium, Orlando, Florida, April 1998.
10. D.R. Helman, J. JáJá, and D.A. Bader. A New Deterministic Parallel Sorting Algorithm With an Experimental Evaluation. ACM Journal of Experimental Algorithmics, 3(4):1-24, 1998.
11. D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley Publishing Company, Reading, MA, 1973.
12. A. LaMarca and R. Ladner. The Influence of Caches on the Performance of Sorting. In roceedings of the Eighth Annual Symposium on Discrete Algorithms, pages 370377, January 1997.
13. M. Reid-Miller. List Ranking and List Scan on the Cray C90. Journal of the Computer and System Sciences, 53:344-356, 1996.
14. H. Shi and J. Schaeffer. Parallel Sorting by Regular Sampling. Journal of Parallel and Distributed Computing, 14:361-372, 1992.
15. P. Varman, B. Iyer, and S. scheufler. A Multiprocessor Algorithm for Merging Multiple Sorted Lists. In Proceedings of the 1990 International Conference on Parallel Processing, pages 22-26.
16. Uzi Vishkin. Randomized Speed-Ups in Parallel Computation. In Proceedings of the Sixteenth ACM Symposium on Theory of Computing, pages 230-239, Washington, D.C., 1984.
17. J. Vitter and E. Shriver. Algorithms for Parallel Memory I: Two-Level Memories. Algorithmica, 12:110-147, 1994.
18. J.C. Wyllie. The Complexity of Parallel Computations. PhD thesis, Department of Computer Science, Cornell University, Ithica, NY, 1979.