Hierarchical Concurrency in JadeDaniel
نویسندگان
چکیده
Jade is a data-oriented language for parallelizing programs written in a serial, imperative programming language such as C, FORTRAN, or C++. A Jade programmer simply augments the program with assertions specifying how the program accesses data. The Jade implementation dynamically interprets these assertions to execute the program concurrently while enforcing the program's data dependence constraints. In a previous paper 4], we show how programmers use Jade to express concurrency patterns such as dynamic task graphs and pipelining. In this paper, we show how Jade programmers can naturally express hierarchical concurrency patterns by specifying how a program uses hierarchically structured data.
منابع مشابه
A Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملWorking Paper Alfred P. Sloan School of Management Hierarchical Timestamping Algorithm Hierarchical Timestamping Algorithm Oct 2 1987 Received Hierarchical Timestamping Algorithm
The Hierarchical Timestamping Algorithm is proposed for handling database concurrency control. By analyzing transaction conflicts and partitioning the database into hierarchical partitions to which transactions will access discriminantly using different synchronization protocols, the algorithm can offer significant performance gain. It also reduces the need for transactions to leave traces (e.g...
متن کاملHierarchical finite state machines with multiple concurrency models
This paper studies the semantics of hierarchical finite state machines (FMS’s) that are composed using various concurrency models, particularly dataflow, discrete-events, and synchronous/reactive modeling. It is argued that all three combinations are useful, and that the concurrency model can be selected independently of the decision to use hierarchical FSM’s. In contrast, most formalisms that ...
متن کاملA Preliminary Study of Hierarchical Finite State Machines with Multiple Concurrency Models
This paper studies the semantics of hierarchical finite-state machines that are composed using various concurrency models, particularly dataflow, discrete-events, and synchronous/reactive modeling. It is argued that all three combinations are useful, and that therefore the concurrency model should be selected independently of the decision to use hierarchical FSMs. In contrast, most formalisms t...
متن کاملStatic Data ow and Heterochronous Data ow with Hierarchical FSMs in Ptolemy II
*charts is a formalism for combining nite state machines (FSMs) with various concurrent models of computation. In *charts, the emphasis is on separating the FSM semantics from the concurrency model semantics. Instead of de ning concurrency models, *charts shows how to combine hierarchical FSMs with various existing concurrency models. This paper discusses an implementation of a subset of the *c...
متن کامل