- 期刊
- OpenAccess
Efficient Parallel Prefix Algorithms on Multicomputers
並列摘要
Given n values v(0), v(1),…, v(n-1) and an associative binary operation, denoted by o, the prefix computation problem, or simply the prefix problem, is to compute the n prefixes v(0) o v(1) o...o v(i), 0≤i≤n-1. We are interested in performing prefix computation on message-passing completely connected multicomputers with the weakest communication capability in as few communication steps as possible. An efficient algorithm is presented to solve the prefix problem on a system of n processors. To explore the possibility of obtaining a faster algorithm, a class of algorithms is then presented. It is shown that the algorithm in this class requiring the fewest communication steps is equivalent to the first algorithm presented.
被引用紀錄
Wang, T. F. (2008). AES 加解密晶片之有效率可程式化邏輯陣列實現 [master's thesis, Tatung University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0081-0607200917250263
延伸閱讀
- 陳華、侯玉松（2006）。A study on Specific Primer Selection Algorithms Using Suffix Trees。Journal of Information Technology and Applications(資訊科技與應用期刊)，1(1)，25-30。https://doi.org/10.6302/JITA.200605_1(1).0004
- Sheu, T. F. (2008). Multi-Pattern Matching Algorithms for Networks [doctoral dissertation, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-0903200911353618
- Dong, Q. L., & He, S. N. (2013). On Two Projection Algorithms for the Multiple-Sets Split Feasibility Problem. Journal of Applied Mathematics, 2013(), 365-369-241. https://doi.org/10.1155/2013/347401
- 王嘉興、鍾青原、古東源（2012）。Optimization Multiple Quality Objective Algorithms。品質學報，19(5)，423-443。https://doi.org/10.6220/joq.2012.19(5).02
- Pan, T. T. (2011). Parallel Digraph Algorithms on Reconfigurable Architectures [doctoral dissertation, National Taiwan Normal University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0021-1610201315224085