ACM Home Page
Please provide us with feedback. Feedback
Performance evaluation of semantics-based multilevel concurrency control protocols
Full text PdfPdf (1.36 MB)
Source International Conference on Management of Data archive
Proceedings of the 1990 ACM SIGMOD international conference on Management of data table of contents
Atlantic City, New Jersey, United States
Pages: 163 - 172  
Year of Publication: 1990
ISBN:0-89791-365-5
Also published in ...
Authors
B. R. Badrinath  Dept of Computer Science, Rutgers University, New Brunswick, NJ
Krithi Ramamritham  Dept of Computer and Information, University of Massachusetts, Amherst, MA
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 30,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/93597.98726
What is a DOI?

ABSTRACT

For next generation information systems, concurrency control mechanisms are required to handle high level abstract operations and to meet high throughput demands. The currently available single level concurrency control mechanisms for reads and writes are inadequate for future complex information systems. In this paper, we will present a new multilevel concurrency protocol that uses a semantics-based notion of conflict, which is weaker than commutativity, called recoverability. Further, operations are scheduled according to relative conflict, a conflict notion based on the structure of operations. Performance evaluation via extensive simulation studies show that with our multilevel concurrency control protocol, the performance improvement is significant when compared to that of a single level two-phase locking based concurrency control scheme or to that of a multilevel concurrency control scheme based on commutativity alone. Further, simulation studies show that our new multilevel concurrency control protocol performs better even with resource contention.


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.

1
2
 
3
 
4
Badnnath, B It. and Ramamrltham, K Performance evaluat,on of semant,cs-based multilevel concurrency control protocols Techmcal Report DCS-TR-261, Rutgets Umvermty, Department of Computer Sc,ence, December 1989
5
 
6
Been, C , Bernstem, P A, and Goodman, N A Model for Concurrency m Nested T~ansactlon Systems Techmeal Iteport CS-86-1, Hebrew Umvers, ty, Jerusalem, Israel, January 1986
7
 
8
 
9
10
 
11
Hadz,lacos, V Issues of fault tolerance ,n concurrent computatmns Techmcal Iteport 11-84, Harvard Umversity, Axken Computatmn laboratory, Cambridge, MA 02138, June 1984
12
 
13
14
 
15
Martin, B E Modehng concurrent act,wt,es wlth nested objects In Proceedings of the 7th raternarwhal conference on d,str~buted computing systems, pages 432-439, Berhn, Germany, September 1987
 
16
Mart,n, B E Scheduhng protocols for nested objects Techmcal Iteport CS-094, Department of Computer Sczence and Engmeenng, Umverslty of Cahforma, San Dxego, Calfforma, 1988
17
18
 
19
20
21
 
22
Sehnger, P, Gawhck, D , Gray, J , Krause, 3 , and Schrager, P Panel Discussion Issues m bmldmg large database systems In Proceedings of the A GM SIG- MOD international con/erence on management o} data, page 6, Chicago, Ilhnom, June 1988.
 
23
24
25

CITED BY  10

Collaborative Colleagues:
B. R. Badrinath: colleagues
Krithi Ramamritham: colleagues