4604 search results - page 96 / 921 » Concurrency in Synchronous Systems |
126
click to vote
ICDCN
2010
Springer
15 years 10 months ago
2010
Springer
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...
124
Voted
PPL
2007
15 years 3 months ago
2007
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...
150
Voted
SIGCSE
2002
ACM
15 years 3 months ago
2002
ACM
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...
156
Voted
PASTE
2010
ACM
15 years 7 months ago
2010
ACM
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...
156
Voted
IEEEPACT
2009
IEEE
15 years 1 months ago
2009
IEEE
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...