Sciweavers

4604 search results - page 96 / 921
» Concurrency in Synchronous Systems
Sort
View
ICDCN
2010
Springer
15 years 4 months ago
A Leader-Free Byzantine Consensus Algorithm
The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorit...
Fatemeh Borran, André Schiper
PPL
2007
86views more  PPL 2007»
14 years 9 months ago
Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
Chryssis Georgiou, Alexander Russell, Alexander A....
SIGCSE
2002
ACM
153views Education» more  SIGCSE 2002»
14 years 9 months ago
A communication library to support concurrent programming courses
A number of communication libraries have been written to support concurrent programming. For a variety of reasons, these libraries generally are not well-suited for use in undergr...
Steve Carr, Changpeng Fang, Tim Jozwowski, Jean Ma...
PASTE
2010
ACM
15 years 1 months ago
The RoadRunner dynamic analysis framework for concurrent programs
ROADRUNNER is a dynamic analysis framework designed to facilitate rapid prototyping and experimentation with dynamic analyses for concurrent Java programs. It provides a clean API...
Cormac Flanagan, Stephen N. Freund
IEEEPACT
2009
IEEE
14 years 7 months ago
Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
Takayuki Usui, Reimer Behrends, Jacob Evans, Yanni...