نتایج جستجو برای: attiya

تعداد نتایج: 74  

2000
Burkhard Englert Alexander A. Shvartsman

Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the message-passing setting. A robust emulation of atomic single-writer/multi-reader registers in message-passing systems was developed by Attiya, Bar-Noy and Dolev (1995). This emulation was extended by Lynch and Shvarts...

2005
Gregory Chockler Nancy Lynch Sayan Mitra Joshua Tauber

Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algorithms achieve atomicity has turned out to be a challenging problem. In this paper, we initiate the study of systematic ways of verifying distributed implementations of atomic objects, beginning with read/write object...

1991
Stephen Ponzio

We consider the time complexity of reaching agreement in a semi-synchronous model of distributed systems, in the presence of omission and Byzantine failures. In our semi-synchronous model, processes have inexact knowledge about the time to perform certain primitive actions: messages arrive within time d of when they are sent and the time between two consecutive steps of any process is in the kn...

2005
Gregory V. Chockler Nancy A. Lynch Sayan Mitra Joshua A. Tauber

Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algorithms achieve atomicity has turned out to be a challenging problem. In this paper, we initiate the study of systematic ways of verifying distributed implementations of atomic objects, beginning with read/write object...

2013
Viveck R. Cadambe Nancy Lynch Muriel Medard Peter Musial Muriel Médard

This paper considers the communication and storage costs of emulating atomic (linearizable) read/write shared memory in distributed messagepassing systems. We analyze the costs of previously-proposed algorithms by Attiya, Bar-Noy, and Dolev (the ABD algorithm) and by Fan and Lynch (the LDR algorithm), and develop new coding-based algorithms that significantly reduce these costs. The paper conta...

In this paper‎, ‎we introduce a new class$T_{k}^{s,a}[A,B,alpha‎ ,‎beta ]$ of analytic functions by using a‎ ‎newly defined convolution operator‎. ‎This class contains many known classes of‎ ‎analytic and univalent functions as special cases‎. ‎We derived some‎ ‎interesting results including inclusion relationships‎, ‎a radius problem and‎ ‎sharp coefficient bound for this class‎.

2006
Khanh Do Ba Prasad Jayanti

The snapshot problem was first proposed over a decade ago [1, 2] and has since been well-studied in the distributed algorithms community [4, 5, 6, 7, 8, 9, 12, 13, 14, 17, 18]. The challenge is to design a data structure consisting of m components, shared by upto n concurrent processes, that supports two operations. The first, Update(i, v), atomically writes v to the ith component. The second, ...

1994
Amos Beimel Ofer Biran Eyal Kushilevitz Marios Mavronicolas

Lower and upper bounds are proved for the time complexity of solving two decision problems in a distributed network in the presence of process failures and inexact information about time. It is assumed that the amount of (real) time between two consecutive steps of a nonfaulty process is at least c1 and at most c2; thus, C = c2=c1 is a measure of the timing uncertainty. It is also assumed that ...

2016
Radha Jagadeesan James Riely

We address the fundamental issue of interfaces that arises in the context of cloud computing; namely, what does it mean for a replicated and distributed implementation of a data structure to satisfy its standard sequential specification. The main contribution of this paper is a new definition of eventual consistency that liberalizes the linear time regime of linearizability to partial orders. A...

2010
Armando Castañeda Sergio Rajsbaum

In the renaming task n + 1 processes start with unique input names from a large space and must choose unique output names taken from a smaller name space, 0, 1, . . . ,K. To rule out trivial solutions, a protocol must be anonymous: the value chosen by a process can depend on its input name and on the execution, but not on the specific process id. Attiya et al. showed in 1990 that renaming has a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید