|
Avtomatika i Telemekhanika, 1981, Issue 9, Pages 186–191
(Mi at5920)
|
|
|
|
Computers in Control
Sorting by merger in a parallel computer
I. S. Charnaya Moscow
Abstract:
The paper is concerned with a method for sorting by merger in a computer with one flow of commands and many flows of data, the computer consisting of $k$ parallel processors. The number which represents acceleration obtained in sorting by this method of an array of $N$ elements $N\gg k$ in comparison with the fastest possible sorting on a sequential computer approaches $\log_2N$ with $k$ fairly large.
Received: 21.09.1979
Citation:
I. S. Charnaya, “Sorting by merger in a parallel computer”, Avtomat. i Telemekh., 1981, no. 9, 186–191; Autom. Remote Control, 42:9 (1981), 1281–1284
Linking options:
https://www.mathnet.ru/eng/at5920 https://www.mathnet.ru/eng/at/y1981/i9/p186
|
Statistics & downloads: |
Abstract page: | 129 | Full-text PDF : | 83 | First page: | 2 |
|