Parallel sorting algorithms

by Akl, Selim G.

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :Parallel sorting algorithms / Selim G. Akl.

Summary

'Parallel sorting algorithms' is an overview over sorting algorithms for various parallel computer architectures. After introducing the problem of sorting, giving a taxonomy of parallel computer architectures and discussing efficiency concepts in parallel algorithms, various sorting methods on SIMD and MIMD computers are introduced. The author describes and analyzes sorting algorithms on sorting networks, vector machines, the perfect-shuffle, mesh- and cube-connected computers, tree machines and asynchronous MIMD machines. Furthermore, there are chapters on parallel external sorting and general lower bounds for the problem of parallel sorting. The book is very readable and serves as an excellent means to get an overview over methods to solve the important problem of parallel sorting.

Edition Statements

Publication Date:1985.

Publication Statements

Publisher(s):Academic Press
Place of Publication:Orlando
Language:eng
Publication Date:1985.

The Physical Object

Description:xiii, 229 pages : : illustrations ; : 24 cm

Edition Identifiers

ISBN:0120476800, 9780120476800, 0120476819, 9780120476817
oclc:ocm12107552
LC Classification:QA76.5
Dewey Decimal:001.64

Introduction -- Networks for sorting -- Linear arrays -- The perfect shuffle -- Mesh--connected computers -- Tree machines -- Cube--connected computers -- Shared--memory SIMD computers -- Asynchronous sorting on multiprocessors -- Parallel external sorting -- Lower bounds.

Subjects

Algorithmes Algorithmes parallèles ALGORITHMS algoritmen parallel algorithms Parallel processing (Electronic compute… Parallélisme (Informatique) Parallelle verwerking Parallelverarbeitung Sortieren Sortierverfahren Sorting (Electronic computers) Tri (Informatique)