2875 search results - page 435 / 575 » Distributed Reactive Machines |
148
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
136
click to vote
ESCIENCE
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
139
click to vote
HIPC
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Simple and unified non-operational specifications of the three memory consistency models Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Orde...
137
click to vote
ISHPC
2000
Springer
15 years 7 months ago
2000
Springer
Traditional parallel compilers do not effectively parallelize irregular applications because they contain little looplevel parallelism due to ambiguous memory references. We explo...
143
click to vote
LCPC
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Processing and analyzing large volumes of data plays an increasingly important role in many domains of scienti c research. We are developing a compiler which processes da...