M.P. Herlihy, Replication Methods for Abstract Data Types, Doctoral Dissert., MIT, LCS/TR-319, 1984.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and the distributed setting raises several issues that are not encountered in the usual, sharedmemory sequential setting. In particular, this topic touches upon several large research areas, such as ordinary data structures and data types, distributed databases, and concurrency control theory (cf. [87, 68,126,10,97,69]) We shall make no attempt to review the relevant literature here, nor shall we address the area of concurrent data structures, which refers to data structures stored in common (shared) memory but accessible by many processes concurrently, cf. 9,35,36,84,89,88,11,105,107] or the area of ....

M. Herlihy. Replication methods for abstract data types. Technical Report TR-319, MIT, Lab. for Computer Science, May 1984.

....sets such that any two quorums intersect [20] Another approach is to classify quorums as read quorums and write quorums such that any read quorum intersects any write quorum, and (sometimes) such that any two write quorums intersect. Quorums have been used to implement data replication protocols [2, 8, 9, 11, 16, 17, 22, 23]. Consensus algorithms have been used as building blocks in other work, e.g, 27] Paper organization. The rest of the paper is organized as follows. Section 2 describes some data types used by our algorithms. Section 3 contains our speci cation for the Rambo recon gurable atomic memory ....

M.P. Herlihy, \Replication Methods for Abstract Data Types", Doctoral Dissert., MIT, LCS/TR-319, 1984.

....two sets S; R 2 S have a nonempty intersection. Set systems with the intersection property are known as quorum systems, and the sets in such a system are called quorums. Quorum systems have been used in the study of problems such as mutual exclusion (cf. 39] data replication protocols (cf. [7, 18]) name servers (cf. 32] selective dissemination of information (cf. 46] and distributed access control and signatures (cf. 34] A protocol template based on quorum systems works as follows. In order to perform some action (e.g. update the database, enter a critical section) the user ....

M. P. Herlihy, Replication Methods for Abstract Data Types, PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

....more complex models) stored at the majority of the processors as the correct data. The work of this flavor can be found in classical problems of agreement and consensus [AW98, LS 82, DP 88] system level diagnosis [S86, P96a, DP 96] distributed database management [DG 85, H84] quorum systems [G79, GB85, SB94, PW95, W96] and fault local mending [KP95a, KP95b] To give a concrete example, suppose that all processors in a distributed network collectively store some value and suppose that this value is distorted in some of the processors (distortions could be due to ....

M. P. Herlihy, Replication Methods for Abstract Data Types, PhD thesis, MIT, 1984.

....intersect [5] A more refined approach divides the quorum system into a collection of read quorums and a collection of write quorums such that any read quorum intersects any write quorum. Such systems have been used to implement distributed mutual exclusion [5] and data replication protocols [4, 7]. Quorums can be used with replicated data in transaction style synchronization that limits concurrency (cf. 2] whereas our goal and the goal of [1] is to reduce restrictions on asynchrony and concurrency. In this paper we present a service that emulates shared memory registers using ....

M.P. Herlihy, Replication Methods for Abstract Data Types, Doctoral Dissertation, MIT, LCS/TR-319, 1984.

....peleg wisdom.weizmann.ac. il) 223 224 RON HOLZMAN, YOSI MARCUS, AND DAVID PELEG Applications for quorum systems in distributed systems include control and management problems such as mutual exclusion (cf. R86] name servers (cf. MV88] and replicated data management (cf. [H84]) In all of these cases, the use of quorum systems is centered on the following basic idea. The application requires that certain information items be stored in the network in a reliable and consistent way. Storing the information at a single central site is problematic in case that site crashes. ....

....also enjoy an e#cient (and fast) distributed implementation. 226 RON HOLZMAN, YOSI MARCUS, AND DAVID PELEG 1.3. Related work. Synchronization and coordination are central issues in the area of distributed systems. Many types of synchronization protocols rely on variants of quorum systems. In [H84] quorum intersection is defined between read quorums and write quorums, and also between other abstract types of quorums. In [MV88] aspects of distributed control are examined and lower bounds are presented for certain types of quorum systems. The issues of fault tolerance and availability of ....

[Article contains additional citation context not shown here]

M. P. Herlihy, Replication methods for abstract data types, Ph.D. thesis, MIT, Cambridge, MA, 1984.

....coteries and of the class of non dominated coteries (denoted NDC) are proved. For replication control protocols it is possible to separate the system into two collections, the read quorums and write quorums, such that all read quorums intersect all write quorums. This approach is explored in [Her84]. In [Fu90] the term bicoterie is introduced for this construction, with an analogous definition of domination. The fault tolerance properties of quorum based mutual exclusion protocols are introduced in [BG86] and studied further in [Coh93] The fault tolerance of a quorum system is measured by ....

M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

....intersection. Set systems with the intersection property are known as quorum systems, and the sets in such a system are called quorums. Quorum systems have been used in the study of distributed control and management problems such as mutual exclusion (cf. 37] data replication protocols (cf. [8, 18]) name servers (cf. 31] and selective dissemination of information (cf. 43] A protocol template based on quorum systems works as follows. In order to perform some action (e.g. update the database, enter a critical section) the user selects a quorum and accesses all its elements. The ....

M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

....Proc. Letters, 1998. intersection. Set systems with the intersection property are known as quorum systems, and the sets in such a system are called quorums. Quorum systems have been used in the study of distributed control and management problems such as data replication protocols (cf. DGS85, Her84, Ami95, Kei94] name servers (cf. MV88] mutual exclusion (cf. Ray86] selective dissemination of information (cf. YG94] and distributed access control and signatures (cf. NW96] A protocol template based on quorum systems works as follows. In order to perform some action (update the ....

M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

....Set systems with the intersection property are known as quorum systems, and the sets in such a system are called quorums. Quorum systems have been used in the study of distributed control and management problems such as mutual exclusion (cf. Ray86] data replication protocols (cf. DGS85, Her84] name servers (cf. MV88] and selective dissemination of information (cf. YG94] A protocol template based on quorum systems works as follows. In order to perform some action (e.g. update the database, enter a critical section) the user selects a quorum and accesses all its elements. The ....

M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

....two sets S; R 2 S have a nonempty intersection. Set systems with the intersection property are known as quorum systems, and the sets in such a system are called quorums. Quorum systems have been used in the study of problems such as mutual exclusion (cf. 39] data replication protocols (cf. [7, 18]) name servers (cf. 32] selective dissemination of information (cf. 46] and distributed access control and signatures (cf. 34] A protocol template based on quorum systems works as follows. In order to perform some action (e.g. update the database, enter a critical section) the user ....

M. P. Herlihy, Replication Methods for Abstract Data Types, PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

....a collection of write quorums such that any read quorum intersects any write quorum and any two write quorums intersect. In this work we do not require the intersection property of write quorums. Quorums have been used to implement distributed mutual exclusion [8] and data replication protocols [5, 11]. Quorums can be used with replicated data in transaction style synchronization that limits concurrency (cf. 3] whereas our goal and the goal of [2] is to reduce restrictions on asynchrony and concurrency. Many other replication techniques use quorums [1, 6, 7, 10] In this paper we present a ....

M.P. Herlihy, Replication Methods for Abstract Data Types, Doctoral Dissert., MIT, LCS/TR-319, 1984.

....a nonempty intersection. Set systems with the intersection property are known as quorum systems, and the sets in such a system are called quorums. Quorum systems have been used for distributed control and management problems such as mutual exclusion (cf. Ray86] data replication protocols (cf. [DGS85, Her84]) and name servers (cf. MV88] The principle in all these cases is as follows. The application requires some information items to be stored in the system in a reliable and consistent way. Storing the information at a single central site is a possible solution, but is deemed unsatisfactory. This ....

M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

....schemes may be implemented. 1 We have recently made some progress regarding this question. 1. 3 Tools Quorum systems: Quorum systems have been used in the study of distributed control and management problems such as mutual exclusion (cf. GB85, Ray86] data replication protocols (cf. [DGS85, Her84, JM90]) name servers (cf. MV88] and selective dissemination of information (cf. YG94] We apply some recent constructions suggested in [NW94, PW95] Secret sharing: Secret sharing was originally suggested for threshold access structures by Shamir and Blakely [Sha79, Bla79] It was extended to ....

....be proved to be secure, and furthermore, each separate record is semantically secure. ffl Instead of a quorum system as in definition 2. 1, we can use it s standard generalization to a read write system, i.e. a pair of set systems (R; W) such that R W 6= for any sets R 2 R and W 2 W (cf. [Her84, Fu90]) With this formulation, the basic paradigm is that to gain access a user must obtain permission from a read quorum R 2 R. To revoke a user s access, a write quorum W 2 W must be informed. This allows more flexibility in the choice of systems, however there is a tradeoff between the availability ....

M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

....sets S; R 2 S have a nonempty intersection. Set systems with the intersection property are known as quorum systems, and the sets in such a system are called quorums. Quorum systems have been used in the study of distributed control and management problems such as data replication protocols (cf. [11, 17, 3, 23]) name servers (cf. 28] mutual exclusion (cf. 36] selective dissemination of information (cf. 39] and distributed access control and signatures (cf. 30] A protocol template based on quorum systems works as follows. In order to perform some action (update the database, say) the user ....

M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

....In particular it is not clear whether any of the provably secure signature schemes may be implemented. 1. 3 Tools Quorum systems: Quorum systems have been used in the study of distributed control and management problems such as mutual exclusion (cf. 14, 40] data replication protocols (cf. [9, 21, 25]) name servers (cf. 35] and selective dissemination of information (cf. 49] We apply some recent constructions suggested in [1, 28, 36, 39] Secret sharing: Secret sharing (cf. 44] was originally suggested for threshold access structures by Shamir and Blakley [43, 5] It was extended to ....

....be proved to be secure, and furthermore, each separate record is semantically secure. ffl Instead of a quorum system as in definition 2. 1, we can use it s standard generalization to a read write system, i.e. a pair of set systems (R; W) such that R W 6= for any sets R 2 R and W 2 W (cf. [21, 13]) With this formulation, the basic paradigm is that to gain access a user must obtain permission from a read quorum R 2 R. To revoke a user s access, a write quorum W 2 W must be informed. This allows more flexibility in the choice of systems, however, there is a tradeoff between the ....

M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

....protocols may sacrifice correctness if conflicting operations cannot be properly undone. The second orthogonal attribute indicates whether additional semantic knowledge of access operations is used by the protocol (e.g. the behavior of enqueue and dequeue access operations on a replicated queue [9]) or whether simple read write semantics is adopted. In the former case, a protocol is called semantic otherwise syntactic. In this paper, we are concerned with pessimisticsyntactic solutions to the replica control problem. Even when being restricted to this class, the identification of a good ....

M. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, Boston, MA., May 1984. also published as Technical Report MIT/LCS/TR-319.

....In particular it is not clear whether any of the provably secure signature schemes may be implemented. 1. 3 Tools Quorum systems: Quorum systems have been used in the study of distributed control and management problems such as mutual exclusion (cf. 13, 38] data replication protocols (cf. [8, 19, 23]) name servers (cf. 32] and selective dissemination of information (cf. 44] We apply some recent constructions suggested in [33, 37] Secret sharing: Secret sharing was originally suggested for threshold access structures by Shamir and Blakely [40, 4] It was extended to arbitrary access ....

....be proved to be secure, and furthermore, each separate record is semantically secure. ffl Instead of a quorum system as in definition 2. 1, we can use it s standard generalization to a read write system, i.e. a pair of set systems (R; W) such that R W 6= for any sets R 2 R and W 2 W (cf. [19, 12]) With this formulation, the basic paradigm is that to gain access a user must obtain permission from a readquorum R 2 R. To revoke a user s access, a writequorum W 2 W must be informed. This allows more flexibility in the choice of systems, however there is a tradeoff between the availability ....

M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

....algorithms to function correctly. Similarly, majority voting is used as a basic tool in various algorithms for system level diagnosis (cf. Sul86, P96a, DP96] Data redundancy or replication is a commonly used technique in the area of distributed database management algorithms (cf. D 85, H84] and inconsistency resolution protocols are often based on one form or another of majority voting, preferring the version of the data supported by the majority of the available copies. Voting systems are used also to enforce data consistency by requiring changes to be performed on a quorum of ....

M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.

No context found.

M.P. Herlihy, Replication Methods for Abstract Data Types, Doctoral Dissert., MIT, LCS/TR-319, 1984.

No context found.

Maurice Herlihy. Replication Methods for Abstract Data Types. Ph.D. Thesis, MIT. May 1984. Available as Technical Report LCS-84-319.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC