A systematic hypercube mapping method for partial sum problem is considered. For the mapping, a unique reflected Gray code is utilized. The mapping provides a reduced number of interprocess communication. A routing algorithm for the regular communication is presented. It keeps the nodes to be contention-free and fully utilized.
- Gray code
- parallel computing
- partial sum
ASJC Scopus subject areas
- Computational Theory and Mathematics