Sciweavers

5180 search results - page 293 / 1036
» Concurrency, Time, and Constraints
Sort
View
DPD
2002
97views more  DPD 2002»
15 years 6 months ago
Dictatorial Transaction Processing: Atomic Commitment Without Veto Right
The current standard in governing distributed transaction termination is the so-called Two-Phase Commit protocol (2PC). The first phase of 2PC is a voting phase, where the partici...
Maha Abdallah, Rachid Guerraoui, Philippe Pucheral
PPOPP
2012
ACM
14 years 2 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
COCOON
2005
Springer
16 years 8 days ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 11 months ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah
ASPLOS
2009
ACM
16 years 7 months ago
CTrigger: exposing atomicity violation bugs from their hiding places
Multicore hardware is making concurrent programs pervasive. Unfortunately, concurrent programs are prone to bugs. Among different types of concurrency bugs, atomicity violation bu...
Soyeon Park, Shan Lu, Yuanyuan Zhou