Mathematical Foundations of Parallel Computing / Valentin V. Voevodin

Voevodin, Valentin V.

ISBN 10: 9810208200 / ISBN 13: 9789810208202

Published by Singapore ; London : World Scientific, 1992

About this Item

Fine cloth copy in an equally fine dw. Particularly and surprisingly well-preserved; tight, bright, clean and especially sharp-cornered. ; 343 pages; Physical desc. : xx, 343 p. : ill. ; 23 cm. Subject: Parallel computers --Programming --Parallel algorithms. Series: World Scientific Series in Computer Science ; 33. 2 Kg.

Seller Inventory # 31169

Bibliographic Details

• Title: Mathematical Foundations of Parallel Computing / Valentin V. Voevodin
• Publisher: Singapore ; London : World Scientific
• Publication Date: 1992
• Language: English
• ISBN 10: 9810208200
• ISBN 13: 9789810208202
• Binding: Hardcover
• Edition: First Edition.
• Dust Jacket Condition: Dust Jacket Included

About this title

Synopsis

Parallel implementation of algorithms involves many difficult problems. In particular among them are round-off analysis, the way to convert sequential programs and algorithms into the parallel mode, the choice of appropriate or optimal computer architect and so on. To solve these problems, it is necessary to know very well the structure of algorithms. This book deal with the mathematical mechanism that permits us to investigate structures of both sequential and parallel algorithms. This mechanism allows us to recognize and explain the relations between different methods of constructing parallel algorithms, the methods of analysing round-off errors, the methods of optimizing memory traffic, the methods of working out the fastest implementation for a given parallel computer and other methods attending the joint investigation of algorithms and computers.

Product Description

Parallel implementation of algorithms involves many difficult problems. In particular among them are round-off analysis, the way to convert sequential programmes and algorithms into parallel mode, the choice of appropriate or optimal computer architect and so on. To solve the stumbling blocks of these problems it is necessary to know the structure of algorithms very well. The book treats the mathematical mechanism that permits us to investigate structures of both sequential and parallel algorithms. This mechanism allows us to recognize and explain the relations between different methods of constructing parallel algorithms, methods to analyze round-off errors, methods to optimize memory traffic, methods to work out the fastest implementation for a given parallel computer and other methods attending the joint investigation of algorithms and computers.