Crystal: from functional description to efficient parallel code

  • Authors:
  • M. Chen;Y. Choo;J. Li

  • Affiliations:
  • Department of Computer Science, Yale University, New Haven, CT;Department of Computer Science, Yale University, New Haven, CT;Department of Computer Science, Yale University, New Haven, CT

  • Venue:
  • C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes how Crystal—a language based on familiar mathematical notation and the lambda calculus—addresses the issues of programmability and performance for parallel machines. What is new about Crystal (or how it is different from existing functional languages) lies in its model of parallel computation and a theory of parallel-program optimization based upon the model. We illustrate the power of our approach with benchmarks of compiled parallel code from the Crystal source. The target machines are hypercube multiprocessors with distributed memory, on which it is considered difficult for functional programs and parallelizing compilers to achieve high efficiency.