One-by-one cleaning for practical parallel list ranking

DOI10.1007/S00453-001-0077-8zbMATH Open1009.68193OpenAlexW2088115428MaRDI QIDQ1348937FDOQ1348937

Authors: Jop F. Sibeyn 

Publication date: 21 May 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0077-8

Recommendations

• Practical parallel list ranking
• List-ranking on interconnection networks.
• scientific article; zbMATH DE number 4064468
• List ranking and list scan on the Cray C90
• A simple randomized parallel algorithm for list-ranking

zbMATH Keywords

distributed-memory machinesone-by-one cleaning

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (4)

• Title not available (Why is that?)
• Random permutations on distributed, external and hierarchical memory
• List-ranking on interconnection networks.
• Portable list ranking

This page was built for publication: One-by-one cleaning for practical parallel list ranking

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