Sciweavers

Share
IPPS
1999
IEEE

Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses

9 years 3 months ago
Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus. Specifically, for any P N, our algorithm routes any permutation of N elements on a P-processor model optimally in O N P steps. This algorithm extends naturally to one for routing h-relations optimally in O(h) steps. We also establish the equivalence of the three models, LARPBS, LPB, and POB. This implies an automatic translation of algorithms (without loss of speed or efficiency) among these models.
Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Va
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where IPPS
Authors Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Vaidyanathan, Yi Pan
Comments (0)
books