Pat Helland
Abstract
This article explores and names some of the practical approaches used in the implementation of large-scale mission-critical applications in a world that rejects distributed transactions. Topics include the management of fine-grained pieces of application data that may be repartitioned over time as the application grows. Design patterns support sending messages between these repartitionable pieces of data.
- Bernstein, P. A., Hadzilacos, V., Goodman, N. 1987. Concurrency Control and Recovery in Database Systems. Boston, MA: Addison-Wesley. Google Scholar
Digital Library
- Corbett, J. C., et al. 2012. Spanner: Google's globally distributed database. Tenth Usenix Symposium on Operating Systems Design and Implementation (OSDI). Google ScholarDigital Library
- Dean, J., Ghemawat, S. 2004. MapReduce: simplified data processing on large clusters. Sixth Symposium on Operating Systems Design and Implementation (OSDI). Google ScholarDigital Library
- Gray, J. 1990. A census of Tandem Systems availability between 1985 and 1990. IEEE Transactions on Reliability 39(4): 409-418.Google ScholarCross Ref
- Lamport, L. 1998. The part-time parliament. ACM Transactions on Computer Systems 16(2): 133-169. Google ScholarDigital Library
- Ongaro, D., Ousterhout, J. 2014. In search of an understandable consensus algorithm (extended version); https://raft.github.io/raft.pdf.Google Scholar
- Wachter, H., Reuter, A. 1992. The ConTract Model. In Database Transaction Models for Advanced Applications: 219-263. San Francisco, CA: Morgan Kaufmann. Google ScholarDigital Library
Recommendations
Extracting more concurrency from distributed transactions
OSDI'14: Proceedings of the 11th USENIX conference on Operating Systems Design and ImplementationDistributed storage systems run transactions across machines to ensure serializability. Traditional protocols for distributed transactions are based on two-phase locking (2PL) or optimistic concurrency control (OCC). 2PL serializes transactions as soon ...
Implementing Distributed Read-Only Transactions
This paper presents an efficient scheme for eliminating conflicts between distributed read-only transactions and distributed update transactions, thereby reducing synchronization delays. The scheme makes use of a multiversion mechanism in order to ...
Comments