ALSB76

Peter A. Alsberg , John D. Day, A principle for resilient sharing of distributed resources, Proceedings of the 2nd international conference on Software engineering, p.562-570, October 13-15, 1976, San Francisco, California, United States

ANDE76

T. Anderson , R. Kerr, Recovery blocks in action: A system supporting high reliability, Proceedings of the 2nd international conference on Software engineering, p.447-457, October 13-15, 1976, San Francisco, California, United States

ANDE78

ANDERSON, T., LEE, P. A., AND SHRIVAS- TAVA, S.K. "A model of recoverability in multilevel systems," IEEE Trans. Softw. Eng. SE-4, 6 (Nov. 1978), 486-494. The issues involved in supporting backward error recovery for abstract objects m layered multilevel interpretive systems are examined. Two recovery schemes (disjoint and inclusive) are presented for implementing recoverable objects

BART77

BARTLETT, J.F., "A 'non stop' operating system," Tandem Computers Inc., Cupertino, Calif., 1977. The design of Guardian, the operating system for a fault-tolerant, general-purpose, multiple-computer commercial system, is discussed. Guardian ts constructed from processes which communicate via messages. Fault tolerance is achieved by duplicating hardware and software components and checkpointing state changes so that a backup process may take over in the case of a failure.

BERN78

BERNSTEIN, P. A., ROTHNIE, J. B. JR., GOODMAN, N., AND PAPADIMITRIOU, C. A. "The concurrency control mechanism of SDD-I: A system for distributed databases. (the fully redundant case)," IEEE Trans. Soflw. Eng. SE-4, 3 (May 1978), 154-168. This paper describes a method for updating data stored redundantly in a network of database management systems. The overhead of always locking all copies of data being updated is avoided by predefining transaction classes that require different levels of synchronization

BERN79

BERNSTEIN, P A., SHIPMAN, D. W., AND WONG, W.S. "Formal aspects of senallzability in database concurrency control," IEEE Trans. Soflw. Eng. SE-5, 3 (May 1979), 203-216. A formal model based on the use of a log of transaction read and write steps is developed for analyzing and comparing the behavior of different database concurrency control mechanisms. A simple centralized system that permits one read operation and one write operation per transaction is assumed for the analysis. Several proposed mechanisms that do not explicitly lock entities are shown to be equivalent to locking but to allow less concurrency than the conflict analysis method used in SDD-1

BERN80a

Philip A. Bernstein , David W. Shipman, The correctness of concurrency control mechanisms in a system for distributed databases (SDD-1), ACM Transactions on Database Systems (TODS), v.5 n.1, p.52-68, March 1980  [doi>10.1145/320128.320133]

BERN80b

Philip A. Bernstein , David W. Shipman , James B. Rothnie, Jr., Concurrency control in a system for distributed databases (SDD-1), ACM Transactions on Database Systems (TODS), v.5 n.1, p.18-51, March 1980  [doi>10.1145/320128.320131]

COFF71

E. G. Coffman , M. Elphick , A. Shoshani, System Deadlocks, ACM Computing Surveys (CSUR), v.3 n.2, p.67-78, June 1971  [doi>10.1145/356586.356588]

DENN76

Peter J. Denning, Fault Tolerant Operating Systems, ACM Computing Surveys (CSUR), v.8 n.4, p.359-389, Dec. 1976  [doi>10.1145/356678.356680]

ECKH78

ECKHOUSE, R. H. JR., AND STANKOVIC, J.A. "Issues in distributed processing-- An overview of two workshops," Computer 11, 1 (Jan. 1978), 22-26. A summary Gf two workshops on distributed computing held at Brown University m 1976 and 1977. The workshops had three broadly defined goals: (1) to define the field of distributed processing more precisely, (2) to examine the state of the art, and (3) to identify problem areas for future research.

ELLI77

ELLIS, C. "A robust algorithm for updating duplicate databases," in Proc. 2nd Berkeley Workshop on Distributed Management of Data and Computer Networks," Berkeley, Calif., May 1977, pp. 146-158. Two algorithms, centralized and decentralized, for updating a distributed multiple copy database are formally specified using evaluation nets, a modified form of Petri net. The decentralized solution is robust with respect to node failure.

ENSL78

ENSLOW, P. H. JR. "What is a 'distributed' data processing system?" Computer 11, 1 (Jan. 1978), 13-21. Since the term "distributed processing" has become overused and misused, this paper is an attempt to specify the characteristics of a new class of systems to be called "distributed data processing systems." These systems are characterized along three dimensions: hardware decentralization, control decentralization, and database decentralization. The systems of interest exhibit a high degree of distribution in all dimensions, as well as a high degree of cooperative autonomy in their overall operation.

ESWA76

K. P. Eswaran , J. N. Gray , R. A. Lorie , I. L. Traiger, The notions of consistency and predicate locks in a database system, Communications of the ACM, v.19 n.11, p.624-633, Nov. 1976  [doi>10.1145/360363.360369]

GARC78

GARCIA-MOLINA, H. "Performance comparison of two update algorithms for distributed databases," m Proc. 3rd Berkeley Workshop on D~str~buted Data Manage. ment and Computer Networks, Berkeley, Calif., 1978, pp. 108-119. A detailed set of simulations is used to compare the performance of two update algorithms: centralized locking and distributed voting. The database is assumed to be fully replicated at each site, and updates are the only access operations. The results show that centralized locking performs considerably better than distributed voting on a wide variety of measures except in highload cases where both perform poorly.

GARC79

GARCIA-MOLINA, H. "A concurrency control mechanism for distributed databases which uses centralized locking controllers," m Proc. 4th Berkeley Conf. D~stributed Data Management and Computer Networks, Berkeley, Calif., Aug. 1979, pp. 113-124. A concurrency control mechamsm based on independent centralized controllers which operate without explicit backup is proposed. A modified two-phase commit protocol that requires only a majority of acknowledgments from copies is used to perform updates.

GLIG80

GLIGOR, V. D., AND SHATTUCK, S. H. "On deadlock detection in distributed systems," IEEE Trans. Soflw. Eng. SE-6, 5 (Sept. 1980), 435-440. A counterexample ts used to show that one of the two deadlock detection protocols proposed by Menasce and Muntz {MESA79}, the distributed protocol, is incorrect. Furthermore, it is argued that even a corrected version of this or any similar distributed protocol will be impractical due to performance considerations.

GRAY75

GRAY, J. N., LORIE, R. A., AND PUTZOLU, G.R. "Granularity of locks in a shared data base," in Proc Int. Conference Very Large Data Bases, Sept. 1975, vol. 1, no. 1, pp. 428-451. A method for locking sets of resources described by tree and directed acychc graph hierarchies is presented. The protocol allows simultaneous locking at various granularities and is based on the introduction of additional lock modes that are assigned to the ancestor nodes.

GRAY79

Jim Gray, Notes on Data Base Operating Systems, Operating Systems, An Advanced Course, p.393-481, January 1978

HAMM78

HAMMER, M., AND SHIPMAN, D. "An overview of reliability mechanisms for a distributed data base system," in COMP. CON Spring "78 Proc, Feb. 1978, pp. 63- 65. Mechanisms to create a rehable network that guarantees the eventual delivery of messages and the broadcast of messages to a number of sites are discussed. This approach is being used to support the redundant update mechanisms of SDD-1, a distributed database system being designed and implemented by the Computer Corporation of America.

JONE79

Anita K. Jones, The Object Model: A Conceptual Tool for Structuring Software, Operating Systems, An Advanced Course, p.7-16, January 1978

KATZ77

KATZMAN, J.A. "A fault-tolerant computing system," Tandem Computers, inc., Cupertino, Calif., 1977. The hardware architecture of a fault-tolerant commercially available computer system is described. The design goals were (I) to provide continuous operation through any single hardware failure, and (2) to be able to repair failures while the system remains on-hne.

LAGA79

Klaus Lagally, Synchronization in a Layered System, Operating Systems, An Advanced Course, p.252-281, January 1978

LAMP78

Leslie Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, v.21 n.7, p.558-565, July 1978  [doi>10.1145/359545.359563]

LAMP76

LAMPSON, B. W., AND STURGIS, H. E "Crash recovery in a distributed storage system," unpublished paper, Computer Science Lab., Xerox Palo Alto Research Center, Palo Alto, Calif., 1976. An algorithm for maintaining the consistency of a distributed file system in the presence of individual crashes is presented. The algorithm is based on the use of an "intentions list" to implement atomic transactions.

LAMP79

LAMPSON, B. W., AND STURGIS, H. E. "Crash recovery in a distributed storage system," unpublished paper, Computer Scmnce Lab., Xerox Palo Alto Research Center, Palo Alto, Calif., 1979. A revised and expanded algorithm is presented for maintaining the consistency and reliable storage of data in a distributed system when different portions of the database are updated as a single transaction. The approach is based on implementing a hierarchy of abstract machines.

LEDG77

Henry F. Ledgard , Robert W. Taylor, Two views of data abstraction, Communications of the ACM, v.20 n.6, p.382-384, June 1977  [doi>10.1145/359605.359613]

LELA78

LE LANN, G. "Alg~;rithms for distributed data-sharing systems which use tickets," in Proc. 3rd Berkeley Workshop on Dis. trtbuted Data Management and Computer Networks, Berkeley, Calif., Aug. 1978, pp. 259-272. A virtual ring with ctrculating tickets is proposed as a solution to the problem of synchronizing access to shared data m a distributed system. Four distributed algorithms are described for acquinng tickets. The scheme is shown to survive failures of the ring controllers.

LEUN79

LEUNG, J. Y. T., AND LAI, E. K. "On minimum cost recovery from system deadlock," IEEE Trans. Comput. C-28, 9 (Sept 1979), 671-677. Under the assumptlon that the cost of aborting each member of a set of deadlocked jobs is known, the problem of selectmg a minimum total cost deadlock breaking set is shown to be NP-complete. Three fast heuristics are proposed, and their worst case performance is analyzed.

LIN79

LIN, W. K. "Concurrency control in a multiple copy distributed database system," m Proc. 4th Berkeley Conf. Distributed Data Management and Computer Networks, Berkeley, Calif., Aug. 1979, pp. 207-220. Modifications to the concurrency control mechanism of SDD-1 are proposed which elnninate the need for timestamps on data items and weaken the constraints of some of the read-write protocols.

LOME77

D. B. Lomet, Process structuring, synchronization, and recovery using atomic actions, Proceedings of an ACM conference on Language design for reliable software, p.128-137, March 28-30, 1977, Raleigh, North Carolina

LORI77

Raymond A. Lorie, Physical integrity in a large segmented database, ACM Transactions on Database Systems (TODS), v.2 n.1, p.91-104, March 1977  [doi>10.1145/320521.320540]

MENA78

Daniel A. Menasce , Gerald J. Popek , Richard R. Muntz, A locking protocol for resource coordination in distributed databases, Proceedings of the 1978 ACM SIGMOD international conference on management of data, May 31-June 02, 1978, Austin, Texas  [doi>10.1145/509252.509256]

MENA79

MENASCE, D. A., AND MUNTZ, R. R. "Locking and deadlock detection in distributed data bases," IEEE Trans. Softw. Eng. SE-5, 3 (May 1979), 195-201. Two protocols for deadlock detectmn based on the detection of cycles in the transactionwait-for graph are presented and analyzed. The first is based on a hierarchy of lock controllers and the second on a partitioning of the resources by decentralized local controllers.

MILE79

Milan Milenkovic, Update synchronization in multiaccess database systems., 1979

PAPA79

Christos H. Papadimitriou, The serializability of concurrent database updates, Journal of the ACM (JACM), v.26 n.4, p.631-653, Oct. 1979  [doi>10.1145/322154.322158]

PEEB78

PEEBLES, R., AND MANNING, E. "System architecture for distributed data management," Computer 11, 1 (Jan. 1978), 40-47. The architectures for dtstmbuteri data management systems are classifted as either (1) integrated or loosely coupled multlprocessors, (2) homogeneous federation, or (3) heterogeneous federation. Five fundamental problems that must be addressed by any data management system are then discussed: (1) how to provide an integrated database, (2) where to store data m the system, (3) how to locate data, (4) how to control concurrent access, and (5) how to provide security and integrity.

PEEB80

PEEBLES, R., AND DOPIRAK, T. "ADAPT: A guest system," in COMP. CON Spring "80 Proc., Feb. 1980. This paper describes the kernel of a chstributed operating system that runs on top of existing single host operating systems that are networked together. The purpose of the kernel is to transform the network of individual systems into a single unified system that will be easier for application programmers to use.

RAND75

RANDELL, B. "System structure for software fault tolerance." IEEE Trans Softw. Eng. SE-1, 2 (June 1975), 220-232. A method of achieving software fault tolerance by means of standby sparing ~s proposed. The goal is to provide dependable error detection and recovery facihties by using a system structuring techmque called the recovery block, which is used to specify an acceptance test and alternate spare program components. Reliable systems are implemented by building multilevel interpretive virtual machines.

RAND78

B. Randell , P. Lee , P. C. Treleaven, Reliability Issues in Computing System Design, ACM Computing Surveys (CSUR), v.10 n.2, p.123-165, June 1978  [doi>10.1145/356725.356729]

RAND79

Brian Randell, Reliable Computing Systems, Operating Systems, An Advanced Course, p.282-391, January 1978

REED78

D. P. Reed, NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM, Massachusetts Institute of Technology, Cambridge, MA, 1978

REED79a

David P. Reed , Rajendra K. Kanodia, Synchronization with eventcounts and sequencers, Communications of the ACM, v.22 n.2, p.115-123, Feb. 1979  [doi>10.1145/359060.359076]

REED79b

David P. Reed, Implementing atomic actions on decentralized data (Extended Abstract), Proceedings of the seventh ACM symposium on Operating systems principles, p.163, December 10-12, 1979, Pacific Grove, California, United States  [doi>10.1145/800215.806584]

RIES79

Daniel R. Ries , Michael R. Stonebraker, Locking granularity revisited, ACM Transactions on Database Systems (TODS), v.4 n.2, p.210-227, June 1979  [doi>10.1145/320071.320078]

ROSE78

Daniel J. Rosenkrantz , Richard E. Stearns , Philip M. Lewis, II, System level concurrency control for distributed database systems, ACM Transactions on Database Systems (TODS), v.3 n.2, p.178-198, June 1978  [doi>10.1145/320251.320260]

ROTH80

J. B. Rothnie, Jr. , P. A. Bernstein , S. Fox , N. Goodman , M. Hammer , T. A. Landers , C. Reeve , D. W. Shipman , E. Wong, Introduction to a system for distributed databases (SDD-1), ACM Transactions on Database Systems (TODS), v.5 n.1, p.1-17, March 1980  [doi>10.1145/320128.320129]

RUSS77

David L. Russell, Process backup in producer-consumer systems, Proceedings of the sixth ACM symposium on Operating systems principles, p.151-157, November 16-18, 1977, West Lafayette, Indiana, United States

RYPK79

RYPKA, D. J., AND LUCIDO, A. P. "Deadlock detection and avoidance for shared logical resources," IEEE Trans. Softw. Eng. SE-5, 5 (Sept. 1979), 465-471. Modes are used to specify the manner m which processes may concurrently access logical resources. Mode compatibility is defined and used to specify deadlock detection and avoidance strategies.

SALT78

Jerome H. Saltzer, Research problems of decentralized systems with largely autonomous nodes, ACM SIGOPS Operating Systems Review, v.12 n.1, p.43-52, January 1978  [doi>10.1145/775323.775328]

SCHL76

SCHLAGETER, G. "The problem of lock by value in large data bases," Comput J. 19, 1 (Feb. 1976), 17-20. The concept of lock by value in multiple-access database systems is developed, and a lock system to support this approach is proposed. The problems of implementing lock by value are discussed.

SEVE76

Dennis G. Severance , Guy M. Lohman, Differential files: their application to the maintenance of large databases, ACM Transactions on Database Systems (TODS), v.1 n.3, p.256-267, Sept. 1976  [doi>10.1145/320473.320484]

SHAP78

SHAPIRO, R. M., AND MILLSTEIN, R. E. "Failure recovery in a distributed data base system," in COMPCON Spring '78 Proc., Feb. 1978, pp. 66-70. A mechanism for maintaining the consistency of redundant copies of a database in the event of a crash of one or more of the sites is presented. Each site maintains a recent update history which is used to restore the crashed site.

SHRI78

SHRIVASTAVA, S. K., AND BANATRE, J.P. "Reliable resource allocation between unreliable processes," IEEE Trans. Soflw. Eng. SE-4, 3 (May 1978), 230-241. Error recovery problems associated with interacting processes are discussed, and an argument for using separate recovery mechanisms for cooperative and competitive processes is put forward. A recovery mechanism based on new programming language features (recoverable monitors and ports) is developed for processes which compete for the use of shared resources. Tins work extends the recovery block approach.

SILB80

Abraham Silberschatz , Zvi Kedem, Consistency in Hierarchical Database Systems, Journal of the ACM (JACM), v.27 n.1, p.72-80, Jan. 1980  [doi>10.1145/322169.322176]

SMIT77a

John Miles Smith , Diane C. P. Smith, Database abstractions: aggregation, Communications of the ACM, v.20 n.6, p.405-413, June 1977  [doi>10.1145/359605.359620]

SMIT77b

John Miles Smith , Diane C. P. Smith, Database abstractions: aggregation and generalization, ACM Transactions on Database Systems (TODS), v.2 n.2, p.105-133, June 1977  [doi>10.1145/320544.320546]

STON79

STONEBRAKER, M. "Concurrency control and consistency of multiple copies of data in distributed INGRES," IEEE Trans. Softw. Eng. SE-5, 3 (May 1979), 180-194. Dmtributed INGRES is a proposed dmtributed version of a relational database system designed and implemented by researchers at the University of California, Berkeley. This paper describes the design philosophy and presents rough outlines of the algorithms proposed for concurrency control, consistency of multiple copies of data, and system crash recovery. Concurrency control is based on the use of local locking and deadlock controllers which cooperate with a centralized controller (the SNOOP) for global deadlock detection.

THOM79

Robert H. Thomas, A Majority consensus approach to concurrency control for multiple copy databases, ACM Transactions on Database Systems (TODS), v.4 n.2, p.180-209, June 1979  [doi>10.1145/320071.320076]

VERH78

Joost S. M. Verhofstad, Recovery Techniques for Database Systems, ACM Computing Surveys (CSUR), v.10 n.2, p.167-195, June 1978  [doi>10.1145/356725.356730]

WATS79

WATSON, R. W., AND FLETCHER, J. G. "An architecture for support of network operating system services," in Proc. 4th Berkeley Conf. on Distributed Data Management and Networks, Aug. 1979, pp. 18-50. It is argued that network architectures should be designed explicitly to support a coherent network operating system. The suggested model has three levels of protocol: an interprocess communication layer, a service support layer, and a layer of standard services.

WULF75

WULF, W.A. "Reliable hardware/software architecture," IEEE Trans. Soflw. Eng. SE-1, 2 (June 1975), 233-240. A strategy used to achieve reliability in a hardware/software system m discussed. The proposed approach is based on an extension of modular programming methodology to include dynamic error detection and recovery. Each module is responsible for maintaining the integrity of the abstraction it implements.

Won Kim, Highly available systems for database applications, ACM Computing Surveys (CSUR), v.16 n.1, p.71-98, March 1984

Panduranga Rao Adusumilli , Lawrence J. Osborne, An integrated solution for managing replicated data in distributed systems, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.351-357, February 14-16, 1993, Indianapolis, Indiana, United States

J. Walpole , G. S. Blair , J. Malik , J. R. Nicol, A unifying model for consistent distributed software development environments, ACM SIGPLAN Notices, v.24 n.2, p.183-190, Feb. 1989

Eric C. Cooper, Replicated procedure call, Proceedings of the third annual ACM symposium on Principles of distributed computing, p.220-232, August 27-29, 1984, Vancouver, British Columbia, Canada

Tein-Hsiang Lin , Kang G. Shin, Damage Assessment for Optimal Rollback Recovery, IEEE Transactions on Computers, v.47 n.5, p.603-613, May 1998

Susan B. Davidson , Hector Garcia-Molina , Dale Skeen, Consistency in a partitioned network: a survey, ACM Computing Surveys (CSUR), v.17 n.3, p.341-370, Sept. 1985

Maurice Herlihy, Dynamic quorum adjustment for partitioned data, ACM Transactions on Database Systems (TODS), v.12 n.2, p.170-194, June 1987

Salvatore T. March , Gary D. Scudder, On the selection of efficient record segmentations and backup strategies for large shared databases, ACM Transactions on Database Systems (TODS), v.9 n.3, p.409-438, Sept. 1984

Sue M. Zajac , Fred J. Maryanski, Reliable commit and optimistic concurrency control for dynamically reconfigurable distributed databases, Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems, p.137-145, December 1986, San Francisco, California, United States

Rakesh Agrawal , David J. Dewitt, Integrated concurrency control and recovery mechanisms: design and performance evaluation, ACM Transactions on Database Systems (TODS), v.10 n.4, p.529-564, Dec. 1985

Walt Kohler , Bao-Chyuan Jenq, CARAT: a testbed for the performance evaluation of distributed database systems, Proceedings of 1986 ACM Fall joint computer conference, p.1169-1178, November 1986, Dallas, Texas, United States

Ahmed Gheith , Karsten Schwan, CHAOSarc: kernel support for multiweight objects, invocations, and atomicity in real-time multiprocessor applications, ACM Transactions on Computer Systems (TOCS), v.11 n.1, p.33-72, Feb. 1993

Robyn R. Lutz , Johnny S. K. Wong, Detecting Unsafe Error Recovery Schedules, IEEE Transactions on Software Engineering, v.18 n.8, p.749-760, August 1992

Walter H. Kohler , Kenneth C. Wilner , John A. Stankovic, An experimental comparison of locking policies in a testbed database system, ACM SIGMOD Record, v.13 n.4, May 1983

Gregory R. Andrews , Fred B. Schneider, Concepts and Notations for Concurrent Programming, ACM Computing Surveys (CSUR), v.15 n.1, p.3-43, March 1983

David P. Reed, Surveyor's Forum: Recovering an Error, ACM Computing Surveys (CSUR), v.14 n.1, p.145-146, March 1982

John S. Keen , William J. Dally, Extended ephemeral logging: log storage management for applications with long lived transactions, ACM Transactions on Database Systems (TODS), v.22 n.1, p.1-42, March 1997

Thomas W. Malone , Kevin Crowston, The interdisciplinary study of coordination, ACM Computing Surveys (CSUR), v.26 n.1, p.87-119, March 1994

Sushil Jajodia , David Mutchler, Dynamic voting, ACM SIGMOD Record, v.16 n.3, p.227-238, Dec. 1987

Tobin J. Lehman , Michael J. Carey, A recovery algorithm for a high-performance memory-resident database system, ACM SIGMOD Record, v.16 n.3, p.104-117, Dec. 1987

James E. Archer, Jr. , Richard Conway , Fred B. Schneider, User Recovery and Reversal in Interactive Systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.1, p.1-19, Jan. 1984

S. Jajodia , David Mutchler, Dynamic voting algorithms for maintaining the consistency of a replicated database, ACM Transactions on Database Systems (TODS), v.15 n.2, p.230-280, June 1990

Patrick A. V. Hall, Adding database management to Ada, ACM SIGAda Ada Letters, v.II n.4, p.88-91, January/February 1983

S. Ram , R. E. Marsten, A Model for Database Allocation Incorporating a Concurrency Control Mechanism, IEEE Transactions on Knowledge and Data Engineering, v.3 n.3, p.389-395, September 1991

C. S. Raghavendra , V. K. P. Kumar , S. Hariri, Reliability Analysis in Distributed Systems, IEEE Transactions on Computers, v.37 n.3, p.352-358, March 1988

Paul J. Leach , Paul H. Levine , James A. Hamilton , Bernard L. Stumpf, The file system of an integrated local network, Proceedings of the 1985 ACM thirteenth annual conference on Computer Science, p.309-324, March 1985, New Orleans, Louisiana, United States

Arturo Crespo , Hector Garcia-Molina, Archival storage for digital libraries, Proceedings of the third ACM conference on Digital libraries, p.69-78, June 23-26, 1998, Pittsburgh, Pennsylvania, United States

A. Ciuffoletti, Error recovery in systems of communicating processes., Proceedings of the 7th international conference on Software engineering, p.6-17, March 26-29, 1984, Orlando, Florida, United States

Naser S. Barghouti , Gail E. Kaiser, Concurrency control in advanced database applications, ACM Computing Surveys (CSUR), v.23 n.3, p.269-317, Sept. 1991

B. Bhargava , J. Riedl, A Model for Adaptable Systems for Transaction Processing, IEEE Transactions on Knowledge and Data Engineering, v.1 n.4, p.433-449, December 1989

Maurice Herlihy, Concurrency versus availability: atomicity mechanisms for replicated data, ACM Transactions on Computer Systems (TOCS), v.5 n.3, p.249-274, Aug. 1987

S. Jajodia , D. Mutchler, A Hybrid Replica Control Algorithm Combining Static and Dynamic Voting, IEEE Transactions on Knowledge and Data Engineering, v.1 n.4, p.459-469, December 1989

B. E. Wojcik , Z. M. Wojcik, Sufficient Condition for a Communication Deadlock and Distributed Deadlock Detection, IEEE Transactions on Software Engineering, v.15 n.12, p.1587-1595, December 1989

Victor P. Nelson, Fault-Tolerant Computing: Fundamental Concepts, Computer, v.23 n.7, p.19-25, July 1990

Patrick A. V. Hall, Adding database management to Ada, ACM SIGMOD Record, v.13 n.3, p.13-17, April 1983

Jayant R. Haritsa , Krithi Ramamritham , Ramesh Gupta, The PROMPT Real-Time Commit Protocol, IEEE Transactions on Parallel and Distributed Systems, v.11 n.2, p.160-181, February 2000

Peter Triantafillou , David J. Taylor, VELOS: A New Approach for Efficiently Achieving High Availability in Partitioned Distributed Systems, IEEE Transactions on Knowledge and Data Engineering, v.8 n.2, p.305-321, April 1996

Augusto Ciuffoletti, Reliability versus cost: design of a probabilistic broadcast algorithm, Distributed Computing, v.7 n.3, p.115-127, March 1994

Peter Triantafillou , David J. Taylor, The Location-Based Paradigm for Replication: Achieving Efficiency and Availability in Distributed Systems, IEEE Transactions on Software Engineering, v.21 n.1, p.1-18, January 1995

Theo Haerder , Andreas Reuter, Principles of transaction-oriented database recovery, ACM Computing Surveys (CSUR), v.15 n.4, p.287-317, December 1983

Thomas A. Joseph , Kenneth P. Birman, Low cost management of replicated data in fault-tolerant distributed systems, ACM Transactions on Computer Systems (TOCS), v.4 n.1, p.54-70, Feb. 1986

Tom Rodden , Gordon Blair, CSCW and distributed systems: the problem of control, Proceedings of the second conference on European Conference on Computer-Supported Cooperative Work, p.49-64, September 25-27, 1991, Amsterdam, The Netherlands

Wojciech Cellary , Tadeusz Morzy, Locking with prevention of cyclic and infinite restarting in distributed database systems, Proceedings of the 11th international conference on Very Large Data Bases, p.115-126, August 21-23, 1985, Stockholm, Sweden

T. P. Daniell , R. C. Harding, Jr. , S. H. Nauckhoff, Dynamic replication, an overview, Proceedings of the May 16-19, 1983, national computer conference, May 16-19, 1983, Anaheim, California

Jun-Lin Lin , Margaret H. Dunham, A Survey of Distributed Database Checkpointing, Distributed and Parallel Databases, v.5 n.3, p.289-319, July 1997

Sushil Jajodia , David Mutchler, Enhancements to the Voting Algorithm, Proceedings of the 13th International Conference on Very Large Data Bases, p.399-406, September 01-04, 1987

Rex E. Gantenbein, An annotated bibliography of dependable distributed computing, ACM SIGOPS Operating Systems Review, v.26 n.2, p.60-81, April 1992

Maurice Blackman , Hugh Ryan, Issues and methods for practical distributed data processing applications: I, Proceedings of the June 7-10, 1982, national computer conference, June 07-10, 1982, Houston, Texas

Walter H. Kohler: colleagues