By Topic

Parallel sort on a linear array of cellular automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gordillo, J.L. ; ITESM, Monterrey, Mexico ; Luna, J.V.

A cellular automata machine (CA machine) is a structure of interconnected elementary automata, evolving in a parallel and synchronous way. In this paper, we analyse the CA Machine as a general computing structure in which specific computations on the input data must be done. We extend the standard definition of cellular automata to include some requirements of memory to store data, also with some rules to detect the end of the computations and to obtain a result. To validate and illustrate the computations on the CA machine, we present the analysis and implementation of parallel sort algorithms. We describe algorithms, in which each automata cell has a key to be ordered. The sort is performed by the exchange of keys between cell neighbours. Rules are included in order that a cell chooses the neighbour with which the exchange (swap) will be performed, without knowing its cell index nor the length of the array. We show that the algorithm complexity of sorting n keys in those machines is linear on n

Published in:

Systems, Man, and Cybernetics, 1994. Humans, Information and Technology., 1994 IEEE International Conference on  (Volume:2 )

Date of Conference:

2-5 Oct 1994