|
 ABSTRACT
The concurrency of transactions executing on atomic data types can be enhanced through the use of semantic information about operations defined on these types. Hitherto, commutativity of operations has been exploited to provide enchanced concurrency while avoiding cascading aborts. We have identified a property known as recoverability which can be used to decrease the delay involved in processing noncommuting operations while still avoiding cascading aborts. When an invoked operation is recoverable with respect to an uncommitted operation, the invoked operation can be executed by forcing a commit dependency between the invoked operation and the uncommitted operation; the transaction invoking the operation will not have to wait for the uncommitted operation to abort or commit. Further, this commit dependency only affects the order in which the operations should commit, if both commit; if either operation aborts, the other can still commit thus avoiding cascading aborts. To ensure the serializability of transactions, we force the recoverability relationship between transactions to be acyclic. Simulation studies, based on the model presented by Agrawal et al. [1], indicate that using recoverability, the turnaround time of transactions can be reduced. Further, our studies show enchancement in concurrency even when resource constraints are taken into consideration. The magnitude of enchancement is dependent on the resource contention; the lower the resource contention, the higher the improvement.
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
|
|
| |
5
|
C. Beeri , P. A. Bernstein , N. Goodman , M. Y. Lai , D. E. Shasha, A concurrency control theory for nested transactions (Preliminary Report), Proceedings of the second annual ACM symposium on Principles of distributed computing, p.45-62, August 17-19, 1983, Montreal, Quebec, Canada
[doi> 10.1145/800221.806709]
|
| |
6
|
|
| |
7
|
BmMAr% K. P., JOSEPS, T. A. RAEUCHLE, T., AND EL-ABBAD~, A. Implementing fault-tolerant distributed objects. IEEE Trans. Softw. Eng. 11, 6 (June 1985), 520-530
|
| |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
CORDON, C. AND GARCIA-MOLINA, H. The performance of a concurrency mechanism that exploits semantic knowledge. In Fifth International Conference on Distributed Computing Systems (Denver, Colo., May 13-17, 1985), pp. 350-358.
|
| |
12
|
David J DeWitt , Randy H Katz , Frank Olken , Leonard D Shapiro , Michael R Stonebraker , David Wood, Implementation techniques for main memory database systems, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, June 18-21, 1984, Boston, Massachusetts
|
| |
13
|
|
| |
14
|
|
| |
15
|
HADZmACOS, V. Issues of fault tolerance in concurrent computations. Tech. Rep. 11-84, Harvard University, Aiken Computation Laboratory, Cambridge, Mass., June 1984.
|
| |
16
|
|
| |
17
|
|
| |
18
|
|
| |
19
|
|
| |
20
|
Moss, J. E.B. Nested Transactions: An approach to reliable distributed computing. Ph.D. thesis 260, MIT Cambridge, Mass., April 1981.
|
| |
21
|
J. Eliot B Moss , Nancy D. Griffeth , Marc H. Graham, Abstraction in recovery management, Proceedings of the 1986 ACM SIGMOD international conference on Management of data, p.72-83, May 28-30, 1986, Washington, D.C., United States
|
| |
22
|
|
| |
23
|
|
| |
24
|
|
| |
25
|
SINHA, M. AND NATARAJAN, N. A priority based distributed deadlock detection algorithm. IEEE Trans. Sofiw. Eng. 11, I (Jan. 1985), 67-80.
|
| |
26
|
|
| |
27
|
|
| |
28
|
|
| |
29
|
WmHL, W. Specification and implementation of atomic data types. Ph.D. Thesis MIT/LCS/TR-314, MIT, 545 Technology Square, Cambridge, Mass., March 1984.
|
| |
30
|
|
| |
31
|
|
CITED BY 41
|
|
|
|
|
|
|
|
|
|
|
SangKeun Lee , SoonYoung Jung , Chong-Sun Hwang, A new conflict relation for concurrency control and recovery in object-based databases, Proceedings of the fifth international conference on Information and knowledge management, p.288-295, November 12-16, 1996, Rockville, Maryland, United States
|
|
|
D. Agrawal , J. L. Bruno , A. El Abbadi , V. Krishnaswamy, Relative serializability (extended abstract): an approach for relaxing the atomicity of transactions, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.139-149, May 24-27, 1994, Minneapolis, Minnesota, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
SangKeun Lee , Chong-Sun Hwang , WonGye Lee, A uniform approach to global concurrency control and recovery in multidatabase environment, Proceedings of the sixth international conference on Information and knowledge management, p.51-58, November 10-14, 1997, Las Vegas, Nevada, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Rajeev Rastogi , Henry F. Korth , Abraham Silberschatz, Strict histories in object-based database systems, Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.288-299, May 25-28, 1993, Washington, D.C., United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Gang Luo , Jeffrey F. Naughton , Curt J. Ellmann , Michael W. Watzke, Locking protocols for materialized aggregate join views, Proceedings of the 29th international conference on Very large data bases, p.596-607, September 09-12, 2003, Berlin, Germany
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
REVIEW
"Margaret H. Dunham : Reviewer"
The recoverability of operations provides more concurrency than
commutativity, which in turn provides more concurrency than traditional
concurrency control techniques. Conventional concurrency control
techniques (such as two-phase locking) are
more...
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
H.2