Two PARALLEL EULER run time models: The dangling reference, impostor environment, and label problems

  • Authors:
  • L. M. Chirica;D. F. Martin;T. A. Dreisbach;J. G. Peetz;A. Sorkin

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • HLLCA '73 Proceedings of the ACM-IEEE symposium on High-level-language computer architecture
  • Year:
  • 1973

Quantified Score

Hi-index 0.00

Visualization

Abstract

The purpose of this paper is to present and discuss two implementations of an extension, to support parallel computation, of the programming language EULER [WW66]. The run time environments of these two implementations are based, respectively, on the deletion and retention storage management policies [Be71b]. In addition to the effect of adding parallel computation, some of the more interesting conceptual and implementation problems associated with block-structured high level programming languages arise when the assignment as values of labels, references (pointers), and procedure descriptors is permitted. In particular, the choice of storage management policy significantly affects the correctness of implementation. Some of these problems are discussed in this paper. The basic mode of exposition centers around the EULER programming language and machine, chosen for their use of well-understood basic principles and their widely available, concise (if not always well explained), and reasonably precise definition. Familiarity with the principles of ALGOL 60 implementation [RR64], EULER [WW66], and the contour model of block-structured processes [Jo71] is assumed.