The impact of vector and parallel architectures on the Gaussian elimination algorithm / Yves Robert

Robert, Yves (1958-)

ISBN 10: 0719033659 / ISBN 13: 9780719033650

Edité par Manchester New York : Manchester University Press ; Halsted, 1990

A propos de cet article

Fine copy in the original colour-printed boards. Remains particularly well-preserved overall; tight, bright, clean and strong. Physical description; x, 194 pp., illustrations, 24 cm. Notes; Includes bibliography (pp. 183-191) and index. Subjects; Computer architecture.Vector processing (Computer science). Parallel processing (Electronic computers). Algorithms. Gaussian processes. 1 Kg.

N° de réf. du vendeur 386038

Détails bibliographiques

• Titre: The impact of vector and parallel architectures on the Gaussian elimination algorithm / Yves Robert
• Éditeur: Manchester New York : Manchester University Press ; Halsted
• Date de parution: 1990
• Langue: anglais
• ISBN à 10 chiffres: 0719033659
• ISBN à 13 chiffres: 9780719033650
• Reliure: Couverture rigide
• Édition: 1st edition.
• Poids: 1 kilogramme

A propos de ce titre

Synopsis

The thesis of this book is that the design of efficient parallel algorithms is dependent on a knowledge of the underlying parallel architecture. The first part of the book is implementation oriented, whereas the second part is devoted to design tools and methodologies. The first section of the book contains some background information on Gaussian elimination and parallel processing terminology and an introduction to pipeline, vector and parallel architectures. The next three chapters of the book are implementation oriented, describing the restructuring techniques needed for shared memory vector multiprocessors, distributed memory systems and systolic arrays. The book describes the recasting of the Gaussian elimination algorithm in terms of vector-vector, vector-matrix and matrix-matrix kernels, discusses hypercube computing and gives real-life examples of implementations on message-passing distributed memory systems. The last three chapters are more theoretical. Subjects covered include task graph scheduling, complexity results and speedup evaluation in a distributed memory environment and automatic synthesis methods for systolic arrays.