Atomic Transactions

1st Edition

In Concurrent and Distributed Systems



This book develops a theory for transactions that provides practical solutions for system developers, focusing on the interface between the user and the database that executes transactions. Atomic transactions are a useful abstraction for programming concurrent and distributed data processing systems. Presents many important algorithms which provide maximum concurrency for transaction processing without sacrificing data integrity. The authors include a well-developed data processing case study to help readers understand transaction processing algorithms more clearly. The book offers conceptual tools for the design of new algorithms, and for devising variations on the familiar algorithms presented in the discussions. Whether your background is in the development of practical systems or formal methods, this book will offer you a new way to view distributed systems.

Table of Contents

Atomic Transactions: In Concurrent and Distributed Systems
by Nancy Lynch, Michael Merritt, William Weihl and Alan Fekete
  • Foreward
  • Preface
  • 1. Introduction
    • 1.1 Distributed Systems
    • 1.2 Atomic Transactions for Distributed Systems
      • 1.2.1 Atomic Databases
      • 1.2.2 Transactions
      • 1.2.3 Nested Transactions
    • 1.3 Transaction-Processing Algorithms
      • 1.3.1 Locking
      • 1.3.2 Timestamps
      • 1.3.3 Optimistic Algorithms
      • 1.3.4 Replication
      • 1.3.5 Recovery
    • 1.4 Formal Models
      • 1.4.1 Why a Formal Model?
      • 1.4.2 An Operational Automation Model
      • 1.4.3 Correct Systems Simulate Serial System
    • 1.5 Comparisons with the Classical Theory
      • 1.5.1 Serializability
      • 1.5.2 Classical Treatment of Recovery
      • 1.5.3 Data Types and Nesting
      • 1.5.4 Operational versus Axiomatic Model
      • 1.5.5 A Finer Granularity of Analysis
    • 1.6 Contents of This Book
      • 1.6.1 The Basic Theory
      • 1.6.2 Fundamental Transaction-Processing Algorithms
      • 1.6.3 More Advanced Transaction-Processing Algorithms
    • 1.7 Bibliographic Notes
      • 1.7.1 Transactions
      • 1.7.2 Correctness Conditions
      • 1.7.3 Algorithms for Concurrency Control and Recovery
  • 2 An Automation Model
    • 2.1 Introduction


No. of pages:
© 1993
Morgan Kaufmann
Electronic ISBN:
Print ISBN:

About the authors

Nancy Lynch

About the author:
Nancy A. Lynch is a professor of electrical engineering and computer science at MIT and heads MIT's Theory of Distributed Systems research group. She is the author of numerous research articles about distributed algorithms and impossibility results, and about formal modeling and verification of distributed systems.

Michael Merritt

Michael Merritt, AT&T

William Weihl

William E. Weihl, Massachusetts Institute of Technololgy

Alan Fekete

Alan Fekete, University of Sydney