In this paper we present a generalized forall statement for parallel languages. The forall statement occurs in many (data) parallel languages and specifies which computations can...
Paul Dechering, Leo C. Breebaart, Frits Kuijlman, ...
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
An object-oriented (OO) model has a static component, the set of allowable snapshots or system states, and a dynamic component, the set of filmstrips or sequences of snapshots. Dia...
Stuart Kent, Ali Hamie, John Howse, Franco Civello...
We investigate the semantics for Knowledge Query Manipulation Language KQML and we propose a semantic framework for the language. KQML is a language and a protocol to support comm...