Research Directions in High-Level Parallel Programming Languages: Mont Saint-Michel, France, June 17-19, 1991 Proceedings / Edition 1

by Jean Pierre Banatre, Daniel Le Metayer

Overview

This volume contains most of the papers presented at the workshop on research directions in high-level parallel programming languages, held at Mont Saint-Michel, France, in June 1991. The motivation for organizing this workshop came from the emergence of a new class of formalisms for describing parallel computations in the last few years. Linda, Unity, Gamma, and the Cham are the most significant representatives of this new class. Formalisms of this family promote simple but powerful language features for describing data and programs. These proposals appeared in different contexts and were applied in different domains, and the goal of the workshop was to review the status of this new field and compare experiences. The workshop was organized into four main sessions: Unity, Linda, Gamma, and Parallel Program Design. The corresponding parts of the volume are introduced respectively by J. Misra, D. Gelernter, D. Le Mtayer, and J.-P. Ban tre.

Product Details

ISBN-13:	9783540551607
Publisher:	Springer Berlin Heidelberg
Publication date:	02/27/1992
Series:	Lecture Notes in Computer Science , #574
Edition description:	1992
Pages:	392
Product dimensions:	6.69(w) x 9.84(h) x 0.03(d)

Table of Contents

A perspective on parallel program design.- UNITY to UC: A case study in the derivation of parallel programs.- Reasoning about synchronic groups.- An industrial experience in the use of UNITY.- On the UNITY design decisions.- Flexible program structures for concurrent programming.- Current research on Linda.- Expressing fine-grained parallelism using concurrent data structures.- Persistent Linda: Linda + transactions + query processing.- Parallel logic programming using the Linda model of computation.- Lucinda — A polymorphic Linda.- A rationale for programming with Ease.- Intermediate uniformly distributed tuple space on transputer meshes.- Mixing concurrency abstractions and classes.- Coordination applications of Linda.- The chemical reaction model.- to Gamma.- Parallel programming with bags.- Implementation of Gamma on the connection machine.- Parallel programming with pure functional languages.- Parallel programming in maude.- Parallel program design.- The palindrome systolic arrayrevisited.- The synthesis of systolic programs.- Synthesizing delay insensitive circuits from verified programs.- A distributed implementation of a task pool.- Invariance and contraction by infinite iterations of relations.- Constructing a parallel sort program on hypercube by using Distributively Callable Procedures.