Mathematical Foundations of Parallel Computing (Series in Computer Science)

Voevodin, Valentin V.:

ISBN 10: 9810208200 / ISBN 13: 9789810208202

Published by World Scientific Publishing Co Pte Ltd 01.05.1992., 1992

About this Item

400 Seiten ex Library Book / aus einer wissenschafltichen Bibliothek / Sprache: Englisch Gewicht in Gramm: 469 21,8 x 15,5 x 2,8 cm, Gebundene Ausgabe Auflage: 1st Edition. Series: World Scientific Series in Computer Science ; 33.

Seller Inventory # 367803

Bibliographic Details

• Title: Mathematical Foundations of Parallel Computing (Series in Computer Science)
• Publisher: World Scientific Publishing Co Pte Ltd 01.05.1992.
• Publication Date: 1992
• Language: English
• ISBN 10: 9810208200
• ISBN 13: 9789810208202
• Binding: Hardcover
• Edition: 1st Edition
• Condition: Gut
• Seller catalogs:
  • Alle Bücher

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.