Implementing recoverable requests using queues

ABSTRACT

Transactions have been rigorously defined and extensively studied in the database and transaction processing literature, but little has been said about the handling of the requests for transaction execution in commercial TP systems, especially distributed ones, managing the flow of requests is often as important as executing the transactions themselves. This paper studies fault-tolerant protocols for managing the flow of transaction requests between clients that issue requests and servers that process them. We discuss how to implement these protocols using transactions and recoverable queuing systems. Queuing systems are used to move requests reliably between clients and servers. The protocols use queuing systems to ensure that the server processes each request exactly once and that a client processes each reply at least once. We treat request-reply protocols for single-transaction requests, for multi-transaction requests, and for requests that require interaction with the display after the request is submitted.

REFERENCES

• Bernstein et al 87: Philip A. Bernstein , Vassco Hadzilacos , Nathan Goodman, Concurrency control and recovery in database systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1987
• Birrell and Nelson 84: Andrew D. Birrell , Bruce Jay Nelson, Implementing remote procedure calls, ACM Transactions on Computer Systems (TOCS), v.2 n.1, p.39-59, February 1984 [doi>10.1145/2080.357392]
• Black and Artsy 89: "Implementing Location Independent Invocation," Proc 9th Int 'l Conf on Dzst'd Computing Systems, June 1989, pp 550-559
• DEC 88: Digital Eqmpment Corp, DECmtact Transactmn Processmg System Apphcatzon Programming Guzde, Maynard, MA, 1988 Order Number AA-KZ03A-TE
• Garcia and Salem 87: Hector Garcia-Molina , Kenneth Salem, Sagas, Proceedings of the 1987 ACM SIGMOD international conference on Management of data, p.249-259, May 27-29, 1987, San Francisco, California, United States
• Gray 78: Jim Gray, Notes on Data Base Operating Systems, Operating Systems, An Advanced Course, p.393-481, January 1978
• Gray 80: Gray, J , "A Transaction Model," Techmcal Report R32895, IBM Research Laboratory, San Jose, CA, 1980
• Gray 81: Gray, J, "The Transaction Concept Virtues and Limitations" Proc Int'l Conf on VeT Large Data Bases, 1981, pp 144-154
• IBM 86: InternatlonM Business Machines, "CICS/OS/VS Intercommumcations Facilities Guide," Form SC33-0230, White Plains, N Y, 1986
• Jul et al 88: Eric Jul , Henry Levy , Norman Hutchinson , Andrew Black, Fine-grained mobility in the Emerald system, ACM Transactions on Computer Systems (TOCS), v.6 n.1, p.109-133, Feb. 1988 [doi>10.1145/35037.42182]
• Klein and Reuter 88: Klein, J and A Reuter, "MI- grating Transactions," Future Trends m Dzstr~buted Computer Systems m the 'gOs, Hong Kong, 1988
• Liskov et al 88: B. Liskov , T. Bloom , D. Gifford , R. Scheifler , W. Weihl, Communications in the mercury system, Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track, p.178-187, January 1988, Kailua-Kona, Hawaii, United States
• McGee 77: McGee, W C, "The Information Management System IMS/VS Part V Transaction Processlng Faclhtles," IBM Sys Journal, Vol 16, No 2 , 1977, pp 148-169
• Pausch 88: Randy F. Pausch , Al Spector, Adding input and output to the transactional model, 1988
• Tandem 89: Tandem Database Group - NonStop SQL: A Distributed, High-Performance, High-Availability Implementation of SQL, Proceedings of the 2nd International Workshop on High Performance Transaction Systems, p.60-104, September 28-30, 1987
• Wipfler 87: Arlene J. Wipfler, CICS: application development and programming, Macmillan Publishing Co., Inc., Indianapolis, IN, 1987
• Wipfler 89: Arlene J. Wipfler, Distributed processing in the CICS environment: a guide to MRO/ISC, Intertext Publications, Inc.,/McGraw-Hill, Inc., New York, NY, 1989

INDEX TERMS

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

Additional Classification:
  G. Mathematics of Computing
  G.m MISCELLANEOUS
      Subjects: Queueing theory**

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Transaction processing

General Terms:
Algorithms, Design, Reliability, Theory