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 ...
Read More
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.
Read Less
Add this copy of Memory Storage Patterns in Parallel Processing to cart. $60.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2011 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Trade paperback (US). Glued binding. 160 p. Contains: Unspecified. The Springer International Engineering and Computer Science, 30.
Add this copy of Memory Storage Patterns in Parallel Processing to cart. $61.22, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2011 by Springer.
