A lower bound for permutation routing on two-dimensional bused meshes

Information Processing Letters

Volumn 45, Issue 5, 1993, Pages 225-228

  Cheung, S ^a   Lau, F C M ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

lower bounds; mesh connected computers; meshes with buses; MIMD; Parallel algorithms; permutation routing

Indexed keywords

ALGORITHMS; MULTIPROCESSING SYSTEMS; PARALLEL PROCESSING SYSTEMS;

LOWER BOUNDS; MESH CONNECTED COMPUTERS; MIMD ARCHITECTURE; PACKET ROUTING; PARALLEL ALGORITHMS; PERMUTATION ROUTING;

DATA COMMUNICATION SYSTEMS;

EID: 0027904993     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(93)90208-Q     Document Type: Article

References (11)

1. Optimal bounds for finding maximum on array of processors with k global buses
2. Square meshes are not always optimal
3. Finding maximum on an array processor with a global bus
4. Designing efficient parallel algorithms on mesh-connected computers with multiple broadcasting
5. Packet routing on mesh-connected computers
6. A 2n−2 step algorithm for routing in an n×n array with constant size queues
7. Packet routing on square meshes with row and column buses
8. On multi-dimensional packet routing for meshes with buses
9. Reconfigurable SIMD massively parallel computers
10. Array processor with multiple broadcasting
11. Mesh-connected computers with broadcasting