Dataflow Computation for the J-Machine

Abstract

The dataflow model of computation exposes and exploits parallelism in programs without requiring programmer annotation; however, instruction-level dataflow is too fine-grained to be efficient on general-purpose processors. A popular solution is to develop a hybrid model of computation where regions of dataflow graphs are combined into sequential blocks of code. I have implemented such a system to allow the J-Machine to run Id programs, leaving exposed a high amount of parallelism - such as among loop iterations. I describe this system and provide an analysis of its strengths and weakness and those of the J- Machine, along with ideas for improvement. (Author) (kr)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1990
Accession Number
ADA228612

Entities

People

  • Ellen Spertus

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • C4I
  • Cyber
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Artificial Intelligence
  • Assembly
  • Computer Architecture
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Hybrid Systems
  • Instruction Set Architecture
  • Linguistics
  • Lisp Programming Language
  • Lists (Data Structures)
  • Machine Languages
  • Parallel Computing
  • Parallel Processing
  • Programming Languages
  • Simulators

Readers

  • Parallel and Distributed Computing.