Sorting algorithms on transputer arrays

DOI10.1016/0167-8191(93)90009-AMaRDI QIDQ1802662zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 31 October 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(93)90009-a

zbMATH Keywords

performance analysisparallel sorting algorithmstransputer arraysmessage passing multiprocessors

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Searching and sorting (68P10)

Recommendations

• A parallel sorting-merging algorithm for tightly coupled multiprocessors
• An efficient parallel sorting algorithm for shared memory multiprocessors
• An experimental analysis of parallel sorting algorithms
• Publication:3802636
• Parallel sorting by regular sampling

Cited in

(2)

• Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge
• Implementation of bubble sort and the odd-even transposition sort on a rack of transputers

This page was built for publication: Sorting algorithms on transputer arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802662)