Efficient parallel recursion

  • Authors:
  • Per Brinch Hansen

  • Affiliations:
  • School of Computer and Information Science, Syracuse University, Syracuse, NY

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

A simple mechanism is proposed for dynamic memory allocation of a parallel recursive program with Algol-like scope rules. The method is about as fast as the traditional stack discipline for sequential languages. It has been used to implement the parallel programming language SuperPascal.