Muutke küpsiste eelistusi

Multiprocessing: Trade-Offs in Computation and Communication 1993 ed. [Kõva köide]

  • Kõva köide
  • Hind: 95,02 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 111,79 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Presents an analysis of several commonly observed regular and irregular computations for multiprocessor systems. Techniques are included which enable researchers and application developers to quantitatively determine the effects of algorithm data dependencies on execution time, on communication requirements, on processor utilization and on the speedups possible. Starting with simple two dimensional diamond shaped directed graphs, the analysis is extended to more complex and higher dimensional directed acyclic graphs. Annotation copyright Book News, Inc. Portland, Or.

Multiprocessing: Trade-Offs in Computation and Communication presents an in-depth analysis of several commonly observed regular and irregular computations for multiprocessor systems. This book includes techniques which enable researchers and application developers to quantitatively determine the effects of algorithm data dependencies on execution time, on communication requirements, on processor utilization and on the speedups possible.
Starting with simple, two-dimensional, diamond-shaped directed acyclic graphs, the analysis is extended to more complex and higher dimensional directed acyclic graphs. The analysis allows for the quantification of the computation and communication costs and their interdependencies. The practical significance of these results on the performance of various data distribution schemes is clearly explained. Using these results, the performance of the parallel computations are formulated in an architecture independent fashion. These formulations allow for the parameterization of the architecture specitific entities such as the computation and communication rates. This type of parameterized performance analysis can be used at compile time or at run-time so as to achieve the most optimal distribution of the computations.
The material in Multiprocessing: Trade-Offs in Computation and Communication connects theory with practice, so that the inherent performance limitations in many computations can be understood, and practical methods can be devised that would assist in the development of software for scalable high performance systems.

Muu info

Springer Book Archives
1 Introduction.- 1.1 Parallel computing and communication.- 1.2 Scope of
this work.- 1.3 Organization.- 1.4 Model of computation.- 1.5 Graph-theoretic
definitions.- 1.6 Basic terminology.- 2 Diamond Dags.- 2.1 Communication
requirements of a DAG.- 2.2 The diamond dag.- 2.3 Diamond dags with higher
degree vertices.- 2.4 Effects of the tradeoff on performance.- 2.5 Concluding
remarks.- 3 Rectangular Dags.- 3.1 The rectangular dag.- 3.2 Lower bound on
computation time.- 3.3 Lower bound on data traffic.- 3.4 Lower bound on t
?.- 3.5 The tradeoff factor for the rectangular dag.- 3.6 Performance
considerations.- 3.7 Concluding remarks.- 4 Three and Higher Dimensional
Dags.- 4.1 An n X n X n dag.- 4.2 A ddimensional dag.- 4.3 The effects of
tradeoff on performance.- 4.4 Concluding remarks.- 5 Factoring Dense and
Sparse Matrices.- 5.1 Dense symmetric positive definite systems.- 5.2 Sparse,
symmetric positive definite systems.- 5.3 Concluding remarks.- 6 Conclusions
and Some Open Issues.- 6.1 Summary of principal results.- 6.2 Suggestions for
further research.