#### DMCA

## A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model

### Citations

1985 |
Distributed Algorithms
- Lynch
- 1996
(Show Context)
Citation Context ...process, but can be read by multiple processes. All communication among the processes is via the shared memory. A full description of an asynchronous shared memory system can be given as such a model =-=[9]-=-. 456 T. Altman, Y. Igarashi, and M. Omori Access to a shared variable has a time duration starting from an invocation and ending with a response. We do not make assumptions about relative speeds of t... |

186 |
Myths about the mutual exclusion problem,
- Peterson
- 1981
(Show Context)
Citation Context ...isible resource that can only support one user at a time. It is well known as an important and fundamental problem in the area of asynchronous distributed systems. The n-process algorithm by Peterson =-=[12]-=- and the tournament algorithm by Peterson and Fischer [13] are well known lockout free mutual exclusion algorithms. These algorithms use multi-writer/reader shared variables to decide which of the pro... |

166 | On Interprocess Communication”,
- Lamport
- 1986
(Show Context)
Citation Context ...writer/multi-reader shared variables in our algorithm, write operations do not overlap each other. Overlapping read operations are assumed not to affect each other. However, as pointed out by Lamport =-=[7]-=-, when a read operation from a shared variable overlaps one or more write operations to the same shared variable, various situations can be considered. Lamport defined three categories for single-writ... |

78 |
Economical solutions for the critical section problem in a distributed system.
- Peterson, Fischer
- 1977
(Show Context)
Citation Context ...It is well known as an important and fundamental problem in the area of asynchronous distributed systems. The n-process algorithm by Peterson [12] and the tournament algorithm by Peterson and Fischer =-=[13]-=- are well known lockout free mutual exclusion algorithms. These algorithms use multi-writer/reader shared variables to decide which of the processes is the last arrival. The accelerated version of n-p... |

44 | How to share concurrent wait-free variables
- LI, TROMP, et al.
- 1989
(Show Context)
Citation Context .... The mutual exclusion problem and the k-exclusion problem are such problems. An algorithm for simulating multi-writer/reader shared variables by singlewriter/multi-reader variables has been proposed =-=[8]-=-. However, it uses bounded concurrent time-stamps. In this paper we propose an algorithm without using time-stamps for the turn function in the single-writer/multi-reader shared memory model. The stru... |

43 | Bounded Concurrent Time-Stamp Systems Are Constructible
- Dolev, Shavit
- 1989
(Show Context)
Citation Context ...roblem. Their algorithm uses time-stamps. However, bounded concurrent time-stamp schemes known so far contain complicated construction in order to give temporal relations among events in an execution =-=[2,3,5]-=-. We can easily design algorithms for the k-exclusion problem if we are allowed to use multi-writer/reader shared variables as shown in [10,11]. However, the realization of multi-writer/reader shared ... |

40 | Resource allocation with immunity to limited process failure, in:
- Fischer, Lynch, et al.
- 1979
(Show Context)
Citation Context ...r k, are allowed to be concurrently inside the critical region, where corresponding users can use the resource. This generalization was defined and solved by Fischer et al. in the shared memory model =-=[4]-=-. Afek et al.[1] gave a first-in and firstenable solution to the k-exclusion problem. Their algorithm uses time-stamps. However, bounded concurrent time-stamp schemes known so far contain complicated ... |

27 |
Simple and efficient bounded and concurrent timestamping or bounded concurrent timestamp systems are comprehensible
- Dwork, Waarts
- 1992
(Show Context)
Citation Context ...roblem. Their algorithm uses time-stamps. However, bounded concurrent time-stamp schemes known so far contain complicated construction in order to give temporal relations among events in an execution =-=[2,3,5]-=-. We can easily design algorithms for the k-exclusion problem if we are allowed to use multi-writer/reader shared variables as shown in [10,11]. However, the realization of multi-writer/reader shared ... |

3 |
Speedup of the n-process mutual exclusion algorithm,
- Igarashi, Nishitani
- 1999
(Show Context)
Citation Context ...on algorithms. These algorithms use multi-writer/reader shared variables to decide which of the processes is the last arrival. The accelerated version of n-process algorithm by Igarashi and Nishitani =-=[6]-=- also uses multi-writer/reader shared variables. T. Ibaraki, N. Katoh, and H. Ono (Eds.): ISAAC 2003, LNCS 2906, pp. 454–463, 2003. c© Springer-Verlag Berlin Heidelberg 2003 A Turn Function Scheme 455... |

3 |
Analysis of some lockout avoidance algorithms for the k-exclusion problem,
- Omori, Obokata, et al.
- 2002
(Show Context)
Citation Context ... to give temporal relations among events in an execution [2,3,5]. We can easily design algorithms for the k-exclusion problem if we are allowed to use multi-writer/reader shared variables as shown in =-=[10,11]-=-. However, the realization of multi-writer/reader shared variables is not easy. The multi-writer/reader shared variables, named turn’s, used in [6,10,11,12, 13] have the same function. If every proces... |

1 |
A bounded first-in, firstenable solution to the l-exclusion problem
- Gafni, Merritt, et al.
- 1994
(Show Context)
Citation Context ... to be concurrently inside the critical region, where corresponding users can use the resource. This generalization was defined and solved by Fischer et al. in the shared memory model [4]. Afek et al.=-=[1]-=- gave a first-in and firstenable solution to the k-exclusion problem. Their algorithm uses time-stamps. However, bounded concurrent time-stamp schemes known so far contain complicated construction in ... |

1 |
Bounded concurrent timestamps using vector clocks
- Haldar, Vitanyi
- 2002
(Show Context)
Citation Context ...roblem. Their algorithm uses time-stamps. However, bounded concurrent time-stamp schemes known so far contain complicated construction in order to give temporal relations among events in an execution =-=[2,3,5]-=-. We can easily design algorithms for the k-exclusion problem if we are allowed to use multi-writer/reader shared variables as shown in [10,11]. However, the realization of multi-writer/reader shared ... |

1 |
A lockout avoidance algorithm without using time-stamps
- Obokata, Omori, et al.
- 2001
(Show Context)
Citation Context ... to give temporal relations among events in an execution [2,3,5]. We can easily design algorithms for the k-exclusion problem if we are allowed to use multi-writer/reader shared variables as shown in =-=[10,11]-=-. However, the realization of multi-writer/reader shared variables is not easy. The multi-writer/reader shared variables, named turn’s, used in [6,10,11,12, 13] have the same function. If every proces... |