Sorting on PRAMs with reconfigurable buses

DOI10.1016/0020-0190(92)90240-VzbMath0772.68024MaRDI QIDQ1198059

Ramachandran Vaidyanathan

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

sortingEREW B-PRAMreconfigurable bus systems

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items

Parallel integer sorting using small operations ⋮ SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS ⋮ FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH ⋮ A unified \(O(\log N)\) and optimal sorting vector algorithm ⋮ Integer summing algorithms on reconfigurable meshes

Cites Work

• Constant time sorting on a processor array with a reconfigurable bus system
• Improved deterministic parallel integer sorting
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Optimal bounds for decision problems on the CRCW PRAM
• Unnamed Item
• Unnamed Item