Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Memory Storage Patterns in Parallel Processing - Mary E. Mace

Memory Storage Patterns in Parallel Processing

(Autor)

Buch | Hardcover
160 Seiten
1987
Kluwer Academic Publishers (Verlag)
978-0-89838-239-6 (ISBN)
CHF 119,75 inkl. MwSt
  • Titel z.Zt. nicht lieferbar
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
For example, for certain architectures and certain operations, large improvements in performance can be attained by storing a matrix in row major order. A determination must be made whether or not it is the best solution globally to store the matrix in row order, column order, or even have two copies of it, each organized differently.
This project had its beginnings in the Fall of 1980. At that time Robert Wagner suggested that I investigate compiler optimi­ zation of data organization, suitable for use in a parallel or vector machine environment. We developed a scheme in which the compiler, having knowledge of the machine's access patterns, does a global analysis of a program's operations, and automatically determines optimum organization for the data. For example, for certain architectures and certain operations, large improvements in performance can be attained by storing a matrix in row major order. However a subsequent operation may require the matrix in column major order. A determination must be made whether or not it is the best solution globally to store the matrix in row order, column order, or even have two copies of it, each organized differently. We have developed two algorithms for making this determination. The technique shows promise in a vector machine environ­ ment, particularly if memory interleaving is used. Supercomputers such as the Cray, the CDC Cyber 205, the IBM 3090, as well as superminis such as the Convex are possible environments for implementation.

1 Introduction.- 2 Solution For Graphs Without Shared Nodes.- 3 Solution For Graphs With Shared Nodes.- 4 Illustration of Collapsible Graph Algorithm.- 5 Shapes Problem Complexity Issues.- 6 Shapes Solution for Jacobi Iteration.- Appendices:.- A Definition of Collapsible Graphs.- B Restriction 1.- C Properties of Collapsible Graph Transformations.- D Equivalence of a, b, c to A, B.- E Time Bounds of Collapsible Graph Algorithm.- F Cost Function for Shared Nodes.- References.

Reihe/Serie The Springer International Series in Engineering and Computer Science ; 30
Zusatzinfo 160 p.
Sprache englisch
Themenwelt Mathematik / Informatik Informatik Datenbanken
Informatik Theorie / Studium Künstliche Intelligenz / Robotik
Technik Elektrotechnik / Energietechnik
ISBN-10 0-89838-239-4 / 0898382394
ISBN-13 978-0-89838-239-6 / 9780898382396
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Eine kurze Geschichte der Informationsnetzwerke von der Steinzeit bis …

von Yuval Noah Harari

Buch | Hardcover (2024)
Penguin (Verlag)
CHF 39,20