Cantitate/Preț
Produs

Memory Storage Patterns in Parallel Processing: The Springer International Series in Engineering and Computer Science, cartea 30

Autor Mary E. Mace
en Limba Engleză Paperback – 22 dec 2011
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.
Citește tot Restrânge

Din seria The Springer International Series in Engineering and Computer Science

Preț: 32548 lei

Preț vechi: 40684 lei
-20% Nou

Puncte Express: 488

Preț estimativ în valută:
6229 6463$ 5206£

Carte tipărită la comandă

Livrare economică 18 martie-01 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781461291947
ISBN-10: 1461291941
Pagini: 156
Ilustrații: 160 p.
Dimensiuni: 155 x 235 x 8 mm
Greutate: 0.23 kg
Ediția:Softcover reprint of the original 1st ed. 1987
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

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.