Implementing recoverable requests using queues

  • Authors:

  • Philip A. Bernstein;Meichun Hsu;Bruce Mann

  • Affiliations:

  • Digital Equipment Corp, One Kendall Square - Building 700, Cambridge, MA;Aiken Computation Lab , Harvard Univ., Cambridge, MA;Digital Equipment Corp , 110 Spit Brook Road, Nashua, NH

  • Venue:
  • SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
  • Year:
  • 1990

Quantified Score

Hi-index 0.02

Visualization

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.