Efficient parallel prefix algorithms on multiport message-passing systems

Information Processing Letters

Volumn 71, Issue 2, 1999, Pages 91-95

  Lin, Yen Chun ^a   Yeh, Ching Sung ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Algorithms; Message passing; Multiport; Parallel algorithms; Prefix computation

Indexed keywords

EID: 0002953347     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00087-3     Document Type: Article

References (17)

1. S.G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, Upper Saddle River, NJ, 1997.
2. G.E. Blelloch, Scans as primitive operations, IEEE Trans. Comput. 38 (11) (1989) 1526-1538.
3. J. Bruck, C.T. Ho, S. Kipnis, E. Upfal, D. Weathersby, Efficient algorithms for all-to-all communications in multiport message-passing systems, IEEE Trans. Parallel Distributed Syst. 8 (11) (1997) 1143-1155.
4. R. Cole, U. Vishkin, Faster optimal parallel prefix sums and list ranking, Inform. Contr. 81 (1989) 334-352.
5. A.L. Fisher, A.M. Ghuloum, Parallelizing complex scans and reductions, in: Proc. ACM SIGPLAN'94 Conf. on Programming Language Design and Implementation, 1994, pp. 135-146.
6. C.P. Kruskal, T. Madej, L. Rudolph, Parallel prefix on fully connected direct connection machines, in: Proc. Internat. Conf. on Parallel Processing, 1986, pp. 278-284.
7. C.P. Kruskal, L. Rudolph, M. Snir, The power of parallel prefix, IEEE Trans. Comput. C-34 (10) (1985) 965-968.
8. R.E. Ladner, M.J. Fischer, Parallel prefix computation, J. ACM 27 (4) (1980) 831-838.
9. S. Lakshmivarahan, S.K. Dhall, Parallel Computing Using the Prefix Problem, Oxford University Press, Oxford, 1994.
10. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
11. Y.C. Lin, Optimal prefix circuits with fan-out 2, in: Proc. Internat. Conf. on Algorithms, 1996, pp. 175-181.
12. Y.C. Lin, C.M. Lin, Efficient parallel prefix algorithms on fully connected message-passing computers, in: Proc. 3rd Internat. Conf. on High Performance Computing, 1996, pp. 316-321.
13. Y.C. Lin, C.C. Shih, Optimal parallel prefix circuits with fan-out at most 4, in: Proc. 2nd IASTED Internat. Conf. on Parallel and Distributed Computing and Networks, 1998, pp. 312-317.
14. Y.C. Lin, C.C. Shih, A new class of depth-size optimal parallel prefix circuits, J. Supercomput., to appear.
15. M. Snir, Depth-size trade-offs for parallel prefix computation, J. Algorithms 7 (1986) 185-201.
16. H. Wang, A. Nicolau, K.S.Siu, The strict time lower bound and optimal schedules for parallel prefix with resource constraints, IEEE Trans. Comput. 45 (11) (1996) 1257-1271.
17. C.S. Yeh, Efficient parallel prefix algorithms on the multiport and multiport postal models, Master Thesis, Dept. of Electronic Engineering, National Taiwan University of Science and Technology, Taipei, 1998.