Finding optimal parallel prefix circuits with fan-out 2 in constant time

Information Processing Letters

Volumn 70, Issue 4, 1999, Pages 191-195

  Lin, Yen Chun ^a   Liu, Chun Keng ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK SYNTHESIS; OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING;

CONSTANT-TIME ALGORITHMS; PARALLEL PREFIX CIRCUITS;

COMBINATORIAL CIRCUITS;

EID: 0033612091     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00058-7     Document Type: Article

References (19)

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. R.P. Brent, H.T. Kung, A regular layout for parallel adders, IEEE Trans. Comput. C-31 (3) (1982) 260-264.
4. 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.
5. D.A. Carlson, B. Sugla, Limited width parallel prefix circuits, J. Supercomput. 4 (2) (1990) 107-129.
6. R. Cole, U. Vishkin, Faster optimal parallel prefix sums and list ranking, Inform. Contr. 81 (1989) 334-352.
7. F.E. Fich, New bounds for parallel prefix circuits, in: Proc. 15th Symp. on the Theory Of Computing, 1983, pp. 100-109.
8. D.W. Krumme, G. Cybenko, K.N. Venkataraman, Gossiping in minimal tune, SIAM J. Comput. 21 (1) (1992) 111-139.
9. 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.
10. R.E. Ladner, M.J. Fischer, Parallel prefix computation, J. ACM 27 (4) (1980) 831-838.
11. S. Lakshmivarahan, S.K. Dhall, Parallel Computing Using The Prefix Problem, Oxford University Press, Oxford, 1994.
12. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
13. Y.C. Lin, Optimal prefix circuits with fan-out 2, in: Proc. Internat. Conf. on Algorithms, 1996, pp. 175-181.
14. 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.
15. Y.C. Lin, C.C. Shih, A new class of depth-size optimal parallel prefix circuits, J. Supercomput., to appear.
16. Y.C. Lin, C.C. Shih, Optimal parallel prefix circuits with fan-out at most 4, in: Proc. IASTED Internat. Conf. on Parallel and Distributed Computing and Networks, 1998, pp. 312-317.
17. M. Snir, Depth-size trade-offs for parallel prefix computation, J. Algorithms 7 (1986) 185-201.
18. 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.
19. N.H.E. Weste, K. Eshraghian, Principles of CMOS VLSI Design: A System Perspective, 2nd Ed., Addison-Wesley, Reading, MA, 1993.