1204 search results - page 46 / 241 » Parallel concurrent ML |
165
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
137
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...
114
Voted
CONCUR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
133
click to vote
ENTCS
2007
15 years 4 months ago
2007
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel ...
122
click to vote
JLP
2000
15 years 4 months ago
2000
interpretation. In the context of stream parallelism, this analysis identi es an amount of input data for which predicate execution can safely wait without danger of introducing de...