Permutation on the mesh with reconfigurable bus: algorithms and practical considerations

• Published in: Parallel Processing Symposium, 7th International (IPPS '93 pp. 298 - 308
• Main Authors: Lu, Y.-W., Burr, J.B., Peterson, A.M.
• Format: Conference Proceeding
• Language: English
• Published: IEEE Comput. Soc. Press 1993
• Subjects: Circuits; Communication system control; Computational modeling; Costs; Delay; Nearest neighbor searches; Parallel processing; Routing; Throughput; Transmitters
• ISBN: 9780818634420; 0818634421
• DOI: 10.1109/IPPS.1993.262896

Permutation is a common problem in both computation and communication. The authors add the buses to the mesh-connected multiprocessors and introduce the tokens to control the buses. They propose to use the mesh with segmented reconfigurable bus to increase performance of data routing. Segmented reconfigurable bus can not only use the bus-token more efficiently than the traditional bus, but also reduce interconnection delay. The authors choose the segment length to balance latency and throughput of the system to get better performance. In the simulation, the mesh with segmented reconfigurable bus can finish N*N permutation in .6065 N steps in average.< >