Memory Storage Patterns in Parallel Processing

Author:   Mary E. Mace
Publisher:   Kluwer Academic Publishers
Edition:   1987 ed.
Volume:   30
ISBN:  

9780898382396


Pages:   160
Publication Date:   30 September 1987
Format:   Hardback
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Our Price $97.68 Quantity:  
Add to Cart

Share |

Memory Storage Patterns in Parallel Processing


Add your own review!

Overview

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.

Full Product Details

Author:   Mary E. Mace
Publisher:   Kluwer Academic Publishers
Imprint:   Kluwer Academic Publishers
Edition:   1987 ed.
Volume:   30
Weight:   0.440kg
ISBN:  

9780898382396


ISBN 10:   0898382394
Pages:   160
Publication Date:   30 September 1987
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List