Y
Yen-Chun Lin
Researcher at National Taiwan University of Science and Technology
Publications - 27
Citations - 217
Yen-Chun Lin is an academic researcher from National Taiwan University of Science and Technology. The author has contributed to research in topics: Prefix & Parallel algorithm. The author has an hindex of 9, co-authored 27 publications receiving 213 citations.
Papers
More filters
Journal ArticleDOI
A new approach to constructing optimal parallel prefix circuits with small depth
Yen-Chun Lin,Jun-Wei Hsiao +1 more
TL;DR: A new approach to easing the design of parallel prefix circuits is presented, and a depth-size optimum parallel prefix circuit, named WE4 with fan-out 4 is constructed, which has the smallest depth among all known depthsize optimal prefix circuits with bounded fan- out.
Journal ArticleDOI
Faster optimal parallel prefix circuits: New algorithmic construction
Yen-Chun Lin,Chin-Yu Su +1 more
TL;DR: This paper presents a new algorithm to design parallel prefix circuits, and constructs a class of depth-size optimal parallel prefixcircuits, named SU4, with fan-out 4, which has the smallest depth among all known depth- size optimal prefix circuits withFan out 4.
Journal ArticleDOI
A New Class of Depth-Size Optimal Parallel Prefix Circuits
Yen-Chun Lin,Chao-Cheng Shih +1 more
TL;DR: A new depth-size optimal prefix circuit SL(n), which is much easier to design than LYD(n) and whose depth can be any integer between d(SL(n)) and n−1.
Journal ArticleDOI
Constructing H 4, a Fast Depth-Size Optimal Parallel Prefix Circuit
TL;DR: Some properties related to depth-size optimality and size optimality are introduced; they are used to prove that H4 is Depth-size optimal prefix circuit H4, which has the smallest depth among all known depth- size optimal prefix circuits with a constant fan-out.
Journal ArticleDOI
Efficient parallel prefix algorithms on mulitport message-passing systems
Yen-Chun Lin,Ching-Sung Yeh +1 more
TL;DR: The communication lower bound for the prefix problem on a multiport message-passing fully connected multicomputer is presented and two efficient parallel prefix algorithms are presented that are optimal in the number of communication steps and time-optimal.