Skip to main content
SpringerLink
Log in

Memory Storage Patterns in Parallel Processing

  • Book
  • © 1987

Overview

Authors:
  1. Mary E. Mace

    1. IBM Corporation, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. Introduction

    • Mary E. Mace
    Pages 1-11

  3. Solution for Graphs without Shared Nodes

    • Mary E. Mace
    Pages 13-27

  4. Solution for Graphs with Shared Nodes

    • Mary E. Mace
    Pages 29-36

  5. Illustration of Collapsible Graph Algorithm

    • Mary E. Mace
    Pages 37-52

  6. Shapes Problem Complexity Issues

    • Mary E. Mace
    Pages 53-79

  7. Shapes Solution for Jacobi Iteration

    • Mary E. Mace
    Pages 81-102

  8. Back Matter

    Pages 103-139
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • IBM Corporation, USA

    Mary E. Mace

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation