Loading...
Please wait, while we are loading the content...
Similar Documents
Semantics of Barriers in a Non-Strict, Implicitly-Parallel Language (1995)
| Content Provider | CiteSeerX |
|---|---|
| Author | Aditya, Shail Arvind Stoy, Joseph E. |
| Description | Barriers in parallel languages may be used to schedule parallel activities, control memory usage and ensure proper sequentialization of side-effects. In this paper, we present operational semantics of barriers in Id and pH, which are non-strict, implicitly-parallel, functional languages extended with side-effects. The semantics are presented as a translation from a source language with barriers into a kernel language without barriers where the termination properties of an expression are represented explicitly as signals using a weak head-normal form operator (W) and controlled via a strict application operator (Sap). We present two versions of the semantics -- the first uses purely data-driven, eager evaluation and the second mixes eager evaluation with a demand-driven identifier reference mechanism. We compare and contrast the two for their ability to do resource management and preserve useful semantic properties. |
| File Format | |
| Language | English |
| Publisher Date | 1995-01-01 |
| Publisher Institution | IN FUNCTIONAL PROGRAMMING AND COMPUTER ARCHITECTURE |
| Access Restriction | Open |
| Subject Keyword | Demand-driven Identifier Reference Mechanism Strict Application Operator Useful Semantic Property Functional Language Source Language Proper Sequentialization Operational Semantics Parallel Language Weak Head-normal Form Operator Parallel Activity Eager Evaluation Implicitly-parallel Language Control Memory Usage Kernel Language Termination Property Second Mix Eager Evaluation |
| Content Type | Text |
| Resource Type | Article |
