Distributed sorting
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.
scientific article; zbMATH DE number 4180794