One-to-all broadcast is frequently implemented on multicomputers using a binomial tree communication pattern. The source processor, at the root of the broadcast tree, completes the broadcast before the processors at t...
详细信息
One-to-all broadcast is frequently implemented on multicomputers using a binomial tree communication pattern. The source processor, at the root of the broadcast tree, completes the broadcast before the processors at the leaves of the tree. This imbalance can degrade performance when a data-parallel algorithm requires a series of broadcasts from different source processors. In this paper, we show that using a reflected gray code to order broadcasts minimizes the communication time.
作者：
ER, MCDepartment of Computing Science
University of Wollongong Wollongong Australia. Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions
The definition of the N-ary reflected gray code is given. Two recursive algorithms for generating the N-ary reflected gray codes are presented: one algorithm is coded directly from the definition; another algorithm is...
详细信息
The definition of the N-ary reflected gray code is given. Two recursive algorithms for generating the N-ary reflected gray codes are presented: one algorithm is coded directly from the definition; another algorithm is derived from the sequencing orders of digits in the N-ary reflected gray codes. It is shown that these two algorithms are equivalent functionally. Furthermore, it is proven that the N-ary reflected gray code is cyclic when its radix is even, but not cyclic, in general, when its radix is odd.
A graycode counter which has an iterative and relatively simple structure is described. The code is shown to be the reflected binary graycode, implying simple conversion of the count into binary code.
A graycode counter which has an iterative and relatively simple structure is described. The code is shown to be the reflected binary graycode, implying simple conversion of the count into binary code.
暂无评论