Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,095
Multiword Atomic Read/Write Registers on Multiprocessor Systems
"... Modern multiprocessor systems offer advanced synchronization primitives, built in hardware, to support the development of efficient parallel algorithms. In this article, we develop a simple and efficient algorithm, the READERSFIELD algorithm, for atomic registers (variables) of arbitrary length. The ..."
Abstract
- Add to MetaCart
only on read and write primitives. The experimental evaluation is performed on three well-known parallel architectures. This evaluation clearly shows that both algorithms are practical and that as the size of the register increases the READERSFIELD algorithm performs better, following its analytical
Fault-tolerant semifast implementations for atomic read/write registers
, 2005
"... This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple readers, and S servers, such that the writer, any subset of the readers, and up ..."
Abstract
-
Cited by 14 (4 self)
- Add to MetaCart
This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple readers, and S servers, such that the writer, any subset of the readers, and up
Wait-Free Synchronization
- ACM Transactions on Programming Languages and Systems
, 1993
"... A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one data object from another lie ..."
Abstract
-
Cited by 851 (28 self)
- Add to MetaCart
;there is no wait-free implementation of X by Y ." We derive a hierarchy of objects such that no object at one level has a wait-free implementation in terms of objects at lower levels. In particular, we show that atomic read/write registers, which have been the focus of much recent attention
Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers ∗
, 2008
"... This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple readers, and S servers, such that the writer, any subset of the readers, and up ..."
Abstract
- Add to MetaCart
This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple readers, and S servers, such that the writer, any subset of the readers, and up
ANALYZING THE NUMBER OF SLOW READS FOR SEMIFAST ATOMIC READ/WRITE REGISTER IMPLEMENTATIONS
"... Developing fast implementations of atomic read/write reg-isters in the message passing model is among the funda-mental problems in distributed computing. Typical imple-mentations require two communication round trips for read and write operations. Dutta et al. [4] developed the first fast single wri ..."
Abstract
- Add to MetaCart
Developing fast implementations of atomic read/write reg-isters in the message passing model is among the funda-mental problems in distributed computing. Typical imple-mentations require two communication round trips for read and write operations. Dutta et al. [4] developed the first fast single
Multi-word Atomic Read/Write Registers on Multiprocessor Systems
"... 1 Introduction In multiprocessing systems cooperating processes may share data via shared data objects. In this paper we are interested in designing and evaluating the performance of ef^cient shared data objects for cooperative tasks in multiprocessor systems. More speci^cally we are interested in d ..."
Abstract
- Add to MetaCart
in designing a practical wait-free algorithm for implementing registers (or memory words) of arbitrary length that could be read and written atomically. (Typical modern multiprocessor systems support words of 64-bit size.) The most commonly required consistency guarantee for shared data objects is atomicity
Registers
, 2008
"... Shared-memory (wait-free); Wait-free registers; Wait-free shared variables; Asynchronous communication hardware the most recent Write preceding the Read or of one of 46 the overlapping Writes. 47 3. An atomic variable is a regular variable in which the 48 Reads and Writes behave as if they occur in ..."
Abstract
- Add to MetaCart
Shared-memory (wait-free); Wait-free registers; Wait-free shared variables; Asynchronous communication hardware the most recent Write preceding the Read or of one of 46 the overlapping Writes. 47 3. An atomic variable is a regular variable in which the 48 Reads and Writes behave as if they occur
REGISTERS
"... DIN The AD7738 features a powerful digital interface with configuration flexibility. However, this means that the user may have to write tens of bytes of information to correctly configure the ADC. In the noisy electrical environment where these devices have to operate, bytes can be easily corrupted ..."
Abstract
- Add to MetaCart
corrupted when being sent to or read from the ADC. Typically, users write a byte and then read it back to confirm that it has been correctly received. When reading conversions, it is common for users to read the data register three times and compare the three results to validate the data. This application
Registered
, 2013
"... are trademarks of Altera Corporation and registered in the U.S. Patent and Trademark Office and in other countries. All other words and logos identified as trademarks or service marks are the property of their respective holders as described at www.altera.com/common/legal.html. Altera warrants perfo ..."
Abstract
- Add to MetaCart
are trademarks of Altera Corporation and registered in the U.S. Patent and Trademark Office and in other countries. All other words and logos identified as trademarks or service marks are the property of their respective holders as described at www.altera.com/common/legal.html. Altera warrants
Results 1 - 10
of
1,095
