An Efficient Algorithm for Summing up Binary Values on a Reconfigurable Mesh (Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents an algorithm which sums up n binary values on an n×m reconfigurable mesh in O(log n/√<m log m>) time. This algorithm also yields a corollary which states that n binary values can be summed up on an n×log^2 n/log log n reconfigurable mesh in constant time.

• 社団法人電子情報通信学会の論文
• 1994-04-25

著者

• Nakano Koji

  Advanced Research Laboratory Hitachi Ltd.

関連論文

• Fundamental Protocols to Gather Information in Wireless Sensor Networks(Regular Section)
• An Energy-Efficient Initialization Protocol for Wireless Sensor Networks with No Collision Detection
• Energy-Efficient Initialization Protocols for Ad-Hoc Radio Networks
• A Parallel Method for the Prefix Convex Hulls Problem
• Distributed Leader Election on Chordal Ring Networks
• Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks(Special Section on Discrete Mathematics and Its Applications)
• Low-Temperature Growth of SiO_2 Films by Electron-Induced Ultrahigh Vacuum Chemical Vapor Deposition
• An Efficient Algorithm for Summing up Binary Values on a Reconfigurable Mesh (Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク