Random data accesses on a coarse-grained parallel machine I. One-to-one mappings

Journal of Parallel and Distributed Computing

Volumn 44, Issue 1, 1997, Pages 14-23

  Shankar, Ravi V ^a   Ranka, Sanjay ^b  

^a SYRACUSE UNIVERSITY   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004899481     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1316     Document Type: Article

References (25)

1. A. Bar-Noy, S. Kipnis, 1992, Designing broadcasting algorithms for the postal model for message-passing systems, Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, 13, 22.
2. Bokhari S. H. Complete exchange on the iPSC/860. ICASE Technical Report. 91-4:January 1991.
3. S. H. Bokhari, 1991, Multiphase complete exchange on a circuit-switched hypercube, Proceedings of 1991 International Conference on Parallel Processing, 525, 529.
4. Z. Bozkus, S. Ranka, G. C. Fox, 1992, Benchmarking the CM-5 multicomputer, Proceedings of the Frontiers of Massively Parallel Computation, 100, 107.
5. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, T. von Eicken, 1993, LogP: Towards a realistic model of parallel computation, Proceedings of 4th ACM Symposium on Principles and Practices of Parallel Programming, 1, 12.
6. Dally W. J., Seitz C. L. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comput. 36:May 1987;547-553.
7. Hambrusch S. E., Hameed F., Khokhar A. A. Communication operations on coarse-grained mesh architectures. Technical Report. May 1994.
8. High Performance Fortran Language Specification. 1994;High Performance Fortran Forum.
9. Jaja J. An Introduction to Parallel Algorithms. 1992;Addison-Wesley, Reading.
10. Johnsson S. L., Ho C. T. Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Comput. 38:Sept. 1989;1249-1268.
11. Kim D., Bae S., Ranka S. Split algorithm for parallel vector prefix and reduction. Computer Science Technical Report. July 1995.
12. Kumar V., Grama A., Gupta A., Karypis G. Introduction to Parallel Computing: Design and Analysis of Algorithms. 1994;Benjamin-Cummings, Redwood City.
13. C. Leiserson, 1992, The network architecture of the Connection Machine CM-5, Proc. 4th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, CA.
14. MPI Forum, The message-passing interface standard, University of Tennessee, Knoxville.
15. Ni L. M., McKinley P. K. A survey of wormhole routing techniques in direct networks. IEEE Comput. 26:Feb. 1993;62-76.
16. Nassimi D., Sahni S. Data broadcasting in SIMD computers. IEEE Trans. Comput. C-30:1981;101-107.
17. V. K. Prasanna, C. L. Wang, 1994, Scalable data parallel object recognition using geometric hashing on the CM-5.
18. Wang C. L., Prasanna V. K., Kim H. J., Khokhar A. Scalable data parallel implementations of object recognition using geometric hashing. J. Parallel Distrib. Comput. 21:1994;96-109.
19. S. R. Seidel, 1989, Circuit switched vs store-and-forward solutions to symmetric communication problems, Proc. 4th Conference on Hypercube Computers and Concurrent Applications, 253, 255.
20. R. V. Shankar, September 1996, Scalable parallel algorithms for random data accesses and shared memory simulation, Syracuse University.
21. Shankar R. V., Alsabti K. A., Ranka S. The transportation primitive. CIS Technical Report. August 1994.
22. Shankar R. V., Ranka S. Random data accesses on a coarse-grained parallel machine. II. One-to-Many and Many-to-One Mappings. J. Parallel Distrib. Comput. 44:1997.
23. Shankar R. V., Ranka S. Parallel vision algorithms using sparse array representations. Pattern Recognition. 26:1993;1511-1519.
24. Shi H., Shaeffer J. Parallel sorting by regular sampling. J. Parallel Distrib. Comput. 14:1990;361-372.
25. Valiant L. G. A scheme for fast parallel communication. SIAM J. Comput. 11:1982;350-361.