Linearizability - PDFSEARCH.IO - Document Search Engine

Linearizability
Results: 416

#	Item
221	Read-Copy-Update for HelenOS http://d3s.mff.cuni.cz Martin Děcký [removed] Add to Reading List Source URL: archive.fosdem.org Language: English - Date: 2014-10-24 07:45:52 System software HelenOS Lock Read-copy-update Synchronization Concurrent data structure Asynchrony Microkernel Linearizability Concurrency control Computer architecture Computing
222	Test-First Java Concurrency for the Classroom Mathias Ricken Robert Cartwright Dept. of Computer Science Add to Reading List Source URL: www.cs.rice.edu Language: English - Date: 2010-11-11 20:20:35 Thread Lock Monitor JUnit Java concurrency Java Memory Model Unit testing Readers–writer lock Linearizability Computing Concurrency control Software
223	Efficient code generation for weakly ordered architectures Reinoud Elhorst, Mark Batty, David Chisnall {re302,mjb220,dc552} @ cam.ac.uk Example: message passing Add to Reading List Source URL: llvm.org Language: English - Date: 2014-04-09 10:33:41 Concurrency control Computer memory Central processing unit MOV Linearizability X86 Instruction set Barrier DEC Alpha Computer architecture Computing Instruction set architectures
224	Software Systems: Dependable System Operation Making Operations Recoverable process-oriented approach Liming Zhu Add to Reading List Source URL: ssrg.nicta.com.au Language: English - Date: 2013-10-21 20:23:51 Idempotence Theoretical computer science Computing Linearizability Fail-fast Software engineering Mathematics Transaction processing Abstract algebra
225	Software Systems: Dependable System Operation Making Operations Recoverable process-oriented approach Liming Zhu Add to Reading List Source URL: www.ssrg.nicta.com.au Language: English - Date: 2013-10-21 20:23:51 Idempotence Theoretical computer science Computing Linearizability Fail-fast Software engineering Mathematics Transaction processing Abstract algebra
226	Deriving Linearizable Fine-Grained Concurrent Objects Martin Vechev Eran Yahav IBM Research Add to Reading List Source URL: www.srl.inf.ethz.ch Language: English - Date: 2011-10-04 10:24:16 Concurrency Linearizability Algorithm Tree traversal Mutual exclusion Non-blocking algorithm Concurrent data structure Parallel computing Priority queue Concurrency control Computing Data management
227	Automatic Inference of Memory Fences Michael Kuperstein Martin Vechev Eran Yahav Add to Reading List Source URL: www.srl.inf.ethz.ch Language: English - Date: 2011-10-04 10:23:08 Computer hardware Memory barrier Algorithm Memory ordering Linearizability Parallel computing Memory Fence Linear programming Computing Computer memory Computer architecture
228	Computer-Assisted Construction of Efficient Concurrent Algorithms Martin Vechev, Eran Yahav, Maged Michael, Hagit Attiya, Greta Yorsh Practical and efficient concurrent systems are notoriously hard to design, implement, Add to Reading List Source URL: www.srl.inf.ethz.ch Language: English - Date: 2011-10-04 10:24:04 Concurrency Theoretical computer science Computer programming Algorithm Mathematical logic Non-blocking algorithm Linearizability Concurrent data structure Actor model Computing Concurrency control Concurrent computing
229	Experience with Model Checking Linearizability Martin Vechev, Eran Yahav, and Greta Yorsh IBM T.J. Watson Research Center Non-blocking concurrent algorithms offer significant performance advantages, but are very difficul Add to Reading List Source URL: www.srl.inf.ethz.ch Language: English - Date: 2011-10-04 10:23:38 Transaction processing Dynamical systems Mathematics Concurrent data structure Linearization Algorithm Parallel computing Model checking Concurrency Concurrency control Computing Linearizability
230	CGCExplorer: A Semi-Automated Search Procedure for Provably Correct Concurrent Collectors Martin T. Vechev Cambridge University Eran Yahav Add to Reading List Source URL: www.srl.inf.ethz.ch Language: English - Date: 2011-10-04 10:24:18 Concurrency control Applied mathematics Garbage collection Linearizability Algorithm Mutator method Reference counting Lock Time complexity Computing Theoretical computer science Memory management

UPDATE