Lynch, Nancy A. (Nancy Ann) 1948
Overview
Works:  108 works in 360 publications in 1 language and 2,145 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Creator 
Classifications:  QA76.9.A43, 005.276 
Publication Timeline
.
Most widely held works about
Nancy A Lynch
Most widely held works by
Nancy A Lynch
Distributed algorithms by
Nancy A Lynch(
Book
)
38 editions published between 1989 and 2010 in English and Undetermined and held by 565 WorldCat member libraries worldwide
The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable
38 editions published between 1989 and 2010 in English and Undetermined and held by 565 WorldCat member libraries worldwide
The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable
Atomic transactions by
Nancy A Lynch(
Book
)
10 editions published between 1988 and 1994 in English and held by 199 WorldCat member libraries worldwide
This paper describes some results of a recent project to develop a theory for reasoning about atomic transactions. This theory allows careful statement of the correctness conditions to be satisfied by transaction processing algorithms, as well as clear and concise description of such algorithms. It also serves as a framework for rigorous correctness proofs. Keywords: Concurrency control; Serializability; Coding, Nested transactions; Database theory. (jhd)
10 editions published between 1988 and 1994 in English and held by 199 WorldCat member libraries worldwide
This paper describes some results of a recent project to develop a theory for reasoning about atomic transactions. This theory allows careful statement of the correctness conditions to be satisfied by transaction processing algorithms, as well as clear and concise description of such algorithms. It also serves as a framework for rigorous correctness proofs. Keywords: Concurrency control; Serializability; Coding, Nested transactions; Database theory. (jhd)
Distributed computing : 24th international symposium, DISC 2010, Cambridge, MA, USA, September 1315, 2010 ; proceedings by
Nancy A Lynch(
)
17 editions published between 1989 and 2010 in English and Undetermined and held by 56 WorldCat member libraries worldwide
Rigorous analysis starts with a precise model of a distributed system; the most popular models, differing in how they represent interprocess communication, are message passing, shared variables, and synchronous communication. The properties satisfied by an algorithm must be precisely stated and carefully proved; the most successful approach is based on assertional reasoning. Algorithms for solving particular problems in a distributed system can then be designed and analyzed. Typical of the problems that have been addressed are: concurrently accessing shared data, achieving consensus, analyzing network topology, obtaining consistent global information, and controlling database transactions
17 editions published between 1989 and 2010 in English and Undetermined and held by 56 WorldCat member libraries worldwide
Rigorous analysis starts with a precise model of a distributed system; the most popular models, differing in how they represent interprocess communication, are message passing, shared variables, and synchronous communication. The properties satisfied by an algorithm must be precisely stated and carefully proved; the most successful approach is based on assertional reasoning. Algorithms for solving particular problems in a distributed system can then be designed and analyzed. Typical of the problems that have been addressed are: concurrently accessing shared data, achieving consensus, analyzing network topology, obtaining consistent global information, and controlling database transactions
The theory of timed I/O automata by
Dilsun K Kaynar(
Book
)
4 editions published between 2006 and 2010 in English and held by 35 WorldCat member libraries worldwide
This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range of domains including communications, embedded systems, realtime operating systems, and automated control. Many applications involving timed systems have strong safety, reliability, and predictability req
4 editions published between 2006 and 2010 in English and held by 35 WorldCat member libraries worldwide
This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range of domains including communications, embedded systems, realtime operating systems, and automated control. Many applications involving timed systems have strong safety, reliability, and predictability req
Using mappings to prove timing properties by
Nancy A Lynch(
Book
)
16 editions published between 1989 and 1992 in English and held by 27 WorldCat member libraries worldwide
A new technique for proving timing properties for timing based algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing a system with timing constraints as an automaton whose state includes predictive timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multivalued mapping from the assumptions automaton to the requirements automaton is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of variant functions providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a twoprocess race system
16 editions published between 1989 and 1992 in English and held by 27 WorldCat member libraries worldwide
A new technique for proving timing properties for timing based algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing a system with timing constraints as an automaton whose state includes predictive timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multivalued mapping from the assumptions automaton to the requirements automaton is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of variant functions providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a twoprocess race system
Relativization of the theory of computational complexity by
Nancy A Lynch(
Book
)
10 editions published in 1972 in English and Undetermined and held by 17 WorldCat member libraries worldwide
Blum's machineindependent treatment of the complexity of partial recursive functions is extended to relative algorithms (as represented by Turing machines with oracles). The author proves relativeizations of several results of Blum complexity theory. A recursive relatedness theorem is proved, showing that any two relative complexity measures are related by a fixed recursive function. This theorem allows one to obtain proofs of results for all measures from proofs for a particular measure. The author studies complexitydetermined reducibilities, the parallel notion to complexity classes for the relativized case. Truthtable and primitive recursive reducibilities are reducibilities of this type. The concept of a set helping the computation of a function is formalized. Basic properties of the helping relation are proved, including nontransitivity and bounds on the amount of help certain sets can provide. (Author)
10 editions published in 1972 in English and Undetermined and held by 17 WorldCat member libraries worldwide
Blum's machineindependent treatment of the complexity of partial recursive functions is extended to relative algorithms (as represented by Turing machines with oracles). The author proves relativeizations of several results of Blum complexity theory. A recursive relatedness theorem is proved, showing that any two relative complexity measures are related by a fixed recursive function. This theorem allows one to obtain proofs of results for all measures from proofs for a particular measure. The author studies complexitydetermined reducibilities, the parallel notion to complexity classes for the relativized case. Truthtable and primitive recursive reducibilities are reducibilities of this type. The concept of a set helping the computation of a function is formalized. Basic properties of the helping relation are proved, including nontransitivity and bounds on the amount of help certain sets can provide. (Author)
Time bounds for realtime process control in the presence of timing uncertainty by
Hagit Attiya(
Book
)
7 editions published between 1989 and 1991 in English and held by 14 WorldCat member libraries worldwide
Abstract: "A timingbased variant of the mutual exclusion problem is considered. In this variant, only an upperbound, m, on the time it takes to release the resource is known, and no explicit signal is sent when the resource is released; furthermore, the only mechanism to measure real time is an inaccurate clock, whose tick intervals take time between two constants, c₁ [<or =] c₂. When control is centralized it is proved that [formula] is an exact bound on the worst case response time for any such algorithm, where n is the number of contenders for the resource and l is an upper bound on process step time. On the other hand, when control is distributed among processes connected via communication lines with an upper bound, d, for message delivery time, it is proved that [formula] is an upper bound. A new technique involving shifting and shrinking executions is combined with a careful analysis of the best allocation policy to prove a corresponding lower bound of [formula]. These combinatorial results shed some light on modeling and verification issues related to realtime systems."
7 editions published between 1989 and 1991 in English and held by 14 WorldCat member libraries worldwide
Abstract: "A timingbased variant of the mutual exclusion problem is considered. In this variant, only an upperbound, m, on the time it takes to release the resource is known, and no explicit signal is sent when the resource is released; furthermore, the only mechanism to measure real time is an inaccurate clock, whose tick intervals take time between two constants, c₁ [<or =] c₂. When control is centralized it is proved that [formula] is an exact bound on the worst case response time for any such algorithm, where n is the number of contenders for the resource and l is an upper bound on process step time. On the other hand, when control is distributed among processes connected via communication lines with an upper bound, d, for message delivery time, it is proved that [formula] is an upper bound. A new technique involving shifting and shrinking executions is combined with a careful analysis of the best allocation policy to prove a corresponding lower bound of [formula]. These combinatorial results shed some light on modeling and verification issues related to realtime systems."
Forward and backward simulations by
Nancy A Lynch(
Book
)
13 editions published between 1993 and 1994 in English and Undetermined and held by 13 WorldCat member libraries worldwide
13 editions published between 1993 and 1994 in English and Undetermined and held by 13 WorldCat member libraries worldwide
Multilevel atomicity : a new correctness criterion for database concurrency control by
Nancy A Lynch(
Book
)
5 editions published in 1982 in English and held by 11 WorldCat member libraries worldwide
Multilevel atomicity, a new correctness criteria for database concurrency control, is defined. It weakens the usual notion of serializability by permitting controlled interleaving among transactions. It appears to be especially suitable for applications in which the set of transactions has a natural hierarchical structure based on the hierarchical structure of an organization. A characterization for multilevel atomicity, in terms of absence of cycles in a dependency relation among transaction steps, is given. Some remarks are made concerning implementation. (Author)
5 editions published in 1982 in English and held by 11 WorldCat member libraries worldwide
Multilevel atomicity, a new correctness criteria for database concurrency control, is defined. It weakens the usual notion of serializability by permitting controlled interleaving among transactions. It appears to be especially suitable for applications in which the set of transactions has a natural hierarchical structure based on the hierarchical structure of an organization. A characterization for multilevel atomicity, in terms of absence of cycles in a dependency relation among transaction steps, is given. Some remarks are made concerning implementation. (Author)
Hybrid I/O automata by
Nancy A Lynch(
Book
)
7 editions published between 1995 and 2002 in English and Undetermined and held by 11 WorldCat member libraries worldwide
Abstract: "We propose a new hybrid I/O automaton model that is capable of describing both continuous and dicrete behavior. The model, which extends the timed I/O automaton model of [12, 7] and the phase transition system models of [15, 2], allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) the definition of hybrid I/O automata and of an implementation relation based on hybrid traces, (2) the definition of a simulation between hybrid I/O automata and a proof that existence of a simulation implies the implementation relation, (3) a definition of composition of hybrid I/O automata and a proof that it respects the implementation relation, and (4) a definition of receptiveness for hybrid I/O automata and a proof that, assuming certain compatibility conditions, receptiveness is preserved by composition."
7 editions published between 1995 and 2002 in English and Undetermined and held by 11 WorldCat member libraries worldwide
Abstract: "We propose a new hybrid I/O automaton model that is capable of describing both continuous and dicrete behavior. The model, which extends the timed I/O automaton model of [12, 7] and the phase transition system models of [15, 2], allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) the definition of hybrid I/O automata and of an implementation relation based on hybrid traces, (2) the definition of a simulation between hybrid I/O automata and a proof that existence of a simulation implies the implementation relation, (3) a definition of composition of hybrid I/O automata and a proof that it respects the implementation relation, and (4) a definition of receptiveness for hybrid I/O automata and a proof that, assuming certain compatibility conditions, receptiveness is preserved by composition."
Concurrency control for resilient nested transactions by
Nancy A Lynch(
Book
)
5 editions published between 1983 and 1986 in English and held by 11 WorldCat member libraries worldwide
A formal framework is developed for providing correctness of algorithms which implement nested transactions. In particular, a simple action tree data structure is defined, which describes the ancestor relationships among executing transactions and also describes the views which different transactions have of the data. A generalization of serializability to the domain of nested transactions with failures is defined. A characterization is given for this generalization of serializability, in terms of absence of cycles in an appropriate dependency relation on transactions. A slightly simplified version of Moss' locking algorithm is presented in detail, and a careful correctness proof is given. The style of correctness proof appears to be quite interesting in its own right. The description of the algorithm, from its initial specification to its detailed implementation, is presented as a series of eventstate algebra levels, each of which simulates the previous one in a straightforward way. (Author)
5 editions published between 1983 and 1986 in English and held by 11 WorldCat member libraries worldwide
A formal framework is developed for providing correctness of algorithms which implement nested transactions. In particular, a simple action tree data structure is defined, which describes the ancestor relationships among executing transactions and also describes the views which different transactions have of the data. A generalization of serializability to the domain of nested transactions with failures is defined. A characterization is given for this generalization of serializability, in terms of absence of cycles in an appropriate dependency relation on transactions. A slightly simplified version of Moss' locking algorithm is presented in detail, and a careful correctness proof is given. The style of correctness proof appears to be quite interesting in its own right. The description of the algorithm, from its initial specification to its detailed implementation, is presented as a series of eventstate algebra levels, each of which simulates the previous one in a straightforward way. (Author)
Impossibility of distributed consensus with one faulty process by
Michael J Fischer(
Book
)
5 editions published in 1982 in English and held by 11 WorldCat member libraries worldwide
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the Byzantine Generals problem. (Author)
5 editions published in 1982 in English and held by 11 WorldCat member libraries worldwide
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the Byzantine Generals problem. (Author)
Hierarchical correctness proofs for distributed algorithms by Mark R Tuttle(
Book
)
4 editions published in 1987 in English and Undetermined and held by 10 WorldCat member libraries worldwide
This thesis introduces a new model for distributed computation in asynchronous networks, the inputoutput automaton. This simple, powerful model captures in a novel way the gametheoretical interaction between a system and its environment, and allows fundamental properties of distributed computation such as fair computation to be naturally expressed. Furthermore, this model can be used to construct modular, hierarchical correctness proofs of distributed algorithms. This thesis defines the inputoutput automaton model, and presents an interesting example of how this model can be used to construct such proofs
4 editions published in 1987 in English and Undetermined and held by 10 WorldCat member libraries worldwide
This thesis introduces a new model for distributed computation in asynchronous networks, the inputoutput automaton. This simple, powerful model captures in a novel way the gametheoretical interaction between a system and its environment, and allows fundamental properties of distributed computation such as fair computation to be naturally expressed. Furthermore, this model can be used to construct modular, hierarchical correctness proofs of distributed algorithms. This thesis defines the inputoutput automaton model, and presents an interesting example of how this model can be used to construct such proofs
Consensus in the presense of partial synchrony by
Cynthia Dwork(
Book
)
8 editions published between 1984 and 1985 in English and held by 10 WorldCat member libraries worldwide
The problem of reaching agreement among separated processors is of fundamental importance to distributed computing, and has provided a rich set of interesting mathematical problems. Previous work has shown that if communication and processing are synchronous there exist consensus protocols resilient to large numbers of failures, the exact number depending on the particular type of faulty behavior to be tolerated. In contrast it has been shown that if either communication or processing are asynchronous, then there is no consensus protocol resilient to even one failure of the weakest type. This paper defines and studies the consensus problem in practically motivated situations which lie between the completely synchronous and the completely asynchronous cases. Additional keywords: Byzantine agreement; faulttolerance and distributed algorithms. (Author)
8 editions published between 1984 and 1985 in English and held by 10 WorldCat member libraries worldwide
The problem of reaching agreement among separated processors is of fundamental importance to distributed computing, and has provided a rich set of interesting mathematical problems. Previous work has shown that if communication and processing are synchronous there exist consensus protocols resilient to large numbers of failures, the exact number depending on the particular type of faulty behavior to be tolerated. In contrast it has been shown that if either communication or processing are asynchronous, then there is no consensus protocol resilient to even one failure of the weakest type. This paper defines and studies the consensus problem in practically motivated situations which lie between the completely synchronous and the completely asynchronous cases. Additional keywords: Byzantine agreement; faulttolerance and distributed algorithms. (Author)
Action transducers and timed automata by
Nancy A Lynch(
Book
)
7 editions published between 1992 and 1994 in English and Undetermined and held by 10 WorldCat member libraries worldwide
Abstract: "The timed automaton model of [29,30] is a general model for timingbased systems. A notion of timed action transducer is here defined as an automatatheoretic way of representing operations on timed automata. It is shown that two timed trace inclusion relations are substitutive with respect to operations that can be described by timed action transducers. Examples are given of operations that can be described in this way, and a preliminary proposal is given for an appropriate language of operators for describing timingbased systems."
7 editions published between 1992 and 1994 in English and Undetermined and held by 10 WorldCat member libraries worldwide
Abstract: "The timed automaton model of [29,30] is a general model for timingbased systems. A notion of timed action transducer is here defined as an automatatheoretic way of representing operations on timed automata. It is shown that two timed trace inclusion relations are substitutive with respect to operations that can be described by timed action transducers. Examples are given of operations that can be described in this way, and a preliminary proposal is given for an appropriate language of operators for describing timingbased systems."
Probabilistic analysis of a network resource allocation algorithm by
Nancy A Lynch(
Book
)
8 editions published between 1983 and 1985 in English and held by 10 WorldCat member libraries worldwide
A distributed algorithm is presented, for allocating a large number of identical resources (such as airline tickets) to requests which can arrive anywhere in a distributed network. Resources, once allocated, are never returned. The algorithm searches sequentially, exhausting certain neighborhoods of the request origin before proceeding to search at greater distances. Choice of search direction is made nondeterministically. Analysis of expected response time is simplified by assuming that the search direction is chosen probabilistically, that messages require constant time, that the network is a tree with all leaves at the same distance from the root, and that requests and resources occur only at leaves. It is shown that the response time is approximated by the number of messages of one that are sent during the execution of the algorithm, and that this number of message is a nondecreasing function of the interarrival time for requests. Therefore, the worst case occurs when requests come in so far apart that they are processed sequentially. The expected time for the sequential case of the algorithm is analyzed by standard techniques. This time is shown to be bounded by a constant, independent of the size of the network. It follows that the expected response time for the algorithm is bounded in the same way. (Author)
8 editions published between 1983 and 1985 in English and held by 10 WorldCat member libraries worldwide
A distributed algorithm is presented, for allocating a large number of identical resources (such as airline tickets) to requests which can arrive anywhere in a distributed network. Resources, once allocated, are never returned. The algorithm searches sequentially, exhausting certain neighborhoods of the request origin before proceeding to search at greater distances. Choice of search direction is made nondeterministically. Analysis of expected response time is simplified by assuming that the search direction is chosen probabilistically, that messages require constant time, that the network is a tree with all leaves at the same distance from the root, and that requests and resources occur only at leaves. It is shown that the response time is approximated by the number of messages of one that are sent during the execution of the algorithm, and that this number of message is a nondecreasing function of the interarrival time for requests. Therefore, the worst case occurs when requests come in so far apart that they are processed sequentially. The expected time for the sequential case of the algorithm is analyzed by standard techniques. This time is shown to be bounded by a constant, independent of the size of the network. It follows that the expected response time for the algorithm is bounded in the same way. (Author)
Correctness conditions for highly available replicated databases by
Nancy A Lynch(
Book
)
3 editions published in 1986 in English and held by 9 WorldCat member libraries worldwide
Correctness conditions are given which describe some of the properties exhibited by highly available distributed database systems such as the SHARD (System for Highly Available Replicated Data) system currently being developed at Computer Corporation of America. This system allows a database application to continue operation in the face of communication failures, including network partitions. A penalty is paid for this extra availability: the usual correctness conditions, serializability of transactions and preservation of integrity constraints, are not guaranteed. However, it is still possible to make interesting claims about the behavior of the system. The kinds of claims which can be proved include bounds on the costs of violation of integrity constraints, and fairness guarantees. In contrast to serializability's allornothing character, this work has a continuous flavor: small changes in available information lead to small perturbations in correctness conditions. This work is novel, because there has been very little previous success in stating interesting properties which are guaranteed by nonserializable systems. (Author)
3 editions published in 1986 in English and held by 9 WorldCat member libraries worldwide
Correctness conditions are given which describe some of the properties exhibited by highly available distributed database systems such as the SHARD (System for Highly Available Replicated Data) system currently being developed at Computer Corporation of America. This system allows a database application to continue operation in the face of communication failures, including network partitions. A penalty is paid for this extra availability: the usual correctness conditions, serializability of transactions and preservation of integrity constraints, are not guaranteed. However, it is still possible to make interesting claims about the behavior of the system. The kinds of claims which can be proved include bounds on the costs of violation of integrity constraints, and fairness guarantees. In contrast to serializability's allornothing character, this work has a continuous flavor: small changes in available information lead to small perturbations in correctness conditions. This work is novel, because there has been very little previous success in stating interesting properties which are guaranteed by nonserializable systems. (Author)
The Byzantine firing squad problem by
James E Burns(
Book
)
3 editions published in 1985 in English and held by 9 WorldCat member libraries worldwide
A new problem, the Byzantine Firing Squad problem, is defined and solved in two versions, Permissive and Strict. Both problems provide for synchronization of initially unsynchronized processors in a synchronous network, in the absence of a common clock and in the presence of a limited number of faulty processors. Solution are given which take the same number of rounds as Byzantine Agreement but might transmit r times as many bits, where r is the number of rounds used. Additional solutions are provided which use at most one (Permissive) or two (Strict) additional rounds and send at most n sub 2 bits plus four times the number of bits sent by a chosen Byzantine Agreement algorithm. Additional keywords: Computer communications. (Author)
3 editions published in 1985 in English and held by 9 WorldCat member libraries worldwide
A new problem, the Byzantine Firing Squad problem, is defined and solved in two versions, Permissive and Strict. Both problems provide for synchronization of initially unsynchronized processors in a synchronous network, in the absence of a common clock and in the presence of a limited number of faulty processors. Solution are given which take the same number of rounds as Byzantine Agreement but might transmit r times as many bits, where r is the number of rounds used. Additional solutions are provided which use at most one (Permissive) or two (Strict) additional rounds and send at most n sub 2 bits plus four times the number of bits sent by a chosen Byzantine Agreement algorithm. Additional keywords: Computer communications. (Author)
Multivalued possibilities mappings by
Nancy A Lynch(
Book
)
5 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide
Abstraction mappings are one of the major tools used to construct correctness proofs for concurrent algorithms. Several examples are given of situations in which it is useful to allow the abstraction mappings to be multivalued. The examples involve algorithm optimization, algorithm distribution, and proofs of time bounds. Abstraction mappings are one of the major tools that the author and colleagues use to construct correctness proofs for concurrent (including distributed) algorithms. In this paper, she tries to make one major point about such mappings: that it is useful to allow them to be multivalued. That is, often when one maps a lowlevel algorithm L to a high level algorithm H, one would like to allow several states of H to correspond to a single state of L.I believe that any useful framework for describing abstraction mappings should include the ability to describe multivalued mappings
5 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide
Abstraction mappings are one of the major tools used to construct correctness proofs for concurrent algorithms. Several examples are given of situations in which it is useful to allow the abstraction mappings to be multivalued. The examples involve algorithm optimization, algorithm distribution, and proofs of time bounds. Abstraction mappings are one of the major tools that the author and colleagues use to construct correctness proofs for concurrent (including distributed) algorithms. In this paper, she tries to make one major point about such mappings: that it is useful to allow them to be multivalued. That is, often when one maps a lowlevel algorithm L to a high level algorithm H, one would like to allow several states of H to correspond to a single state of L.I believe that any useful framework for describing abstraction mappings should include the ability to describe multivalued mappings
Are waitfree algorithms fast? by
Hagit Attiya(
Book
)
4 editions published in 1991 in English and held by 8 WorldCat member libraries worldwide
The time complexity of waitfree algorithms in normal executions, where no failures occur and processes operate at approximately the same speed, is considered. A lower bound of log n on the time complexity of any waitfree algorithm that achieves approximate agreement among n processes is proved. In contrast, there exists a nonwaitfree algorithm that solves this problem in constant time. This implies an omega (log n) time separation between the waitfree and nonwaitfree computation models. On the positive side, we present an O(log n) time waitfree approximate agreement algorithm; the complexity of this algorithm is within a small constant of the lower bound
4 editions published in 1991 in English and held by 8 WorldCat member libraries worldwide
The time complexity of waitfree algorithms in normal executions, where no failures occur and processes operate at approximately the same speed, is considered. A lower bound of log n on the time complexity of any waitfree algorithm that achieves approximate agreement among n processes is proved. In contrast, there exists a nonwaitfree algorithm that solves this problem in constant time. This implies an omega (log n) time separation between the waitfree and nonwaitfree computation models. On the positive side, we present an O(log n) time waitfree approximate agreement algorithm; the complexity of this algorithm is within a small constant of the lower bound
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Shvartsman, Alex Allister
 Massachusetts Institute of Technology Laboratory for Computer Science
 MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE
 Fekete, Alan Author
 Attiya, Hagit Author
 Vaandrager, Frits W. Author
 Segala, Roberto 1968
 DISC 2010 Cambridge, Mass
 Kaynar, Dilsun K. Author
 Vaadrager, Frits
Useful Links
Associated Subjects
Abstraction Algorithms Artificial intelligence Carson, W. H Computational complexity Computer algorithms Computer inputoutput equipment Computer networks Computer science Computer simulation Computer software Database management Distributed databases Electronic data processingDistributed processing Electronic data processingDistributed processingMathematical models Electronic data processingDistributed processingReliability Faulttolerant computing Garbage collection (Computer science) Hybrid computers Interior architecture Machine theory Mappings (Mathematics) Miller, G. P Miller, J. L Network analysis (Planning) Parallel processing (Electronic computers) Probabilities Proof theoryData processing Railroad stations Realtime control Realtime data processing Reasoning Recursive functions Software engineering South CarolinaColumbia Southern Railway (U.S.) Synchronization Temporal automata Transaction systems (Computer systems) Trees (Graph theory) Turing machines
Alternative Names
Lynch, N. 1948
Lynch, N. A. 1948
Lynch, Nancy.
Lynch, Nancy 1948
Lynch, Nancy A.
Lynch, Nancy Ann 1948
Nancy Lynch Amerikaans informatica
Nancy Lynch amerikansk informatikar
Nancy Lynch amerikansk informatiker
Nancy Lynch chercheuse américaine
Nancy Lynch científica y profesora estadounidense
Nancy Lynch informatica statunitense
Nancy Lynch USamerikanische Informatikerin
Nancy Lynchová
نانسی لینچ دانشمند علوم کامپیوتر آمریکایی
ナンシー・リンチ
南希·林奇
Languages
Covers