Sciweavers

271 search results - page 28 / 55
» Detecting Deadlocks in Concurrent Systems
Sort
View
MICRO
2010
IEEE
170views Hardware» more  MICRO 2010»
15 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
PPOPP
2006
ACM
15 years 10 months ago
Exploiting distributed version concurrency in a transactional memory cluster
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
Kaloian Manassiev, Madalin Mihailescu, Cristiana A...
EUROPAR
2006
Springer
15 years 8 months ago
Toward a Definition of and Linguistic Support for Partial Quiescence
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
Billy Yan-Kit Man, Hiu Ning (Angela) Chan, Andrew ...
WETICE
2003
IEEE
15 years 9 months ago
Automatic synthesis of coordinators for COTS group-ware applications: an example
The coordination of concurrent activities in collaborative environments is a very important and difficult task. Many approaches for the construction of large-scale flexible grou...
Paola Inverardi, Massimo Tivoli, Antonio Bucchiaro...
ISCA
2007
IEEE
143views Hardware» more  ISCA 2007»
15 years 10 months ago
Performance pathologies in hardware transactional memory
Hardware Transactional Memory (HTM) systems reflect choices from three key design dimensions: conflict detection, version management, and conflict resolution. Previously propos...
Jayaram Bobba, Kevin E. Moore, Haris Volos, Luke Y...