Distributed sorting (Q753491)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4180794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distributed sorting |
scientific article; zbMATH DE number 4180794 |
Statements
Distributed sorting (English)
0 references
1990
0 references
The papers deals with distributed sorting. The idea is that given a finite set of nonempty bags (with numbers to be sorted) and a linear array of processes, each of the processors contains a bag and communicates through channels with its neighbors in the array. Clearly this model can be implemented on a system with transputers. The main operation is the exchange of the maximum element of the bag i with the minimum element of bag \(i+1\) till the sorting is fulfilled. As the authors claim, the paper is just an exercise in deriving parallel programs.
0 references
parallelization
0 references
communicating sequential processes
0 references
distributed sorting
0 references
0.7950335741043091
0 references
0.7810396552085876
0 references
0.7775247097015381
0 references
0.7737687230110168
0 references
