Efficient external memory algorithms by simulating coarse-grained parallel algorithms

DOI10.1007/S00453-002-1009-YzbMath1045.68162OpenAlexW1998017993MaRDI QIDQ1400889

D. Massart

Publication date: 17 August 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-1009-y

zbMATH Keywords

Parallel algorithmsParallel I/OCoarse grained parallel computingExternal memory algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (4)

I/O-efficient algorithms for graphs of bounded treewidth ⋮ Random permutations on distributed, external and hierarchical memory ⋮ Efficient sampling of random permutations ⋮ An external memory data structure for shortest path queries

This page was built for publication: Efficient external memory algorithms by simulating coarse-grained parallel algorithms