Random permutations on distributed, external and hierarchical memory

DOI10.1016/S0020-0190(98)00127-6zbMATHMaRDI QIDQ293386FDO

Authors Peter Sanders

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098001276?np=y

zbMATH Keywords

computational complexityrandomized algorithmcacheparallelismexternal memoryhierarchical memoryinstruction levelparallel random permutation generation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Randomized algorithms (68W20) Parallel algorithms in computer science (68W10)

Recommendations

• The entropy of a distributed computation random number generation from memory interleaving
• Publication:4036581
• Publication:4942231
• On Monte Carlo methods in distributed memory systems
• Large-scale sorting in uniform memory hierarchies
• Randomized Rendez-Vous with Limited Memory
• Publication:4035173

Cites work

• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• Efficient external memory algorithms by simulating coarse-grained parallel algorithms
• Fast generation of random permutations via networks simulation
• One-by-one cleaning for practical parallel list ranking
• Randomized multipacket routing and sorting on meshes
• Towards optimal locality in mesh-indexings

Cited in

(12)

• Efficient sampling of random permutations
• scientific article; zbMATH DE number 176751 (Why is no real title available?)
• scientific article; zbMATH DE number 1863285 (Why is no real title available?)
• Fast random integer generation in an interval
• Fast generation of random permutations via networks simulation
• I/O-efficient generation of massive graphs following the \textit{LFR} benchmark
• Algorithm 947: Paraperm -- parallel generation of random permutations with MPI
• The generation of random permutations on the fly
• In-place random list permutations
• Parallel Weighted Random Sampling
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• MergeShuffle: a very fast, parallel random permutation algorithm

This page was built for publication: Random permutations on distributed, external and hierarchical memory

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