73 search results - page 4 / 15 » Constraint-Based Concurrency and Beyond |
108
Voted
PODC
2010
ACM
15 years 1 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 ...
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
In a synchronous queue, producers and consumers handshake to exchange data. Recently, new scalable unfair synchronous queues were added to the Java JDK 6.0 to support high performa...
69
Voted
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
SIGADA
2005
Springer
15 years 3 months ago
2005
Springer
One of the most important object-oriented features of the new revision of the Ada Programming Language is the introof Abstract Interfaces to provide a form of multiple nce. Ada 20...
JOC
2008
14 years 9 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...