Random permutations on distributed, external and hierarchical memory
DOI10.1016/S0020-0190(98)00127-6zbMATH Open1339.68312MaRDI QIDQ293386FDOQ293386
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
Recommendations
computational complexityrandomized algorithmcacheparallelismexternal memoryhierarchical memoryinstruction levelparallel random permutation generation
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Randomized algorithms (68W20) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- 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
- Randomized multipacket routing and sorting on meshes
Cited In (10)
- Efficient sampling of random permutations
- In-place random list permutations
- The generation of random permutations on the fly
- Title not available (Why is that?)
- Fast random integer generation in an interval
- Title not available (Why is that?)
- Algorithm 947
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark
- Parallel Weighted Random Sampling
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)