Approximate parallel sorting on a spatial computer

Authors:
Max Orhai;Andrew P. Black
Affiliations:
Portland State University, Portland, OR, USA;Portland State University, Portland, OR, USA
Venue:
Proceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability
Year:
2012

Citing 10
Cited 0

The dynamics of collective sorting robot-like ants and ant-like robots

Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Distributed Systems: Concepts and Design

Distributed Systems: Concepts and Design
Botanical computing: a developmental approach to generating interconnect topologies on an amorphous computer

Botanical computing: a developmental approach to generating interconnect topologies on an amorphous computer
BLOB computing

Proceedings of the 1st conference on Computing frontiers
The development of the SIMULA languages

History of programming languages I
Bigraphs and Their Algebra

Electronic Notes in Theoretical Computer Science (ENTCS)
Designing efficient sorting algorithms for manycore GPUs

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Processes in space

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
A Basis Set of Operators for Space-Time Computations

SASOW '10 Proceedings of the 2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshop
Massively Parallel Automata in Euclidean Space-Time

SASOW '10 Proceedings of the 2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshop

Quantified Score

Hi-index	0.00

Visualization

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.