Distributed sorting
type: Item
instance of: scholarly article
title: Distributed sorting
zbMATH Open document ID: 0716.68040
DOI: 10.1016/0167-6423(90)90081-N
author: H. Peter Hofstee
author: Alain J. Martin
author: Jan L. A. van de Snepscheut
published in: Science of Computer Programming
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 4180794
zbMATH Keywords: parallelization
zbMATH Keywords: communicating sequential processes
zbMATH Keywords: distributed sorting
reviewed by: Dan Grigoras
MaRDI profile type: Publication
full work available at URL: 0167-6423(90)90081-n
OpenAlex ID: W2914438073
description: scientific article; zbMATH DE number 4180794