Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,204
Lock-free Dynamically Resizable Arrays
"... Abstract. We present a first lock-free design and practical implementation of a dynamically resizable array (vector). The most extensively used container in the C++ Standard Library is vector, offering a combination of dynamic memory management and efficient random access. Our approach is based on a ..."
Abstract
-
Cited by 12 (8 self)
- Add to MetaCart
on a single 32-bit word atomic compare-and-swap (CAS) instruction and our implementation is portable to all systems supporting CAS, and more. It provides a flexible, generic, linearizable and highly parallelizable STL like interface, effective lock-free memory allocation and management, and fast
Software Transactional Memory
, 1995
"... As we learn from the literature, flexibility in choosing synchronization operations greatly simplifies the task of designing highly concurrent programs. Unfortunately, existing hardware is inflexible and is at best on the level of a Load Linked/Store Conditional operation on a single word. Building ..."
Abstract
-
Cited by 695 (14 self)
- Add to MetaCart
Load Linked/Store Conditional operation. We use STM to provide a general highly concurrent method for translating sequential object implementations to lock-free ones based on implementing a k-word compare&swap STM-transaction. Empirical evidence collected on simulated multiprocessor architectures
A Practical Wait-Free Multi-Word Compare-and-Swap Operation
"... Algorithms designed for current and future multi-core sys-tems, which are expected to experience an increase of the number of cores by 100x over the next decade, must ex-hibit strong scaling. The guarantee of progress provided by wait-free algorithms and the fine-grained synchroniza-tion methods use ..."
Abstract
- Add to MetaCart
if interrupts consistently cause a thread to retry a portion of its operation. Our design is practical in that it is built from only portable atomic operations (e.g. atomic reads, atomic writes, compare-and-swap), it is efficient in its utilization of memory (i. e. requiring only a single bit to be reserved
A Practical Multi-Word Compare-and-Swap Operation
- In Proceedings of the 16th International Symposium on Distributed Computing
, 2002
"... Work on non-blocking data structures has proposed extending processor designs with a compare-and-swap primitive, CAS2, which acts on two arbitrary memory locations. Experience suggested that current operations, typically single-word compare-and-swap (CAS1), are not expressive enough to be used alone ..."
Abstract
-
Cited by 88 (6 self)
- Add to MetaCart
Work on non-blocking data structures has proposed extending processor designs with a compare-and-swap primitive, CAS2, which acts on two arbitrary memory locations. Experience suggested that current operations, typically single-word compare-and-swap (CAS1), are not expressive enough to be used
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap
, 2005
"... We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are available in modern computer systems. Previously known lock-free algorithms of deques are either based on non-available atomic syn ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
synchronization primitives, only implement a subset of the functionality, or are not designed for disjoint accesses. Our algorithm is based on a general lock-free doubly linked list, and only requires single-word compare-and-swap atomic primitives. It also allows pointers with full precision, and thus supports
Technical Report no. 2004-02 Lock-Free and Practical Deques using Single-Word Compare-And-Swap
"... We present an efficient and practical lock-free implementation of a concurrent deque that is disjoint-parallel accessible and uses atomic primitives which are available in modern computer systems. Previously known lock-free algorithms of deques are either based on non-available atomic synchronizatio ..."
Abstract
- Add to MetaCart
synchronization primitives, only implement a subset of the functionality, or are not designed for disjoint accesses. Our algorithm is based on a doubly linked list, and only requires single-word compare-and-swap atomic primitives, even for dynamic memory sizes. We have performed an empirical study using full
Lock-Free Linked Lists Using Compare-and-Swap
- In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing
, 1995
"... Lock-free data structures implement concurrent objects without the use of mutual exclusion. This approach can avoid performance problems due to unpredictable delays while processes are within critical sections. Although universal methods are known that give lock-free data structures for any abstract ..."
Abstract
-
Cited by 108 (1 self)
- Add to MetaCart
by any number of processes. We also show how the basic data structure can be used as a building block for other lock-free data structures. Our algorithms use the single word Compare-and-Swap synchronization primitive to implement the linked list directly, avoiding the overhead of universal methods
Fast, Reactive and Lock-free Multi-Word Compare-and-Swap Algorithms
, 2003
"... Shared memory multiprocessors typically provide a set of single-word compare-and-swap-like hardware primitives to support synchronization. Although these are conceptually powerful enough to support higher-level synchronization, from the programmer's point of view they are not as useful as their ..."
Abstract
- Add to MetaCart
Shared memory multiprocessors typically provide a set of single-word compare-and-swap-like hardware primitives to support synchronization. Although these are conceptually powerful enough to support higher-level synchronization, from the programmer's point of view they are not as useful
Technical Report no. 2003-06 Fast, Reactive and Lock-free Multi-word Compare-and-swap Algorithms
"... Shared memory multiprocessors typically provide a set of single-word compare-and-swap-like hardware primitives to support synchronization. Although these are conceptually powerful enough to support higher-level synchronization, from the programmer’s point of view they are not as useful as their gene ..."
Abstract
- Add to MetaCart
Shared memory multiprocessors typically provide a set of single-word compare-and-swap-like hardware primitives to support synchronization. Although these are conceptually powerful enough to support higher-level synchronization, from the programmer’s point of view they are not as useful
Back to the future: The story of Squeak, A practical Smalltalk written in itself
- In Proceedings OOPSLA ’97, ACM SIGPLAN Notices
, 1997
"... Squeak is an open, highly-portable Smalltalk implementation whose virtual machine is written entirely in Smalltalk, making it easy to debug, analyze, and change. To achieve practical performance, a translator produces an equivalent C program whose performance is comparable to commercial Smalltalks. ..."
Abstract
-
Cited by 209 (4 self)
- Add to MetaCart
. Other noteworthy aspects of Squeak include: a compact object format that typically requires only a single word of overhead per object; a simple yet efficient incremental garbage collector for 32-bit direct pointers; efficient bulkmutation of objects; extensions of BitBlt to handle color of any depth
Results 1 - 10
of
1,204
