Efficient external memory algorithms by simulating coarse-grained parallel algorithms

DOI10.1007/S00453-002-1009-YMaRDI QIDQ1400889zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Bulk synchronous parallel algorithms for the external memory model
• scientific article; zbMATH DE number 1792107
• scientific article; zbMATH DE number 2163020
• scientific article; zbMATH DE number 1424311
• Publication:4886043

Cited in

(9)

• Efficient sampling of random permutations
• An external memory data structure for shortest path queries
• I/O-efficient algorithms for graphs of bounded treewidth
• An efficient programming model for memory-intensive recursive algorithms using parallel disks
• scientific article; zbMATH DE number 4078746 (Why is no real title available?)
• Random permutations on distributed, external and hierarchical memory
• Exploiting storage redundancy to speed up randomized shared memory simulations
• Bulk synchronous parallel algorithms for the external memory model
• Memory management algorithms for optimistic parallel simulation

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

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