99 search results - page 1 / 20 » A Truly Concurrent Semantics for a Simple Parallel Programmi... |
CSL
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, parallelism and...
TCS
2002
13 years 3 months ago
2002
In this paper we study a process algebra whose semantics is based on true concurrency. In our model, actions are defined in terms of the resources they need to execute, which allo...
PLDI
2010
ACM
13 years 6 months ago
2010
ACM
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
Parallel pattern-matching (PPM) provides true commutative implementation of functions defined by cases in functional languages, because no argument is given precedence over any o...
APN
2001
Springer
13 years 8 months ago
2001
Springer