Protocol considerations for software controlled access methods in distributed data bases

ABSTRACT

Access control to shared files in a distributed computing environment requires an efficient method of allocating file resources with local and remote user processes. While software controlled access methods are convenient from the user's point of view, they give rise to serious operational problems such as job interferences (deadlock situations) and critical race conditions. Two software controlled access schemes, one centralized and one distributed are described in this paper. A basic set of protocols is derived to illustrate the implementation aspects of each scheme in a given network environment. The two approaches are then evaluated in the light of several performance criteria.

REFERENCES

• 1: Booth, G.M., The use of distributed data bases in information network. Proceedings of the First Computer-Communication Conference, Washington, D.C., pp. 371-376, October 1972.
• 2: Mahmoud, S.A., and Riordon, J.S., Software controlled access methods in distributed data bases. Proceedings of CIPS annual Conference, Ottawa, Canada, June 1974.
• 3: Murphy, J.E., Resource allocation with interlock detection in a multitask system. Fall Joint Computer Conference Proceedings, Volume 33, pp. 1169-1176, 1968.
• 4: King, P.F., and Collmeyer, A.J., Data base Sharing - an efficient mechanism for supporting Concurrent Processes. AFIPS National Computer Conference Proceedings, pp. 271-275, 1973.
• 5: Everest, G.C., Concurrent update control and data base integrity. Data Base Management. North-Holland/American Elsevier, 1974, pp. 241-270.
• 6: Dennis J. Frailey, A practical approach to managing resources and avoiding deadlocks, Communications of the ACM, v.16 n.5, p.323-329, May 1973 [doi>10.1145/362041.362245]
• 7: Chandy, K.M., et al, Analytic models for rollback and recovery strategies in data base systems. IEEE Transactions on Software Engineering, March 1975, Volume SE.1, pp. 100-110.
• 8: A. N. Habermann, Prevention of system deadlocks, Communications of the ACM, v.12 n.7, p.373-ff., July 1969 [doi>10.1145/363156.363160]
• 9: Hebalkar, P., Deadlock-free resource sharing in asynchronous systems. Ph.D. Thesis, Electrical Engineering Department, MIT, Sept. 1970.
• 10: Samy Mahmoud , J. S. Riordon, Optimal allocation of resources in distributed information networks, ACM Transactions on Database Systems (TODS), v.1 n.1, p.66-78, March 1976 [doi>10.1145/320434.320449]
• 11: Carr, C.S., Crocker, S.D., and Cert, V.G., Host-to-Host communication protocol in the ARPA Network. Spring Joint Computer Communication Conference, Volume 36, N.J., 1970.
• 12: Kleinrock, L., Analytic and simulation methods in computer network design. Spring Joint Computer Conference, Volume 36, N.J. 1970.
• 13: Jackson, P.E., and Stubbs, C.D., A study of Multi-access Computer Communications. Proceedings of the AFIPS 1969 SJCC, Vol. 34, pp. 491-504.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Distributed databases

Additional Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.6 Security and Protection
          Subjects: Access controls

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.2 Physical Design
          Subjects: Access methods

General Terms:
Management