Filters








70 Hits in 2.1 sec

Multiwriter Consistency Conditions for Shared Memory Registers

Cheng Shao, Jennifer L. Welch, Evelyn Pierce, Hyunyoung Lee
2011 SIAM journal on computing (Print)  
Regularity is a shared memory consistency condition that has received considerable attention.  ...  Finally, we provide a practical context for our results by studying the correctness of two well-known algorithms for mutual exclusion under each of our proposed consistency conditions.  ...  Acknowledgments: We thank the anonymous referees for their thoughtful comments that greatly improved the paper.  ... 
doi:10.1137/07071158x fatcat:lnmke4r2d5govjtontfk7xmegi

Efficient synchronous snapshots

Alex Brodsky, Faith Ellen Fich
2004 Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04  
It consists of a collection of m ¡ Keywords multiprocessor algorithms, shared memory objects 5 1 steps. Their implementation divides the computation time into m read-slots and 1 write-slot.  ...  An UPDATE operation waits until a write-slot occurs and then writes the new value into the corresponding register.  ...  In this paper, we investigate implementations of a multiwriter snapshot object in a synchronous shared memory model.  ... 
doi:10.1145/1011767.1011778 dblp:conf/podc/BrodskyF04 fatcat:qeibhfbj65asnjkolwa277qzbq

Reading many variables in one atomic operation: solutions with linear or sublinear complexity

L.M. Kirousis, P. Spirakis, P. Tsigas
1994 IEEE Transactions on Parallel and Distributed Systems  
Rather, it is the memory location where a write writes that di erentiates it from the other writes.  ...  of a high-level operation and its space complexity is the number of atomic shared variables it needs).  ...  Acknowledgments We thank Marina Papatrianta llou for her help in improving the presentation of this paper. We also thank the referees for their helpful comments.  ... 
doi:10.1109/71.296315 fatcat:jd57iohy7fcqdlmpyotbyvuyra

Associative Memories and Processors: The Exact Match Paradigm

Sateh M. Jalaleddine
1999 Journal of King Saud University: Computer and Information Sciences  
Associative or content addressable memories (CAM) are crucial in the implementation of high performance computing architectures for applications that require intensive data management or are cognitive  ...  The basic architecture of associative memories can be based on either the exact match or neural network models. This paper focuses on exact match as sociative memories.  ...  In table lookup associative memories such multiwrite operation is usually used for memory testing purposes where all memory words are initialized to zero or one.  ... 
doi:10.1016/s1319-1578(99)80003-2 fatcat:b2vlhax5gzgpbd7hnxejhtrjqm

Wait-free synchronization

Maurice Herlihy
1991 ACM Transactions on Programming Languages and Systems  
no two-process consensus protocol using multireader/multiwriter atomic registers.  ...  A consensus object provides a single operation: (1) Suppose the decision step for one process, say P, is to read a shared register ( Figure 3 ).  ... 
doi:10.1145/114005.102808 fatcat:rhorzhnvsvg63ewfnwbsyhgqlm

Wait-Free Synchronization [chapter]

2005 Concurrent and Distributed Computing in Java  
no two-process consensus protocol using multireader/multiwriter atomic registers.  ...  A consensus object provides a single operation: (1) Suppose the decision step for one process, say P, is to read a shared register ( Figure 3 ).  ... 
doi:10.1002/0471721271.ch5 fatcat:gika5yggazfyraezjblhrnpoi4

Atomic Snapshots in O (n log n) Operations

Hagit Attiya, Ophir Rachman
1998 SIAM journal on computing (Print)  
Wait-free algorithms for shared-memory systems have attracted considerable attention during the past few years.  ...  The atomic snapshot object is an important primitive used for the design and verification of wait-free algorithms in shared-memory distributed systems.  ...  For simplicity, we assume that the shared memory consists of only n single-writer multireader registers, R 1 , . . . , R n .  ... 
doi:10.1137/s0097539795279463 fatcat:ktsuqlp5rbgqvpcwoalkwnnwxa

Atomic snapshots in O(n log n) operations

Hagit Attiya, Ophir Rachman
1993 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93  
Wait-free algorithms for shared-memory systems have attracted considerable attention during the past few years.  ...  The atomic snapshot object is an important primitive used for the design and verification of wait-free algorithms in shared-memory distributed systems.  ...  For simplicity, we assume that the shared memory consists of only n single-writer multireader registers, R 1 , . . . , R n .  ... 
doi:10.1145/164051.164055 dblp:conf/podc/AttiyaR92 fatcat:a2uw5a7uofch7gwu5dpfwc7ooa

On Correctness of Data Structures under Reads-Write Concurrency [chapter]

Kfir Lev-Ari, Gregory Chockler, Idit Keidar
2014 Lecture Notes in Computer Science  
Namely, instead of verifying that all read shared variables still hold the values read from them, we verify abstract conditions over the shared variables, which we call base conditions.  ...  We study the correctness of shared data structures under reads-write concurrency.  ...  Acknowledgements We thank Naama Kraus, Dahlia Malkhi, Yoram Moses, Dani Shaket, Noam Shalev, and Sasha Spiegelman for helpful comments and suggestions.  ... 
doi:10.1007/978-3-662-45174-8_19 fatcat:xkxyv2igivfuzogfrpaoeeomlu

Lower Bounds for Randomized Consensus under a Weak Adversary

Hagit Attiya, Keren Censor-Hillel
2010 SIAM journal on computing (Print)  
This complements algorithms of Kapron et al. [27], for message-passing systems, and of Aumann et al. [7, 8] , for shared-memory systems.  ...  The lower bound holds for asynchronous systems, where processes communicate either by message passing or through shared memory, under a very weak adversary that determines the schedule in advance, without  ...  We would like to thank Valerie King for drawing our attention to [20] and for interesting discussions, James Aspnes for coining the term cheapsnapshot, and David Hay and Rotem Oshman for helpful comments  ... 
doi:10.1137/090751906 fatcat:chfoofaeijhxjbtid65zef4pfa

Lower bounds for randomized consensus under a weak adversary

Hagit Attiya, Keren Censor
2008 Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08  
This complements algorithms of Kapron et al. [27], for message-passing systems, and of Aumann et al. [7, 8] , for shared-memory systems.  ...  The lower bound holds for asynchronous systems, where processes communicate either by message passing or through shared memory, under a very weak adversary that determines the schedule in advance, without  ...  We would like to thank Valerie King for drawing our attention to [20] and for interesting discussions, James Aspnes for coining the term cheapsnapshot, and David Hay and Rotem Oshman for helpful comments  ... 
doi:10.1145/1400751.1400793 dblp:conf/podc/AttiyaC08 fatcat:7q57awdexfcovpnmwnjpnztnfa

Atomic shared register access by asynchronous hardware

Paul M. B. Vitanyi, Baruch Awerbuch
1986 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)  
We apply the method to prove atomicity of the two implementations for atomic multiwriter multireader registers.  ...  First, we describe two ways to construct multivalued atomic n -writer n -reader registers. The first solution uses atomic 1-writer 1-reader registers and unbounded tags.  ...  Misra [MisraI986] has investigated axioms for the design of multiwriter registers.  ... 
doi:10.1109/sfcs.1986.11 dblp:conf/focs/VitanyiA86 fatcat:y3ouphgyz5fd7dacvhqcx42zba

Randomized naming using wait-free shared variables

Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul Vitányi
1998 Distributed computing  
We construct a randomized wait-free naming protocol using wait-free atomic read/write registers (shared variables) as process intercommunication primitives.  ...  The addresses/names each one uses for the others are possibly different: Processes p and q address the register of process r in a way not known to each other.  ...  They also give an O(log n) expected time solution with key range size n against a fair oblivious adversary using O(n) shared memory consisting of log n-bit registers.  ... 
doi:10.1007/s004460050045 fatcat:fag3ow5xm5hi5ow4cpsqj2sqv4

Approximate Shared-Memory Counting Despite a Strong Adversary [chapter]

James Aspnes, Keren Censor
2009 Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms  
A new randomized asynchronous shared-memory data structure is given for implementing an approximate counter that can be incremented up to n times.  ...  An application of the improved counter is an improved protocol for solving randomized shared-memory consensus, which reduces the best previously known individual work complexity from O(n log n) to an optimal  ...  Formally, we consider the standard model of an asynchronous shared-memory system, where n processes communicate by reading and writing to shared multiwriter multi-reader registers.  ... 
doi:10.1137/1.9781611973068.49 fatcat:dgh2hwzxfzepbhaqsvu7jsf4j4

Approximate shared-memory counting despite a strong adversary

James Aspnes, Keren Censor
2010 ACM Transactions on Algorithms  
A new randomized asynchronous shared-memory data structure is given for implementing an approximate counter that can be incremented up to n times.  ...  An application of the improved counter is an improved protocol for solving randomized shared-memory consensus, which reduces the best previously known individual work complexity from O(n log n) to an optimal  ...  Formally, we consider the standard model of an asynchronous shared-memory system, where n processes communicate by reading and writing to shared multiwriter multi-reader registers.  ... 
doi:10.1145/1721837.1721841 fatcat:dvakrs3l7fc2hbqfmmsyuhffum
« Previous Showing results 1 — 15 out of 70 results