- ホーム
- > 洋書
基本説明
Presents a framework for precise design and verification of distributed and concurrent systems that use atomic transactions as a high-level abstraction.
Full Description
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.
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
