Name
Abstract | ||
|---|---|---|
We describe collision sort, a simple distributed sorting algorithm for a spatial computer on a regular lattice, which represents data by mobile particles in an abstract space. Although collision sort produces only approximate results, it tolerates faults, minimizes communication, and adapts easily to simultaneous multi-axis sorting. We show simulations of collision sort in 1 and 2 dimensions, and discuss its scalability properties. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1145/2414729.2414739 | Proceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability |
Keywords | Field | DocType |
approximate parallel,abstract space,spatial computer,mobile particle,regular lattice,approximate result,minimizes communication,simultaneous multi-axis,collision sort,scalability property,concurrency,communication,synchronization,approximation | Timsort,Merge sort,Computer science,sort,Parallel computing,In-place algorithm,Algorithm,Sorting,Real-time computing,Collision,Sorting algorithm,Scalability | Conference |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Max Orhai | 1 | 1 | 0.68 |
| Andrew P. Black | 2 | 1566 | 366.84 |