Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses

DOI10.1006/JAGM.1998.0966MaRDI QIDQ4217301zbMATH OpenOpenAlexFDO

Authors Sanguthevar Rajasekaran

Publication date 11 November 1998

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/72cd02eda2a6c37cb79a5a06455734ee6cbbf745

zbMATH Keywords

mesh connected computers

Mathematics Subject Classification ID

Recommendations

• Selection on k-Dimensional Meshes with Multiple Broadcasting
• Fast deterministic selection on mesh-connected processor arrays
• Unifying themes for selection on any network
• Upper and lower bounds for selection on the mesh

Cited in

(5)

• Upper and lower bounds for selection on the mesh
• Fast deterministic selection on mesh-connected processor arrays
• Selection on rectangular meshes with multiple broadcasting
• Scalable algorithms for the mesh with buses: merging, sorting and selection
• Selection on k-Dimensional Meshes with Multiple Broadcasting

This page was built for publication: Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4217301)