Notes on data base operating systems

Gray, Jim

doi:10.1007/3-540-08755-9_9

Cited by 1,120 publications

(450 citation statements)

References 12 publications

Supporting

Mentioning

447

Contrasting

Unclassified

Order By: Relevance

“…An endto-end acknowledgement is still required for applications in which the action requested of the target host should be done only if similar actions requested of other hosts are successful. This kind of application requires a two-phase commit protocol [5,10,15], which is a sophisticated endto-end acknowledgement. Also, if the target application may either fail or refuse to do the requested action, and thus a negative acknowledgement is a possible outcome, an end-to-end acknowledgement may still be a requirement.…”

Section: Delivery Guaranteesmentioning

confidence: 99%

“…The two-phase-commit data update protocols of Gray [5], Lampson and Sturgis [10] and Reed [13] all use a form of end-to-end argument to justify their existence; they are end-to-end protocols that do not depend for correctness on reliability, FIFO sequencing, or duplicate suppression within the communication system, since all of these problems may also be introduced by other system component failures as well. Reed makes this argument explicitly in the second chapter of his Ph.D. thesis on decentralized atomic actions [14].…”

Section: History and Application To Other System Areasmentioning

confidence: 99%

See 1 more Smart Citation

End-to-end arguments in system design

Saltzer

Reed²,

Clark

1984

ACM Trans. Comput. Syst.

1,522

687

View full text Add to dashboard Cite

This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the end-to-end argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost of providing them at that low level. Examples discussed in the paper include bit error recovery, security using encryption, duplicate message suppression, recovery from system crashes, and delivery acknowledgement. Low level mechanisms to support these functions are justified only as performance enhancements.

show abstract

Section: Delivery Guaranteesmentioning

confidence: 99%

Section: History and Application To Other System Areasmentioning

confidence: 99%

End-to-end arguments in system design

Saltzer

Reed²,

Clark

1984

ACM Trans. Comput. Syst.

1,522

687

View full text Add to dashboard Cite

show abstract

“…A transaction's effects become permanent when it commits, its effects are discarded if it ubsorts, and a transaction that has neither committed nor aborted is uctiue. A standard commitment protocol (e.g., [15,311) aborts transactions interrupted by failures, and stable storage [26] ensures that the effects of committed transactions are not undone by later failures.…”

Section: Distributedmentioning

confidence: 99%

Concurrency versus availability: atomicity mechanisms for replicated data

Herlihy

1987

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

A replicated object is a typed data object that is stored redundantly at multiple locations to enhance availability.Most techniques for managing replicated data have a two-level structure: At the higher level, a replica-control protocol reconstructs the object's state from its distributed components, and at the lower level, a standard concurrency-control protocol synchronizes accesses to the individual components. This paper explores an alternative approach to managing replicated data by presenting two replication methods in which concurrency control and replica management are handled by a single integrated protocol. These integrated protocols permit more concurrency than independent protocols, and they allow availability and concurrency to be traded off: Constraints on concurrency may be relaxed if constraints on availability are tightened, and vice versa. In general, constraints on concurrency and availability cannot be minimized simultaneously.

show abstract

“…Distributed INGRES uses a two phase commit protocol [GRAY78,LAMP76]. Slaves send a "ready" message to the master when they are prepared to commit an update.…”

Section: Distributed Ingresmentioning

confidence: 99%

Performance analysis of distributed data base systems

Woodfill

Ranstrom

Kalash

et al. 1984

Performance Evaluation

View full text Add to dashboard Cite

In this paper we briefly present the design of a distributed relational data base system. Then, we discuss experimental observations of the performance of that system executing both short and long commands.Conclusions are also drawn concerning metrics that distributed query processing heuristics should attempt to minimize. Lastly, we comment on architectures which appear viable for distributed data base applications.

show abstract

Notes on data base operating systems

Cited by 1,120 publications

References 12 publications

End-to-end arguments in system design

End-to-end arguments in system design

Concurrency versus availability: atomicity mechanisms for replicated data

Performance analysis of distributed data base systems

Contact Info

Product

Resources

About