This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Distributed Commit Protocol for a Multicomputer System
May 1990 (vol. 39 no. 5)
pp. 718-724
ASCII Text
x 
 
P. Ancilotti, B. Lazzerini, C.A. Prete, M. Sacchi, "A Distributed Commit Protocol for a Multicomputer System," IEEE Transactions on Computers, vol. 39, no. 5, pp. 718-724, May, 1990.
 
 
BibTex
x
 
@article{ 10.1109/12.53589,
author = {P. Ancilotti and B. Lazzerini and C.A. Prete and M. Sacchi},
title = {A Distributed Commit Protocol for a Multicomputer System},
journal ={IEEE Transactions on Computers},
volume = {39},
number = {5},
issn = {0018-9340},
year = {1990},
pages = {718-724},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.53589},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - A Distributed Commit Protocol for a Multicomputer System
IS - 5
SN - 0018-9340
SP718
EP724
EPD - 718-724
A1 - P. Ancilotti,
A1 - B. Lazzerini,
A1 - C.A. Prete,
A1 - M. Sacchi,
PY - 1990
KW - distributed commit protocol; multicomputer system; programming environment; transactions; programming tool; distributed databases; distributed processing; programming environments; protocols; transaction processing.
VL - 39
JA - IEEE Transactions on Computers
ER -
 

A distributed commit protocol suitable for multicomputer systems is described. A general programming environment which provides transactions as a programming tool is discussed. This environment is expected to be more dynamic than a database management system; in particular, it is not known how many and which processes will participate in a specific transaction. Therefore, a model of completely distributed transactions, without any hierarchical structure among the participant processes or any centralized locus of control, is proposed.

[1] P. Ancilotti, A. Bertolino, and M. Fusani, "An approach to efficient distributed transactions,"Distributed Computing, no. 2, pp. 201- 212, 1988.
[2] P. Ancilotti and M. Fusani, "Support for transactions and recovery in CNET applications,"Computer Architecture Technical Committee Newsletter, IEEE Computer Society, pp. 87-96, June 1985.
[3] P. Ancilotti, B. Lazzerini, C. A. Prete, and M. Sacchi, "A proposal for distributed commitment and abort of multi-site transactions in a multimicroprocessor system," Safety of Computer Control System 1986 (Safecomp '86), Trends in Safe Real Time Computer Systems,Proc. Fifty IFAC Workshop, Sarlat, France, Oct. 14-17, 1986, pp. 63-66.
[4] T. Anderson and P. Lee,Fault Tolerant Principles and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1981.
[5] P. A. Bernstein, D. W. Shipman, and W. S. Wong, "Formal aspects of serializability in database concurrency control,"IEEE Trans. Software Eng., vol. SE-5, no. 3, pp. 203-216, May 1979.
[6] G. Bracha and S. Toueg, "A distributed algorithm for generalized deadlock detection," Dep. Comput. Sci., Cornell Univ. Tech. Rep. 83- 559, June 1983.
[7] D. D. Clark, K. T. Pogran, and D. P. Reed, "An introduction to local area networks,"Proc. IEEE, vol. 66, no. 11, Nov. 1978.
[8] E. Cooper, "Analysis of distributed commit protocols," inProc. SIGMOD Int. Conf. Management Data, June 1982.
[9] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The notions of consistency and predicate locks in a database system,"Commun. ACM, vol. 19, no. 11, pp. 624-633, Nov. 1976.
[10] H. Garcia-Molina and R. K. Abbot, "Reliable distributed database management,"Proc. IEEE, vol. 75, no. 5, pp. 601-620, May 1987.
[11] V. D. Gligor and S. H. Shattuck, "On deadlock detection in distributed systems,"IEEE Trans. Software Eng., vol. SE-6, no. 5, pp. 435- 440, Sept. 1980.
[12] B. Goldman, "Deadlock Detection in Computer Networks," Tech. Report MIT/ LCS/TR-185, MIT, Cambridge, Mass., Sept. 1977.
[13] J. N. Grayet al., "Granularity of locks and degrees of consistency in a shared database," IBM Res. Rep. RJ1654, Sept. 1975.
[14] J. Gray, "Notes on database operation systems," inOperating Systems: An Advanced Course(Lecture Notes in Computer Science, vol. 60) Berlin: Springer-Verlag, 1978.
[15] J. N. Gray, "The transaction concept: Virtues and limitations," inProc. 7th Int. Conf. Very Large Data Bases, Cannes, France, Sept. 1981, pp. 144-154.
[16] S. S. Isloor and T. A. Marsland, "The deadlock problem: An overview,"IEEE Comput. Mag., vol. 13, no. 9, pp. 58-78, Sept. 1980.
[17] J. M. Jaffe, "Parallel computation: Synchronization, scheduling and schemes," Ph.D. dissertation, Massachusetts Institute of Technology, Aug. 1979.
[18] E. Jensen, "Distributed control," inDistributed Systems--Architecture and Implementation, B. W. Lampson, M. Paul, and H. J. Siegert, Eds. New York: Springer-Verlag, 1981, pp. 175-190.
[19] K. Kummerie and M. Reiser, "Local area communication networks-- An overview,"J. Telecommun. Networks, vol. 1, no. 4, Winter 1982.
[20] B. W. Lampson and H. E. Sturgis, "Crash recovery in a distributed data storage system," Xerox PARC, Palo Alto, CA, Apr. 1975.
[21] B. Lampson, "Atomic transactions," inDistributed Systems: Architecture and Implementation(Lecture Notes in Computer Science, vol. 105). Berlin: Springer-Verlag, 1981, pp. 246-265.
[22] B. Lindsay, P. Selinger, C. Galtieri, J. Gray, R. Lorie, F. Putzolu, I. Traiger, and B. Wade, "Single and multi-site recovery facilities," inDistributed Data Bases, I. W. Draffa and F. Poole, Eds. Cambridge, MA: Cambridge University Press, 1980.
[23] B. Lindsay, L. Haas, C. Mohan, P. Wilms, and R. Yost, "Computation and communication in R*: A distributed database manager," inProc. 9th ACM Symp. Oper. Syst. Principles, Bretton Woods, Oct. 1983, pp. 1-2 (only extended abstract).
[24] B. Lindsay and C. Mohan, "Efficient commit protocols for the tree of processes model of distributed transactions," inProc. 2nd ACM Symp. Principles Distributed Comput; alsoOper. Syst. Rev., vol. 19, no. 2, pp. 40-52, Apr. 1985.
[25] D. A. Menasce and R. R. Muntz, "Locking and deadlock detection in distributed data bases,"IEEE Trans. Software Eng., vol. SE-5, no. 3, pp. 195-202, May 1979.
[26] R. M. Metcalfe and D. R. Boggs, "Ethernet: Distributed packet switching for local computer networks,"Commun. ACM, vol. 19, no. 7, pp. 395-404, 1976.
[27] C. Mohan, R. Strong, and S. Finkelstein, "Methods for distributed transaction commit and recovery using byzantine agreement within clusters of processes," inProc. 2nd ACM Symp. Principles Distrib. Computing, 1983, pp. 29-43.
[28] J. E. B. Moss,Nested Transactions, An Approach to Reliable Distributed Computing. Cambridge, MA: MIT Press, 1981.
[29] B. J. Nelson, "Remote procedure call," Rep. CMU-CS-81-119, Dep. Comput. Sci., Carnegie-Mellon Univ., May 1981.
[30] R. Obermarck, "Global deadlock detection algorithm," IBM Rep. RJ2845, June 1980.
[31] B. Randell, P.A. Lee, and P.C. Treleaven, "Reliability Issues in Computer System Design,"ACM Computing Surveys, Vol. 28, No. 2, Apr. 1978, pp. 123-165.
[32] S. K. Shrivastava and F. Panzieri, "The design of a reliable remote procedure call mechanism,"IEEE Trans. Comput., vol. C-31, pp. 692-697, July 1982.
[33] D. Skeen, "Nonblocking commit protocols," inProc. ACM SIGMOD Int. Conf. Management of Data, 1981, pp. 133-142.
[34] D. Skeen and M. Stonebraker, "A formal model of crash recovery in a distributed system,"IEEE Trans. Software Eng., vol. SE-9, no. 3, pp. 219-228, May 1983.

Index Terms:
distributed commit protocol; multicomputer system; programming environment; transactions; programming tool; distributed databases; distributed processing; programming environments; protocols; transaction processing.
Citation:
P. Ancilotti, B. Lazzerini, C.A. Prete, M. Sacchi, "A Distributed Commit Protocol for a Multicomputer System," IEEE Transactions on Computers, vol. 39, no. 5, pp. 718-724, May 1990, doi:10.1109/12.53589
Usage of this product signifies your acceptance of the Terms of Use.