Compare-and-swap - PDFSEARCH.IO - Document Search Engine

Compare-and-swap
Results: 56

#	Item
31	Fast Dual Ring Queues⇤ Joseph Izraelevitz Michael L. Scott Technical Report #990 Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2014-02-06 16:32:38 Concurrent computing Computer programming Queue Double-ended queue FIFO Circular buffer Linked list Compare-and-swap Non-blocking algorithm Abstract data types Concurrency control Computing
32	Tech. Rep. 599, Computer Science Dept., Univ. of Rochester Correction of a Memory Management Method for Lock-Free Data Structures Maged M. Michael Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2011-03-27 19:46:57 Software engineering Mutual exclusion Compare-and-swap Linked list Pointer Non-blocking algorithm ABA problem Stack Linearizability Concurrency control Computing Computer programming
33	Algorithms for scalable synchronization on shared-memory multiprocessors Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2006-09-23 12:40:39 Concurrency Spinlock Parallel computing Lock Compare-and-swap Test-and-set Busy waiting Fetch-and-add Linearizability Concurrency control Computing Computer programming
34	Non-Blocking Timeout in Scalable Queue-Based Spin Locks Michael L. Scott ∗ Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2002-04-30 11:21:59 Concurrency Mutual exclusion Spinlock Lock Scheduling Compare-and-swap ABA problem Linearizability Linked list Concurrency control Computing Computer programming
35	Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory M ultiprocessorsl Maged M. ~ i c h a e l and Michael L. Scott Department of Computer Science, University of Rochester, Rochester, New Y Add to Reading List Source URL: www.cs.rochester.edu Language: English* - Date: 2004-06-20 01:33:17 Data management Concurrency Compare-and-swap Mutual exclusion Non-blocking algorithm Linked list Queue Ticket lock Stack Concurrency control Abstract data types Computing
36	Using LLSC to Simplify WSTM-1.ppt Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2011-04-14 21:37:12 Software engineering Data Transactional memory Load-link/store-conditional Compare-and-swap Software transactional memory Linearizability Lock Concurrency control Transaction processing Computing
37	Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms Maged M. Michael Michael L. Scott Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2008-01-30 21:42:09 Concurrent computing Concurrency Scheduling algorithms Mutual exclusion Compare-and-swap Linked list Non-blocking algorithm FIFO Queue Concurrency control Computing Abstract data types
38	Scalable Queue-Based Spin Locks with Timeout Michael L. Scott and William N. Scherer III Department of Computer Science University of Rochester Rochester, NY[removed] {scott,scherer}@cs.rochester.edu∗ Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2001-05-18 16:44:10 Data management Spinlock Compare-and-swap Test-and-set Lock Mutual exclusion Linearizability Non-blocking algorithm Busy waiting Concurrency control Computing Concurrency
39	1 MANAGING LONG LINKED LISTS USING LOCK FREE TECHNIQUES Mohammad Farook and Peter Graham Add to Reading List Source URL: www.cs.umanitoba.ca Language: English - Date: 2001-05-23 21:43:32 Computer programming Linked list Compare-and-swap Double compare-and-swap Non-blocking algorithm Tree traversal Tree Node Pointer Concurrency control Computing Data management
40	Cherry Avenue Auction Swap Meet Shopping Tips 1. Arrive early. When you arrive early you can take full benefit of the larger selections. Arriving early also gives you more time to look around and compare prices and items Add to Reading List Source URL: www.cherryavenueauction.com Language: English - Date: 2014-02-20 18:34:02 Retailing Consumer behaviour Shopping