Abstract: "The constant factors in the time complexity of three parallel mergesort variants, running on a EREW PRAM, are analysed under a simple cost model. The algorithms studied are linear-time mergesort, odd- even mergesort and polylogarithmic mergesort. The processors of a PRAM are assumed...

Full description

Bibliographic Details

Main Author:	Katajainen, Jyrki (Author)
Format:	Book
Language:	English
Published:	København 1995
Series:	Datalogisk Institut <København>: DIKU-Rapport 1995,27
Subjects:	Computer algorithms Parallel processing (Electronic computers) Sorting (Electronic computers)
Summary:	Abstract: "The constant factors in the time complexity of three parallel mergesort variants, running on a EREW PRAM, are analysed under a simple cost model. The algorithms studied are linear-time mergesort, odd- even mergesort and polylogarithmic mergesort. The processors of a PRAM are assumed to be word-addressable machines that can execute three-address instructions of our hypothetical assembly language in unit time. For the sake of comparison, sequential quicksort, heapsort and mergesort are examined within the same framework. The number of operations performed by linear-time mergesort, i.e. its work, is at most four times the time required by sequential mergesort. The work of polylogarithmic mergesort is about twenty times that of sequential mergesort. Morever, polylogarithmic mergesort seems to perform relatively well compared to odd-even mergesort, but there are still place [sic] for improvements."
Physical Description:	10 S.