List-ranking on interconnection networks.

DOI10.1016/S0890-5401(02)00029-9zbMath1054.68167MaRDI QIDQ1401927

Jop F. Sibeyn

Publication date: 19 August 2003

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

Parallel algorithmsInterconnection networksHypercubesMeshesRandomizationList-ranking

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

Adapting parallel algorithms to the W-stream model, with applications to graph problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List ranking and list scan on the Cray C90
• Deterministic parallel list ranking
• A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
• Optimal routing algorithms for mesh-connected processor arrays
• List ranking on meshes
• Practical parallel list ranking
• One-by-one cleaning for practical parallel list ranking
• Efficient massively parallel implementation of some combinatorial algorithms
• Solving tree problems on a mesh-connected processor array

This page was built for publication: List-ranking on interconnection networks.