Sciweavers

271 search results - page 40 / 55
» Detecting Deadlocks in Concurrent Systems
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
Detecting and tolerating asymmetric races
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
Paruj Ratanaworabhan, Martin Burtscher, Darko Kiro...
VLDB
2007
ACM
128views Database» more  VLDB 2007»
14 years 8 months ago
Automating the Detection of Snapshot Isolation Anomalies
Snapshot isolation (SI) provides significantly improved concurrency over 2PL, allowing reads to be non-blocking. Unfortunately, it can also lead to non-serializable executions in ...
Sudhir Jorwekar, Alan Fekete, Krithi Ramamritham, ...
IPPS
2010
IEEE
13 years 5 months ago
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
Tarun Bansal, Neeraj Mittal
VTS
2005
IEEE
102views Hardware» more  VTS 2005»
14 years 1 months ago
Design of Adaptive Nanometer Digital Systems for Effective Control of Soft Error Tolerance
Nanometer circuits are highly susceptible to soft errors generated by alpha-particle or atmospheric neutron strikes to circuit nodes. The reasons for the high susceptibility are t...
Abdulkadir Utku Diril, Yuvraj Singh Dhillon, Abhij...
VEE
2006
ACM
102views Virtualization» more  VEE 2006»
14 years 1 months ago
A stackless runtime environment for a Pi-calculus
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
Frédéric Peschanski, Samuel Hym