Atomic Transactions: In Concurrent and Distributed Systems

Atomic Transactions: In Concurrent and Distributed Systems

ISBN-10:
155860104X
ISBN-13:
9781558601048
Pub. Date:
08/01/1993
Publisher:
Elsevier Science
ISBN-10:
155860104X
ISBN-13:
9781558601048
Pub. Date:
08/01/1993
Publisher:
Elsevier Science
Atomic Transactions: In Concurrent and Distributed Systems

Atomic Transactions: In Concurrent and Distributed Systems

Hardcover

$117.0
Current price is , Original price is $117.0. You
$117.00 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Overview

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.


Product Details

ISBN-13: 9781558601048
Publisher: Elsevier Science
Publication date: 08/01/1993
Series: The Morgan Kaufmann Series in Data Management Systems
Pages: 476
Product dimensions: 1.19(w) x 10.00(h) x 7.00(d)

About the Author

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, AT&T

William E. Weihl, Massachusetts Institute of Technololgy

Alan Fekete, University of Sydney

Table of Contents

1. Introduction
2 An Automation Model
3 Serial Systems and Correctness
4 Special Classes of Serial Systems
5 The Atomicity Theorem
6 Locking Algorithms
7 Timestamp Algorithms
8 Hybrid Algorithms
9 Relationship to the Classical Theory
10 Optimistic Algorithms
11 Orphan Management Algorithms
12 Replication
A Mathematical Concepts
From the B&N Reads Blog

Customer Reviews