Partitioning Parallel Programs for Macro-Dataflow,

Abstract

Partitioning techniques are necessary to execute functional programs at a coarse granularity. Fine granularity execution is inefficient on general purpose multiprocessors. There is a trade off between parallelism and the overhead of exploiting parallelism. A compile time partitioning approach to achieve this trade-off is presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1986
Accession Number
ADA177774

Entities

People

  • John Hennessy
  • Vivek Sarkar

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computational Fluid Dynamics
  • Computations
  • Computer Programming
  • Computers
  • Computing System Architectures
  • Demographic Cohorts
  • Fluid Dynamics
  • Frequency
  • Hierarchies
  • Iterations
  • Language
  • Machine Languages
  • Models
  • Multiprocessors
  • Programming Languages
  • Recursive Functions

Fields of Study

  • Computer science

Readers

  • Parallel and Distributed Computing.