A Parallelizing Compiler Based on Partial Evaluation

Abstract

This thesis demonstrates a compiler that uses partial evaluation to achieve outstandingly efficient parallel object code from very high-level source programs. The source programs are ordinary Scheme numerical programs, written abstractly, with no attempt to structure them for parallel execution. The compiler identifies and extracts parallelism completely automatically; nevertheless, it achieved by speed-ups equivalent to or better than the best observed results achieved by previous supercomputer compilers that require manual restructing of code.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1993
Accession Number
ADA270838

Entities

People

  • Rajeev Surati

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Artificial Intelligence
  • Celestial Mechanics
  • Compilers
  • Computer Program Documentation
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Instructions
  • Machines
  • Multiprocessors
  • N Body Problem
  • Object Code
  • Operating Systems
  • Scheduling (Production)
  • Test And Evaluation

Fields of Study

  • Computer science

Readers

  • Computer Science.
  • Parallel and Distributed Computing.