Atomic Transactions: In Concurrent and Distributed Systems

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $4.29
Usually ships in 1-2 business days
(Save 96%)
Other sellers (Hardcover)
  • All (9) from $4.29   
  • New (4) from $115.98   
  • Used (5) from $4.29   

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.

This book presents a framework for precise design and verification of distributed and concurrent systems that use atomic transactions as a high-level abstraction. The authors present the most useful algorithms for transaction processing in concurrent and distributed systems, and include a well-developed data processing case study.

Read More Show Less

Editorial Reviews

Booknews
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. Although atomic transactions appear to the user as single, indivisible units, the model described here permits transactions to be nested. Many important algorithms are presented which provide maximum concurrency for transaction processing without sacrificing data integrity. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

Meet 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

Read More Show Less

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
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)