article · Dialnet (Universidad de la Rioja) · 1992

Adaptive parallel sorting

Cited by 0Abstract and details only

Abstract

The capacity of an algorithm to modify its behavior to the size, difficulty or structure of the problem instance has been named adaptivity. The literature on parallel algorithms qualifies as adaptive those algorithms that work with a fixed amount of processors on input of arbitrary size while the literature on sorting algorithms qualifies as adaptive those algoritms that perform work proportional to the amount of disorder in the input. We combine these two concepts and present the first two parallel sorting algorithms that -are designed for a fixed number of processors and reconfigure according to the size of the input. - adapt to the amount of disorder in the input, and -are cost optimal.

Cite this paper

APA 7

Castro, V. E., & Wood, D. (1992). Adaptive parallel sorting. Dialnet (Universidad de la Rioja), 403–412.

MLA 9

Castro, Vladimir Estivill, and Derick Wood. “Adaptive parallel sorting.” Dialnet (Universidad de la Rioja), 1992, pp. 403–12.

Chicago

Castro, Vladimir Estivill, and Derick Wood. 1992. “Adaptive parallel sorting.” Dialnet (Universidad de la Rioja): 403–12.

Harvard

Castro, V.E. and Wood, D. (1992) ‘Adaptive parallel sorting’, Dialnet (Universidad de la Rioja), pp. 403–412.

BibTeX

@article{castro1992adaptive,
  title = {{Adaptive parallel sorting}},
  author = {Castro, Vladimir Estivill and Wood, Derick},
  journal = {Dialnet (Universidad de la Rioja)},
  pages = {403--412},
  year = {1992}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.