Mathematical foundations of parallel computing

書誌事項

Mathematical foundations of parallel computing

Valentin V. Voevodin

(Series in computer science, v. 33)

World Scientific, c1992

大学図書館所蔵 件 / 22

この図書・雑誌をさがす

注記

Bibliographical references: p. [333]-340

Includes index

内容説明・目次

内容説明

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.

目次

  • Algorithms and its graph
  • graph machine
  • algorithm execution time and its properties
  • high-speed algorithm implementations
  • algorithm and computer memory
  • algorithm graph and round-off errors
  • propagation of information in processes of algorithm implementations
  • algorithm graphs and sequential programmes
  • parallelizing of sequential programmes
  • parallel structure of algorithms
  • examples.

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

ページトップへ