Unifying themes for selection on any network

DOI10.1006/JPDC.1997.1382MaRDI QIDQ1384524zbMATH OpenOpenAlexFDO

Authors Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph

Publication date 1 October 1998

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://semanticscholar.org/paper/8037e5897de22b68d7742dc14ccef9c3dbf1b44d

zbMATH Keywords

interconnection network

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Parallel algorithms in computer science (68W10)

Recommendations

• Sorting-based selection algorithms for hypercubic networks
• Selection on k-Dimensional Meshes with Multiple Broadcasting
• Fast deterministic selection on mesh-connected processor arrays
• scientific article; zbMATH DE number 4213428
• Distributed algorithms for selection in sets

Cited in

(10)

• Distributed algorithms for selection in sets
• Improved universal \(k\)-selection in hypercubes
• An improved, randomized algorithm for parallel selection with an experimental study
• Fast deterministic selection on mesh-connected processor arrays
• scientific article; zbMATH DE number 4213428 (Why is no real title available?)
• scientific article; zbMATH DE number 4050993 (Why is no real title available?)
• scientific article; zbMATH DE number 403945 (Why is no real title available?)
• Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses
• Selection on k-Dimensional Meshes with Multiple Broadcasting
• scientific article; zbMATH DE number 1419213 (Why is no real title available?)

This page was built for publication: Unifying themes for selection on any network

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