@inproceedings{0ca19dfbc0704b66a61f012eb5d27297,
title = "A fast parallel sorting algorithm on the k-dimensional reconfigurable mesh",
abstract = " We presents a new parallel sorting algorithm on the k-dimensional reconfigurable mesh which is a generalized version of the well-studied (two dimensional) reconfigurable mesh. We introduce a new mapping technique which combines the enlarged bandwidth of the multidimensional mesh and the feature of the reconfigurable mesh. Using our mapping technique, we show that N k numbers can be sorted in O(4 k ) (constant time for small k) time on a k+1 dimensional reconfigurable mesh of size k+1 times N×N×...×N. In addition, it is shown that the number of 1's in a 0/1 array of k times size N×N×...×N can be computed in O(log∗ N+log k) time on reconfigurable k times mesh of size N×N×...×N.",
author = "Jang, {Ju Wook} and Kichul Kim",
note = "Publisher Copyright: {\textcopyright} 1997 IEEE.; 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 ; Conference date: 10-12-1997 Through 12-12-1997",
year = "1997",
doi = "10.1109/ICAPP.1997.651519",
language = "English",
series = "1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "519--532",
editor = "Wanlei Zhou and Andrzej Goscinski and Michael Hobbs",
booktitle = "1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997",
address = "United States",
}