Prefix computation using a segmented bus

Abstract

Prefix computation is a fundamental problem in parallel computing. The authors consider prefix computation on a new bus-based parallel architecture, the segmented bus system. The authors 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.