Random permutations on distributed, external and hierarchical memory

DOI10.1016/S0020-0190(98)00127-6zbMath1339.68312MaRDI QIDQ293386

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

cachecomputational complexityparallelismrandomized algorithmexternal memoryhierarchical memoryinstruction levelparallel random permutation generation

Mathematics Subject Classification ID

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

Related Items (4)

I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark ⋮ Parallel Weighted Random Sampling ⋮ Design and Engineering of External Memory Traversal Algorithms for General Graphs ⋮ Algorithm 947

Cites Work

• Unnamed Item
• Randomized multipacket routing and sorting on meshes
• One-by-one cleaning for practical parallel list ranking
• Efficient external memory algorithms by simulating coarse-grained parallel algorithms
• Fast generation of random permutations via networks simulation
• Towards optimal locality in mesh-indexings

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