Sciweavers

84 search results - page 9 / 17
» Nonblocking Concurrent Data Structures with Condition Synchr...
Sort
View
SPAA
1990
ACM
13 years 11 months ago
Wait-Free Data Structures in the Asynchronous PRAM Model
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
James Aspnes, Maurice Herlihy
ICDE
2007
IEEE
193views Database» more  ICDE 2007»
14 years 8 months ago
Categorization and Optimization of Synchronization Dependencies in Business Processes
requirement. Furthermore, programming using sequence constructs normally produce nested structures and The current approachfor modeling synchronization in scattered code, especiall...
Qinyi Wu, Calton Pu, Akhil Sahai, Roger S. Barga
POPL
2006
ACM
14 years 7 months ago
Autolocker: synchronization inference for atomic sections
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
Bill McCloskey, Feng Zhou, David Gay, Eric A. Brew...
NCA
2007
IEEE
14 years 1 months ago
Improving Network Processing Concurrency using TCPServers
Exponentially growing bandwidth requirements and slowing gains in processor speeds have led to the popularity of multiprocessor architectures. Network stack parallelism is increas...
Aniruddha Bohra, Liviu Iftode
SIROCCO
2008
13 years 8 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau