First Page | Document Content | |
---|---|---|
![]() Date: 2011-08-30 18:02:32Concurrent computing Read-copy-update Readers–writer lock Lock ABA problem Non-blocking algorithm Critical section Memory barrier Thread Concurrency control Computing Concurrency | Add to Reading List |
![]() | Verifying Read-Copy-Update in a Logic for Weak Memory Joseph Tassarotti Derek Dreyer Viktor VafeiadisDocID: 1uNqb - View Document |
![]() | Verifying Read-Copy-Update in a Logic for Weak Memory Joseph Tassarotti Derek Dreyer Viktor VafeiadisDocID: 1o283 - View Document |
![]() | Verifying Read-Copy-Update in a Logic for Weak Memory Joseph Tassarotti Derek Dreyer Viktor VafeiadisDocID: 1mToP - View Document |
![]() | User-Level Implementations of Read-Copy UpdateDocID: 1moh7 - View Document |
![]() | Read-Copy-Update { Wait-free synchronization for the kernelDocID: 1efS3 - View Document |