By Topic

Prefix computation using a segmented bus

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Li, Y. ; Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA ; Zheng, S.Q.

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

Published in:

System Theory, 1996., Proceedings of the Twenty-Eighth Southeastern Symposium on

Date of Conference:

31 Mar-2 Apr 1996