1491 search results - page 158 / 299 » Resource-Passing Concurrent Programming |
136
Voted
SIGADA
1999
Springer
15 years 7 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
129
Voted
CCGRID
2010
IEEE
15 years 6 days ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
119
click to vote
PLDI
2011
ACM
14 years 5 months ago
2011
ACM
Fixing software bugs has always been an important and timeconsuming process in software development. Fixing concurrency bugs has become especially critical in the multicore era. H...
137
Voted
PPOPP
2012
ACM
13 years 10 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
162
Voted
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...