Parallelism and Representation Problems in Distributed Systems

  • Authors:
  • M. J. Flynn;J. L. Hennessy

  • Affiliations:
  • Computer Systems Laboratory, Stanford University;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1980

Quantified Score

Hi-index 14.98

Visualization

Abstract

A hierarchical view of program representation is used to explain the problems of matching various representations to underlying distributed architectures. If a program is to effectively use a distributed computer system, it is necessary to represent and detect a high degree of parallelism. Methods of detecting such parallelism and their limitations are discussed. The actual machine level representation of a high-level language program also affects the ability to achieve a good match between the computer system resources and the program. The concept of an ideal machine for the program leads naturally to a representation employing a directly executed language. The initial program representation profoundly influences the possibility of obtaining a good representation at other levels of the hierarchy. A poor initial language representation leads to unnecessary architectural contraints or insufficient information to efficiently execute a program. The issue of suitable initial representation for distributed hardware is approached employing a functional language basis.