Sciweavers

24 search results - page 1 / 5
» Tolerating Concurrency Bugs Using Transactions as Lifeguards
Sort
View
MICRO
2010
IEEE
170views Hardware» more  MICRO 2010»
13 years 2 months ago
Tolerating Concurrency Bugs Using Transactions as Lifeguards
Abstract--Parallel programming is hard, because it is impractical to test all possible thread interleavings. One promising approach to improve a multi-threaded program's relia...
Jie Yu, Satish Narayanasamy
ASPLOS
2012
ACM
12 years 6 days ago
Applying transactional memory to concurrency bugs
Multithreaded programs often suffer from synchronization bugs such as atomicity violations and deadlocks. These bugs arise from complicated locking strategies and ad hoc synchroni...
Haris Volos, Andres Jaan Tack, Michael M. Swift, S...
ASPLOS
2008
ACM
13 years 6 months ago
Learning from mistakes: a comprehensive study on real world concurrency bug characteristics
The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Addressing this challenge requires adva...
Shan Lu, Soyeon Park, Eunsoo Seo, Yuanyuan Zhou
SOSP
2007
ACM
14 years 1 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
ASPLOS
2006
ACM
13 years 10 months ago
AVIO: detecting atomicity violations via access interleaving invariants
Concurrency bugs are among the most difficult to test and diagnose of all software bugs. The multicore technology trend worsens this problem. Most previous concurrency bug detect...
Shan Lu, Joseph Tucek, Feng Qin, Yuanyuan Zhou