Control for power gating of wires
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
Prefix computation is a fundamental problem in parallel computing. We consider prefix computation on a new bus-based parallel architecture, the segmented bus system. We show that prefix computation on N elements can be carried out in O(N/p+log p) time using a segmented bus that connects p processors. This algorithm can be generalized to k-dimensional meshes connected by segmented buses with the same performance.