| Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics |
| Full text |
Pdf
(1.01 MB)
|
| Source
|
Journal of the ACM (JACM)
archive
Volume 31 , Issue 4 (October 1984)
table of contents
Pages: 855 - 878
Year of Publication: 1984
ISSN:0004-5411
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 27, Citation Count: 20
|
|
|
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
|
Forest Baskett , K. Mani Chandy , Richard R. Muntz , Fernando G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM (JACM), v.22 n.2, p.248-260, April 1975
[doi> 10.1145/321879.321887]
|
| |
2
|
BRUELL, S C., AND BALBO, G.Computational algorithms for closed queueing networks, Elsevier North-Holland, New York, 1980.
|
 |
3
|
|
| |
4
|
COOPER, R. B.lntroductton to Queuemg Theory 2d ed. Elsevier North-Holland, New York, 1981.
|
 |
5
|
|
| |
6
|
KAUFMAN, J S. Blocking m a shared resource environment. IEEE Trans Commun. COM-29, 10 (Oct. 1981), 1474-1481.
|
| |
7
|
KELLY, F.P. Reversibility and Stochastic Networks. Wtley, New York, 1980.
|
 |
8
|
|
| |
9
|
OLVER, F. W. J. Introduction to Asymptozics and Special Functions. Academic Press, New York, 1974.
|
 |
10
|
|
 |
11
|
|
| |
12
|
RIORDAN, J.Stochastic Servtce Systems Wiley, New York, 1962.
|
| |
13
|
ROBERTS, J. W.Teletraffic models for the telecom I integrated servme network in Proceedings of the lnternatlonal Teletraffic Congress, Session 1.1, Paper 2, Montreal, 1983.
|
| |
14
|
SHUM, A.W., AND SPIRAKIS, P.G.Performance analysis of concurrency control methods in database systems. In Performance '81, F. J. Kylstra, Ed. Elsevier North-Holland, New York, 1981, pp. 1-19.
|
| |
15
|
Sz~Go, G.Orthogonal Polynomials Colloquium Publications, vol. XXIII. American Mathematics Society, Providence, RI, 1959
|
| |
16
|
|
CITED BY 20
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Wei-hsing Wang , Meichun Hsu , Eugene Pinsky, Modeling hot spots in database systems (extended abstract), Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.82-91, May 29-31, 1991, Denver, Colorado, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
REVIEW
"Pieter S Kritzinger : Reviewer"
The model on which the authors base their analysis of database locking uses for
its definition of a transaction an enumeration of the lockable entities on the
access path of the transaction. It is assumed that there are a total of N>
s
more...
|