ACM Home Page
Please provide us with feedback. Feedback
Parallelism and concurrency control performance in distributed database machines
Full text PdfPdf (1.56 MB)
Source International Conference on Management of Data archive
Proceedings of the 1989 ACM SIGMOD international conference on Management of data table of contents
Portland, Oregon, United States
Pages: 122 - 133  
Year of Publication: 1989
ISBN:0-89791-317-5
Also published in ...
Authors
Michael J. Carey  Univ of Wisconsin, Madison
Miron Livny  Univ. of Wisconsin, Madison
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 128,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/67544.66938
What is a DOI?

ABSTRACT

While several distributed (or 'shared nothing') database machines exist in the form of prototypes or commercial products, and a number of distributed concurrency control algorithms are available, the effect of parallelism on concurrency control performance has received little attention. This paper examines the interplay between parallelism and transaction performance in a distributed database machine context. Four alternative concurrency control algorithms are considered, including two-phase locking, wound-wait, basic timestamp ordering, and optimistic concurrency control. Issues addressed include how performance scales as a function of machine size and the degree to which partitioning the database for intra-transaction parallelism improves performance for the different algorithms. We examine performance from several perspectives, including response time, throughput, and speedup, and we do so over a fairly wide range of system loads. We also examine the performance impact of certain important overhead factors (e.g., communication and process initiation costs) on the four alternative concurrency control algorithms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

Agra87a
 
Agra87b
Alex88
 
Bada79
Badal, D., "Correctness of Concurrency Control and Implications in Distributed Databases," Proc. COMPSAC '79 Conf., Chicago, IL,, Nov. 1979.
Balt82
 
Bern80
Bemstein, P., and Goodman, N., 'q'imestamp-Based Algorithms for Concurrency Control in Distributed Database Systems," Proc. 6th VLDB Conf., Mexico City, Mexico, Oct. 1980.
Bern81
 
Bhar82
Bhargava, B., "Performance Evaluation of the Optimistic Approach to Distributed Database Systems and its Comparison to Locking," Proc. 3rd lnt'l. Conf. on Dist. Comp. Sys., Miami, FL, October 1982.
 
Bhid88
 
Bora88
Boral, H., "Parallelism and Data Management," Proc. 3rd Int'l Conf. on Data and Knowledge Bases, Jerusalem, Israel, June 1988.
Borr88
 
Care88
 
Care89
Carey, M., and Livny, M., Conflict Detection Trade. offs for Replicated Data, Tech. Rep. No. 826, Comp. Sci. Dept., Univ. of Wisconsin, Madison, Feb. 1988.
 
Ceri82
Ceri S., and Owicki, S., "On the Use of Optimistic Methods for Concurrency Control in Distributed Databases," Proc. 6th Berkeley Workshop on Dist. Data Mgmt. and Comp. Networks, Feb. 1982.
 
DeWi86
DeWi88
 
Gall82
 
Garc79
 
Gray79
 
Jenq89
 
Khos88
Khoshafian, S., and Valduriez, P., "Parallel Execution Strategies for Declustered Databases," in Database Machines and Knowledge Base Machines, M. Kitsuregawa and H. Tanaka, eds., Kluwer Academic Press, 1988.
 
Kohl85
Kohler, W., and Jenq, B., Performance Evaluation of Integrated Concurrency Control and Recovery Algorithms Using a Distributed Transaction Processing Testbed, Tech. Rep. No. CS-85-133, Dept. of Elec. and Comp. Eng., Univ. of Massachusetts, Amherst, 1985.
 
Lai88
Lai, M., Wilkinson, W., and Lanin, V., "Distributing the Optimistic Multiversioning Page Manager in the JASMIN Database Machine," in Database Machines and Knowledge Base Machines, M. Kitsuregawa and H. Tanaka, eds., Kluwer Academic Press, 1988.
Lazo86
 
Li87
 
Lin83
 
Livn88
Livny, M., DeNet User's Guide, Version 1.0, Comp. Sci. Dept., Univ. of Wisconsin, Madison, 1988.
 
Mena78
Menasce, D., and Muntz, R., "Locking and Deadlock Detection in Distributed Databases," Proc. 3rd Berkeley Workshop on Dist. Data Mgmt. and Comp. Networks, Aug. 1978.
 
Noe87
 
Oszu85
Reed83
 
Ries78
Ries, D., and Epstein, R., Evaluation of Distribution Criteria for Distributed Database Systems, ERL Memo. No. UCB/ERL M78/22, Univ. of California, Berkeley, May 1978.
 
Ries79
Ries, D., "The Effects of Concurrency Control on the Performance of a Distributed Data Management System," Proc. 4th Berkeley Workshop on Dist. Data Mgmt. and Comp. Networks, Aug. 1979.
Rose78
 
Schl81
Schlageter, G., "Optimistic Methods for Concurrency Control in Distributed Database Systems," Proc. 7th VLDB Conf., Cannes, France, Sept. 1981.
Sinh85
 
Ston79
Stonebraker, M., "Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES," IEEE Trans. on Softw. Eng. SE-5, 3, May 1979.
 
Ston86
Stonebraker, M., "The Case for Shared Nothing," Database Eng. 9, 1, March 1986.
Tand88
 
Tera85
Teradata DBC/1012 Data Base Computer Systems Manual, Release 13, Teradata Corp. Document No. C10-0001- 00, Feb. 1985.
Thom79
Trai82

CITED BY  9
 
 
 
 
 
 

Collaborative Colleagues:
Michael J. Carey: colleagues
Miron Livny: colleagues

Peer to Peer - Readers of this Article have also read: