11 search results - page 1 / 3 » Failure-Sensitive Analysis of Parallel Algorithms with Contr... |
PPL
2007
13 years 4 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...
LCPC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
WOSP
2010
ACM
13 years 11 months ago
2010
ACM
Nowadays the 2-Phase-Locking (2PL) concurrency control algorithm still plays a core rule in the construction of transactional systems (e.g. database systems and transactional memo...
HIPC
2009
Springer
13 years 2 months ago
2009
Springer
Software transactional memory (STM) is an emerging concurrency control mechanism for shared memory accesses. Early abort is one of the important techniques to improve the executio...
IFIP
2010
Springer
12 years 11 months ago
2010
Springer
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...