Concurrent Programming: Algorithms, Principles, and Foundations

Size: px
Start display at page:

Download "Concurrent Programming: Algorithms, Principles, and Foundations"

Transcription

1 Concurrent Programming: Algorithms, Principles, and Foundations Algorithms, Principles, and Foundations Bearbeitet von Michel Raynal 1. Auflage Buch. xxxii, 516 S. Hardcover ISBN Format (B x L): 15,5 x 23,5 cm Gewicht: 979 g Weitere Fachgebiete > EDV, Informatik > Programmiersprachen: Methoden > Funktionale, logische, parallele und visuelle Programmierung Zu Leseprobe schnell und portofrei erhältlich bei Die Online-Fachbuchhandlung beck-shop.de ist spezialisiert auf Fachbücher, insbesondere Recht, Steuern und Wirtschaft. Im Sortiment finden Sie alle Medien (Bücher, Zeitschriften, CDs, ebooks, etc.) aller Verlage. Ergänzt wird das Programm durch Services wie Neuerscheinungsdienst oder Zusammenstellungen von Büchern zu Sonderpreisen. Der Shop führt mehr als 8 Millionen Produkte.

2 Contents Part I Lock-Based Synchronization 1 The Mutual Exclusion Problem Multiprocess Program The Concept of a Sequential Process The Concept of a Multiprocess Program Process Synchronization Processors and Processes Synchronization Synchronization: Competition Synchronization: Cooperation The Aim of Synchronization Is to Preserve Invariants The Mutual Exclusion Problem The Mutual Exclusion Problem (Mutex) Lock Object Three Families of Solutions Summary Bibliographic Notes Solving Mutual Exclusion Mutex Based on Atomic Read/Write Registers Atomic Register Mutex for Two Processes: An Incremental Construction A Two-Process Algorithm Mutex for n Processes: Generalizing the Previous Two-Process Algorithm Mutex for n Processes: A Tournament-Based Algorithm A Concurrency-Abortable Algorithm xi

3 xii Contents A Fast Mutex Algorithm Mutual Exclusion in a Synchronous System Mutex Based on Specialized Hardware Primitives Test&Set, Swap and Compare&Swap From Deadlock-Freedom to Starvation-Freedom Fetch&Add Mutex Without Atomicity Safe, Regular and Atomic Registers The Bakery Mutex Algorithm A Bounded Mutex Algorithm Summary Bibliographic Notes Exercises and Problems Lock-Based Concurrent Objects Concurrent Objects Concurrent Object Lock-Based Implementation A Base Synchronization Object: the Semaphore The Concept of a Semaphore Using Semaphores to Solve the Producer-Consumer Problem Using Semaphores to Solve a Priority Scheduling Problem Using Semaphores to Solve the Readers-Writers Problem Using a Buffer to Reduce Delays for Readers and Writers A Construct for Imperative Languages: the Monitor The Concept of a Monitor A Rendezvous Monitor Object Monitors and Predicates Implementing a Monitor from Semaphores Monitors for the Readers-Writers Problem Scheduled Wait Operation Declarative Synchronization: Path Expressions Definition Using Path Expressions to Solve Synchronization Problems A Semaphore-Based Implementation of Path Expressions Summary Bibliographic Notes Exercises and Problems

4 Contents xiii Part II On the Foundations Side: The Atomicity Concept 4 Atomicity: Formal Definition and Properties Introduction Computation Model Processes and Operations Objects Histories Sequential History Atomicity Legal History The Case of Complete Histories The Case of Partial Histories Object Composability and Guaranteed Termination Property Atomic Objects Compose for Free Guaranteed Termination Alternatives to Atomicity Sequential Consistency Serializability Summary Bibliographic Notes Part III Mutex-Free Synchronization 5 Mutex-Free Concurrent Objects Mutex-Freedom and Progress Conditions The Mutex-Freedom Notion Progress Conditions Non-blocking with Respect to Wait-Freedom Mutex-Free Concurrent Objects The Splitter: A Simple Wait-Free Object from Read/Write Registers A Simple Obstruction-Free Object from Read/Write Registers A Remark on Compare&Swap: The ABA Problem A Non-blocking Queue Based on Read/Write Registers and Compare&Swap A Non-blocking Stack Based on Compare&Swap Registers A Wait-Free Stack Based on Fetch&Add and Swap Registers

5 xiv Contents 5.3 Boosting Obstruction-Freedom to Stronger Progress in the Read/Write Model Failure Detectors Contention Managers for Obstruction-Free Object Implementations Boosting Obstruction-Freedom to Non-blocking Boosting Obstruction-Freedom to Wait-Freedom Mutex-Freedom Versus Loops Inside a Contention Manager Operation Summary Bibliographic Notes Exercises and Problems Hybrid Concurrent Objects The Notion of a Hybrid Implementation Lock-Based Versus Mutex-Free Operation: Static Hybrid Implementation Contention Sensitive (or Dynamic Hybrid) Implementation The Case of Process Crashes A Static Hybrid Implementation of a Concurrent Set Object Definition and Assumptions Internal Representation and Operation Implementation Properties of the Implementation Contention-Sensitive Implementations Contention-Sensitive Binary Consensus A Contention Sensitive Non-blocking Double-Ended Queue The Notion of an Abortable Object Concurrency-Abortable Object From a Non-blocking Abortable Object to a Starvation-Free Object Summary Bibliographic Notes Exercises and Problems Wait-Free Objects from Read/Write Registers Only A Wait-Free Weak Counter for Infinitely Many Processes A Simple Counter Object Weak Counter Object for Infinitely Many Processes A One-Shot Weak Counter Wait-Free Algorithm Proof of the One-Shot Implementation A Multi-Shot Weak Counter Wait-Free Algorithm

6 Contents xv 7.2 Store-Collect Object Store-Collect Object: Definition An Adaptive Store-Collect Implementation Proof and Cost of the Adaptive Implementation Fast Store-Collect Object Fast Store-Collect Object: Definition A Fast Algorithm for the store collectðþ Operation Proof of the Fast Store-Collect Algorithm Summary Bibliographic Notes Problem Snapshot Objects from Read/Write Registers Only Snapshot Objects: Definition Single-Writer Snapshot Object An Obstruction-Free Implementation From Obstruction-Freedom to Bounded Wait-Freedom One-Shot Single-Writer Snapshot Object: Containment Property Single-Writer Snapshot Object with Infinitely Many Processes Multi-Writer Snapshot Object The Strong Freshness Property An Implementation of a Multi-Writer Snapshot Object Proof of the Implementation Immediate Snapshot Objects One-Shot Immediate Snapshot Object: Definition One-Shot Immediate Snapshot Versus One-Shot Snapshot An Implementation of One-Shot Immediate Snapshot Objects A Recursive Implementation of a One-Shot Immediate Snapshot Object Summary Bibliographic Notes Problem

7 xvi Contents 9 Renaming Objects from Read/Write Registers Only Renaming Objects The Base Renaming Problem One-Shot Renaming Object Adaptive Implementations A Fundamental Result Long-Lived Renaming Non-triviality of the Renaming Problem A Splitter-Based Optimal Time-Adaptive Implementation A Snapshot-Based Optimal Size-Adaptive Implementation A Snapshot-Based Implementation Proof of the Implementation Recursive Store-Collect-Based Size-Adaptive Implementation A Recursive Renaming Algorithm An Example Proof of the Renaming Implementation Variant of the Previous Recursion-Based Renaming Algorithm A Renaming Implementation Based on Immediate Snapshot Objects An Example of a Renaming Execution Long-Lived Perfect Renaming Based on Test&Set Registers Perfect Adaptive Renaming Perfect Long-Lived Test&Set-Based Renaming Summary Bibliographic Notes Exercises and Problems Part IV The Transactional Memory Approach 10 Transactional Memory What Are Software Transactional Memories Transactions = High-Level Synchronization At the Programming Level STM System Speculative Executions, Commit and Abort of a Transaction An STM Consistency Condition: Opacity An STM Interface Incremental Reads and Deferred Updates

8 Contents xvii Read-Only Versus Update Transactions Read Invisibility A Logical Clock-Based STM System: TL Underlying System and Control Variables of the STM System Underlying Principle: Consistency with Respect to Transaction Birth Date The Implementation of an Update Transaction The Implementation of a Read-Only Transaction A Version-Based STM System: JVSTM Underlying and Control Variables of the STM System The Implementation of an Update Transaction The Implementation of a Read-Only Transaction A Vector Clock-Based STM System The Virtual World Consistency Condition An STM System for Virtual World Consistency The Algorithms Implementing the STM Operations Summary Bibliographic Notes Exercises and Problems Part V On the Foundations Side: From Safe Bits to Atomic Registers 11 Safe, Regular, and Atomic Read/Write Registers Safe, Regular, and Atomic Registers Reminder: The Many Faces of a Register From Regularity to Atomicity: A Theorem A Fundamental Problem: The Construction of Registers Two Very Simple Bounded Constructions Safe/Regular Registers: From Single-Reader to Multi-Reader Binary Multi-Reader Registers: From Safe to Regular From Bits to b-valued Registers From Safe Bits to b-valued Safe Registers From Regular Bits to Regular b-valued Registers From Atomic Bits to Atomic b-valued Registers

9 xviii Contents 11.4 Three Unbounded Constructions SWSR Registers: From Unbounded Regular to Atomic Atomic Registers: From Unbounded SWSR to SWMR Atomic Registers: From Unbounded SWMR to MWMR Summary Bibliographic Notes From Safe Bits to Atomic Bits: Lower Bound and Optimal Construction A Lower Bound Theorem Two Preliminary Lemmas The Lower Bound Theorem A Construction of an Atomic Bit from Three Safe Bits Base Architecture of the Construction Underlying Principle and Signaling Scheme The Algorithm Implementing the Operation R:writeðÞ The Algorithm Implementing the Operation R:readðÞ Cost of the Construction Proof of the Construction of an Atomic Bit A Preliminary Theorem Proof of the Construction Summary Bibliographic Notes Exercise Bounded Constructions of Atomic b-valued Registers Introduction A Collision-Free (Pure Buffers) Construction Internal Representation of the Atomic b-valued Register R Underlying Principle: Two-Level Switch to Ensure Collision-Free Accesses to Buffers The Algorithms Implementing the Operations R:writeðÞ and R:readðÞ Proof of the Construction: Collision-Freedom Correctness Proof A Construction Based on Impure Buffers Internal Representation of the Atomic b-valued Register R

10 Contents xix An Incremental Construction The Algorithms Implementing the Operations R:writeðÞ and R:readðÞ Proof of the Construction From SWSR to SWMR b-valued Atomic Register Summary Bibliographic Notes Part VI On the Foundations Side: The Computability Power of Concurrent Objects (Consensus) 14 Universality of Consensus Universal Object, Universal Construction, and Consensus Object Universal (Synchronization) Object and Universal Construction The Notion of a Consensus Object Inputs and Base Principles of Universal Constructions The Specification of the Constructed Object Base Principles of Universal Constructions An Unbounded Wait-Free Universal Construction Principles and Description of the Construction Proof of the Construction Non-deterministic Objects Wait-Freedom Versus Bounded Wait-Freedom A Bounded Wait-Free Universal Construction Principles of the Construction Proof of the Construction Non-deterministic Objects From Binary Consensus to Multi-Valued Consensus A Construction Based on the Bit Representation of Proposed Values A Construction for Unbounded Proposed Values Summary Bibliographic Notes Exercises and Problems The Case of Unreliable Base Objects Responsive Versus Non-responsive Crash Failures SWSR Registers Prone to Crash Failures Reliable Register When Crash Failures Are Responsive: An Unbounded Construction

11 xx Contents Reliable Register When Crash Failures Are Responsive: A Bounded Construction Reliable Register When Crash Failures Are Not Responsive: An Unbounded Construction Consensus When Crash Failures Are Responsive: A Bounded Construction The Parallel Invocation Approach Does Not Work A t-tolerant Wait-Free Construction Consensus When Crash Failures Are Not Responsive: An Impossibility Omission and Arbitrary Failures Object Failure Modes Simple Examples Graceful Degradation Fault-Tolerance Versus Graceful Degradation Summary Bibliographic Notes Exercises and Problems Consensus Numbers and the Consensus Hierarchy The Consensus Number Notion Fundamentals Schedule, Configuration, and Valence Bivalent Initial Configuration The Weak Wait-Free Power of Atomic Registers The Consensus Number of Atomic Read/Write Registers Is The Wait-Free Limit of Atomic Registers Objects Whose Consensus Number Is Consensus from Test&Set Objects Consensus from Queue Objects Consensus from Swap Objects Other Objects for Wait-Free Consensus in a System of Two Processes Power and Limit of the Previous Objects Objects Whose Consensus Number Is þ Consensus from Compare&Swap Objects Consensus from Mem-to-Mem-Swap Objects Consensus from an Augmented Queue From a Sticky Bit to Binary Consensus Impossibility Result

12 Contents xxi 16.6 Hierarchy of Atomic Objects From Consensus Numbers to a Hierarchy On Fault Masking Robustness of the Hierarchy Summary Bibliographic Notes Exercises and Problems The Alpha(s) and Omega of Consensus: Failure Detector-Based Consensus De-constructing Compare&Swap A Liveness-Oriented Abstraction: The Failure Detector X Definition of X X-Based Consensus: X as a Resource Allocator or a Scheduler Three Safety-Oriented Abstractions: Alpha 1, Alpha 2, and Alpha A Round-Free Abstraction: Alpha A Round-Based Abstraction: Alpha Another Round-Free Abstraction: Alpha The Rounds Seen as a Resource X-Based Consensus Consensus from Alpha 1 Objects and X Consensus from an Alpha 2 Object and X Consensus from an Alpha 3 Object and X When the Eventual Leader Elected by X Does Not Participate The Notion of an Indulgent Algorithm Consensus Object Versus X Wait-Free Implementations of the Alpha 1 and Alpha 2 Abstractions Alpha 1 from Atomic Registers Alpha 2 from Regular Registers Wait-Free Implementations of the Alpha 2 Abstraction from Shared Disks Alpha 2 from Unreliable Read/Write Disks Alpha 2 from Active Disks Implementing X The Additional Timing Assumption EWB An EWB-Based Implementation of X Proof of the Construction Discussion

13 xxii Contents 17.8 Summary Bibliographic Notes Exercises and Problems Afterword Bibliography Index

Discrete, Continuous, and Hybrid Petri Nets

Discrete, Continuous, and Hybrid Petri Nets Discrete, Continuous, and Hybrid Petri Nets Bearbeitet von René David, Hassane Alla 1. Auflage 2004. Buch. XXII, 570 S. Hardcover ISBN 978 3 540 22480 8 Format (B x L): 15,5 x 23,5 cm Gewicht: 2080 g Weitere

More information

X.media.publishing. Multimedia Systems. Bearbeitet von Ralf Steinmetz, Klara Nahrstedt

X.media.publishing. Multimedia Systems. Bearbeitet von Ralf Steinmetz, Klara Nahrstedt X.media.publishing Multimedia Systems Bearbeitet von Ralf Steinmetz, Klara Nahrstedt 1. Auflage 2004. Buch. xvi, 466 S. Hardcover ISBN 978 3 540 40867 3 Format (B x L): 17,8 x 23,5 cm Gewicht: 2510 g Weitere

More information

Enabling Flexibility in Process-Aware Information Systems

Enabling Flexibility in Process-Aware Information Systems Enabling Flexibility in Process-Aware Information Systems Challenges, Methods, Technologies Bearbeitet von Manfred Reichert, Barbara Weber 1. Auflage 2012. Buch. xviii, 518 S. Hardcover ISBN 978 3 642

More information

The Cinderella.2 Manual

The Cinderella.2 Manual The Cinderella.2 Manual Working with The Interactive Geometry Software Bearbeitet von Ulrich H Kortenkamp, Jürgen Richter-Gebert 1. Auflage 2012. Buch. xiv, 458 S. Hardcover ISBN 978 3 540 34924 2 Format

More information

IEC : Programming Industrial Automation Systems

IEC : Programming Industrial Automation Systems IEC 61131-3: Programming Industrial Automation Systems Concepts and Programming Languages, Requirements for Programming Systems, Decision-Making Aids Bearbeitet von Karl-Heinz John, Michael Tiegelkamp

More information

Applied Information Security

Applied Information Security Applied Information Security A Hands-on Approach Bearbeitet von David Basin, Patrick Schaller, Michael Schläpfer 1. Auflage 2011. Buch. xiv, 202 S. Hardcover ISBN 978 3 642 24473 5 Format (B x L): 15,5

More information

Payment Technologies for E-Commerce

Payment Technologies for E-Commerce Payment Technologies for E-Commerce Bearbeitet von Weidong Kou 1. Auflage 2003. Buch. IX, 334 S. Hardcover ISBN 978 3 540 44007 9 Format (B x L): 15,5 x 23,5 cm Gewicht: 1470 g Wirtschaft > Spezielle Betriebswirtschaft

More information

VLSI-Design of Non-Volatile Memories

VLSI-Design of Non-Volatile Memories VLSI-Design of Non-Volatile Memories Bearbeitet von Giovanni Campardo, Rino Micheloni, David Novosel 1. Auflage 2005. Buch. xxviii, 582 S. Hardcover ISBN 978 3 540 20198 4 Format (B x L): 15,5 x 23,5 cm

More information

Object-Process Methodology

Object-Process Methodology Object-Process Methodology A Holistic Systems Paradigm Bearbeitet von Dov Dori, E.F Crawley 1. Auflage 2002. Buch. xxv, 455 S. Hardcover ISBN 978 3 540 65471 1 Format (B x L): 15,5 x 23,5 cm Gewicht: 1890

More information

Springer Monographs in Mathematics. Set Theory. The Third Millennium Edition, revised and expanded. Bearbeitet von Thomas Jech

Springer Monographs in Mathematics. Set Theory. The Third Millennium Edition, revised and expanded. Bearbeitet von Thomas Jech Springer Monographs in Mathematics Set Theory The Third Millennium Edition, revised and expanded Bearbeitet von Thomas Jech 3rd rev. ed. Corr. 4th printing. Softcover version of original hardcover edition

More information

Model-Driven Design Using Business Patterns

Model-Driven Design Using Business Patterns Model-Driven Design Using Business Patterns Bearbeitet von Pavel Hruby 1. Auflage 2006. Buch. xvi, 368 S. Hardcover ISBN 978 3 540 30154 7 Format (B x L): 15,5 x 23,5 cm Gewicht: 1590 g Wirtschaft > Volkswirtschaft

More information

SCI: Scalable Coherent Interface

SCI: Scalable Coherent Interface Lecture Notes in Computer Science 1734 SCI: Scalable Coherent Interface Architecture and Software for High-Performance Compute Clusters Bearbeitet von Hermann Hellwagner, Alexander Reinefeld 1. Auflage

More information

Group-based Cryptography

Group-based Cryptography Group-based Cryptography Bearbeitet von Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov 1. Auflage 2008. Taschenbuch. xv, 183 S. Paperback ISBN 978 3 7643 8826 3 Format (B x L): 17 x 24 cm Gewicht:

More information

Model Driven Architecture and Ontology Development

Model Driven Architecture and Ontology Development Model Driven Architecture and Ontology Development Foreword by Bran Selic 1. Auflage 2006. Buch. XVIII, 312 S. Hardcover ISBN 978 3 540 32180 4 Format (B x L): 15,5 x 23,5 cm Zu Inhaltsverzeichnis schnell

More information

Handbook of Conceptual Modeling

Handbook of Conceptual Modeling Handbook of Conceptual Modeling Theory, Practice, and Research Challenges Bearbeitet von David W. Embley, Bernhard Thalheim 1. Auflage 2011. Buch. xix, 589 S. Hardcover ISBN 978 3 642 15864 3 Format (B

More information

A Study on Radio Access Technology Selection Algorithms

A Study on Radio Access Technology Selection Algorithms SpringerBriefs in Electrical and Computer Engineering A Study on Radio Access Technology Selection Algorithms Bearbeitet von Kumbesan Sandrasegaran, Leijia Wu 1. Auflage 2012. Taschenbuch. x, 33 S. Paperback

More information

Abstract Computing Machines

Abstract Computing Machines Texts in Theoretical Computer Science. An EATCS Series Abstract Computing Machines A Lambda Calculus Perspective Bearbeitet von Werner Kluge 1. Auflage 2005. Buch. xiv, 384 S. Hardcover ISBN 978 3 540

More information

Introduction to Reliable and Secure Distributed Programming

Introduction to Reliable and Secure Distributed Programming Introduction to Reliable and Secure Distributed Programming Bearbeitet von Christian Cachin, Rachid Guerraoui, Luís Rodrigues 1. Auflage 2011. Buch. xix, 367 S. Hardcover ISBN 978 3 642 15259 7 Format

More information

Ajax in Oracle JDeveloper

Ajax in Oracle JDeveloper Ajax in Oracle JDeveloper Bearbeitet von Deepak Vohra 1. Auflage 2008. Taschenbuch. xiv, 224 S. Paperback ISBN 978 3 540 77595 9 Format (B x L): 15,5 x 23,5 cm Gewicht: 373 g Weitere Fachgebiete > EDV,

More information

Michel Raynal. Distributed Algorithms for Message-Passing Systems

Michel Raynal. Distributed Algorithms for Message-Passing Systems Michel Raynal Distributed Algorithms for Message-Passing Systems Contents Part I Distributed Graph Algorithms 1 Basic Definitions and Network Traversal Algorithms... 3 1.1 DistributedAlgorithms... 3 1.1.1

More information

Introductory Operations Research

Introductory Operations Research Introductory Operations Research Theory and Applications Bearbeitet von Harvir Singh Kasana, Krishna Dev Kumar 1. Auflage 2004. Buch. XI, 581 S. Hardcover ISBN 978 3 540 40138 4 Format (B x L): 15,5 x

More information

Computational Biology

Computational Biology Computational Biology A Practical Introduction to BioData Processing and Analysis with Linux, MySQL, and R Bearbeitet von Röbbe Wünschiers 1. Auflage 2013. Buch. xxix, 449 S. Hardcover ISBN 978 3 642 34748

More information

UML The Unified Modeling Language, Modeling Languages and Applications

UML The Unified Modeling Language, Modeling Languages and Applications Lecture Notes in Computer Science 2863 UML 2003 -- The Unified Modeling Language, Modeling Languages and Applications 6th International Conference San Francisco, CA, USA, October 20-24, 2003, Proceedings

More information

Chapter 5 Concurrency: Mutual Exclusion. and. Synchronization. Operating Systems: Internals. and. Design Principles

Chapter 5 Concurrency: Mutual Exclusion. and. Synchronization. Operating Systems: Internals. and. Design Principles Operating Systems: Internals and Design Principles Chapter 5 Concurrency: Mutual Exclusion and Synchronization Seventh Edition By William Stallings Designing correct routines for controlling concurrent

More information

Chapter 5 Concurrency: Mutual Exclusion and Synchronization

Chapter 5 Concurrency: Mutual Exclusion and Synchronization Operating Systems: Internals and Design Principles Chapter 5 Concurrency: Mutual Exclusion and Synchronization Seventh Edition By William Stallings Designing correct routines for controlling concurrent

More information

Embedded Robotics. Mobile Robot Design and Applications with Embedded Systems. Bearbeitet von Thomas Bräunl

Embedded Robotics. Mobile Robot Design and Applications with Embedded Systems. Bearbeitet von Thomas Bräunl Embedded Robotics Mobile Robot Design and Applications with Embedded Systems Bearbeitet von Thomas Bräunl Neuausgabe 8. Taschenbuch. xiv, 56 S. Paperback ISBN 978 3 5 7533 8 Format (B x L): 7 x, cm Gewicht:

More information

Information Retrieval for Music and Motion

Information Retrieval for Music and Motion Information Retrieval for Music and Motion Bearbeitet von Meinard Müller. Auflage 07. Buch. xvi, 38 S. Hardcover ISBN 978 3 5 747 6 Format (B x L): 5,5 x 23,5 cm Gewicht: 6 g Weitere Fachgebiete > EDV,

More information

CONTENTS. Computer-System Structures

CONTENTS. Computer-System Structures CONTENTS PART ONE OVERVIEW Chapter 1 Introduction 1.1 What Is an Operating System? 3 1.2 Simple Batch Systems 6 1.3 Multiprogrammed Batched Systems 8 1.4 Time-Sharing Systems 9 1.5 Personal-Computer Systems

More information

Wireless Algorithms, Systems, and Applications

Wireless Algorithms, Systems, and Applications Lecture Notes in Computer Science 9204 Wireless Algorithms, Systems, and Applications 10th International Conference, WASA 2015, Qufu, China, August 10-12, 2015, Proceedings Bearbeitet von Kuai Xu, Haojin

More information

Guerrilla Capacity Planning

Guerrilla Capacity Planning Guerrilla Capacity Planning A Tactical Approach to Planning for Highly Scalable Applications and Services Bearbeitet von Neil J Gunther 1. Auflage 2006. Buch. xx, 253 S. Hardcover ISBN 978 3 540 26138

More information

Ruby on Rails for PHP and Java Developers

Ruby on Rails for PHP and Java Developers Ruby on Rails for PHP and Java Developers Bearbeitet von Deepak Vohra 1. Auflage 2007. Taschenbuch. xvi, 394 S. Paperback ISBN 978 3 540 73144 3 Format (B x L): 15,5 x 23,5 cm Gewicht: 629 g Weitere Fachgebiete

More information

To Everyone... iii To Educators... v To Students... vi Acknowledgments... vii Final Words... ix References... x. 1 ADialogueontheBook 1

To Everyone... iii To Educators... v To Students... vi Acknowledgments... vii Final Words... ix References... x. 1 ADialogueontheBook 1 Contents To Everyone.............................. iii To Educators.............................. v To Students............................... vi Acknowledgments........................... vii Final Words..............................

More information

IT 540 Operating Systems ECE519 Advanced Operating Systems

IT 540 Operating Systems ECE519 Advanced Operating Systems IT 540 Operating Systems ECE519 Advanced Operating Systems Prof. Dr. Hasan Hüseyin BALIK (5 th Week) (Advanced) Operating Systems 5. Concurrency: Mutual Exclusion and Synchronization 5. Outline Principles

More information

6.852: Distributed Algorithms Fall, Class 21

6.852: Distributed Algorithms Fall, Class 21 6.852: Distributed Algorithms Fall, 2009 Class 21 Today s plan Wait-free synchronization. The wait-free consensus hierarchy Universality of consensus Reading: [Herlihy, Wait-free synchronization] (Another

More information

CS 571 Operating Systems. Midterm Review. Angelos Stavrou, George Mason University

CS 571 Operating Systems. Midterm Review. Angelos Stavrou, George Mason University CS 571 Operating Systems Midterm Review Angelos Stavrou, George Mason University Class Midterm: Grading 2 Grading Midterm: 25% Theory Part 60% (1h 30m) Programming Part 40% (1h) Theory Part (Closed Books):

More information

Earth System Modelling - Volume 5

Earth System Modelling - Volume 5 SpringerBriefs in Earth System Sciences Earth System Modelling - Volume 5 Tools for Configuring, Building and Running Models Bearbeitet von Rupert Ford, Graham Riley, Reinhard Budich, René Redler 1. Auflage

More information

Parallel and Distributed Systems. Programming Models. Why Parallel or Distributed Computing? What is a parallel computer?

Parallel and Distributed Systems. Programming Models. Why Parallel or Distributed Computing? What is a parallel computer? Parallel and Distributed Systems Instructor: Sandhya Dwarkadas Department of Computer Science University of Rochester What is a parallel computer? A collection of processing elements that communicate and

More information

Monte Carlo Methods and Applications

Monte Carlo Methods and Applications de Gruyter Proceedings in Mathematics Monte Carlo Methods and Applications Proceedings of the 8th IMACS Seminar on Monte Carlo Methods, August 29 September 2, 2011, Borovets, Bulgaria Bearbeitet von Enrique

More information

A. Udaya Shankar. Distributed Programming. and Practice. Theory. 4^1 Springer

A. Udaya Shankar. Distributed Programming. and Practice. Theory. 4^1 Springer A. Udaya Shankar Distributed Programming Theory and Practice 4^1 Springer Contents 1 Introduction 1 1.1 Objective 1 1.2 Programs and Services 2 1.3 Correctness Properties and Assertional Reasoning 5 1.4

More information

What is the Race Condition? And what is its solution? What is a critical section? And what is the critical section problem?

What is the Race Condition? And what is its solution? What is a critical section? And what is the critical section problem? What is the Race Condition? And what is its solution? Race Condition: Where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular

More information

Synchrony Weakened by Message Adversaries vs Asynchrony Enriched with Failure Detectors. Michel Raynal, Julien Stainer

Synchrony Weakened by Message Adversaries vs Asynchrony Enriched with Failure Detectors. Michel Raynal, Julien Stainer Synchrony Weakened by Message Adversaries vs Asynchrony Enriched with Failure Detectors Michel Raynal, Julien Stainer Synchrony Weakened by Message Adversaries vs Asynchrony Enriched with Failure Detectors

More information

R13 SET - 1 2. Answering the question in Part-A is compulsory 1 a) Define Operating System. List out the objectives of an operating system. [3M] b) Describe different attributes of the process. [4M] c)

More information

Non-blocking Array-based Algorithms for Stacks and Queues!

Non-blocking Array-based Algorithms for Stacks and Queues! Non-blocking Array-based Algorithms for Stacks and Queues! Niloufar Shafiei! Department of Computer Science and Engineering York University ICDCN 09 Outline! Introduction! Stack algorithm! Queue algorithm!

More information

Advanced Man-Machine Interaction

Advanced Man-Machine Interaction Signals and Communication Technology Advanced Man-Machine Interaction Fundamentals and Implementation Bearbeitet von Karl-Friedrich Kraiss 1. Auflage 2006. Buch. XIX, 461 S. ISBN 978 3 540 30618 4 Format

More information

1 The comparison of QC, SC and LIN

1 The comparison of QC, SC and LIN Com S 611 Spring Semester 2009 Algorithms for Multiprocessor Synchronization Lecture 5: Tuesday, 3rd February 2009 Instructor: Soma Chaudhuri Scribe: Jianrong Dong 1 The comparison of QC, SC and LIN Pi

More information

The Wait-Free Hierarchy

The Wait-Free Hierarchy Jennifer L. Welch References 1 M. Herlihy, Wait-Free Synchronization, ACM TOPLAS, 13(1):124-149 (1991) M. Fischer, N. Lynch, and M. Paterson, Impossibility of Distributed Consensus with One Faulty Process,

More information

Image and Geometry Processing for 3-D Cinematography

Image and Geometry Processing for 3-D Cinematography Geometry and Computing 5 Image and Geometry Processing for 3-D Cinematography Bearbeitet von Rémi Ronfard, Gabriel Taubin 1st Edition. 2010. Buch. x, 305 S. Hardcover ISBN 978 3 642 12391 7 Format (B x

More information

Self Stabilization. CS553 Distributed Algorithms Prof. Ajay Kshemkalyani. by Islam Ismailov & Mohamed M. Ali

Self Stabilization. CS553 Distributed Algorithms Prof. Ajay Kshemkalyani. by Islam Ismailov & Mohamed M. Ali Self Stabilization CS553 Distributed Algorithms Prof. Ajay Kshemkalyani by Islam Ismailov & Mohamed M. Ali Introduction There is a possibility for a distributed system to go into an illegitimate state,

More information

Non-blocking Array-based Algorithms for Stacks and Queues. Niloufar Shafiei

Non-blocking Array-based Algorithms for Stacks and Queues. Niloufar Shafiei Non-blocking Array-based Algorithms for Stacks and Queues Niloufar Shafiei Outline Introduction Concurrent stacks and queues Contributions New algorithms New algorithms using bounded counter values Correctness

More information

Contents. 1.1 What Operating Systems Do Computer-System Organization Computer-System Architecture 12. Operating-System Structures

Contents. 1.1 What Operating Systems Do Computer-System Organization Computer-System Architecture 12. Operating-System Structures PART ONE Chapter 1 Introduction OVERVIEW 1.1 What Operating Systems Do 3 1.2 Computer-System Organization 6 1.3 Computer-System Architecture 12 1.4 Operating-System Structure 15 1.5 Operating-System Operations

More information

Dynamic Taxonomies and Faceted Search

Dynamic Taxonomies and Faceted Search The Information Retrieval Series 25 Dynamic Taxonomies and Faceted Search Theory, Practice, and Experience Bearbeitet von Giovanni Maria Sacco, Yannis Tzitzikas 1. Auflage 2012. Taschenbuch. xvii, 340

More information

Deadlock. Concurrency: Deadlock and Starvation. Reusable Resources

Deadlock. Concurrency: Deadlock and Starvation. Reusable Resources Concurrency: Deadlock and Starvation Chapter 6 Deadlock Permanent blocking of a set of processes that either compete for system resources or communicate with each other No efficient solution Involve conflicting

More information

Shared Memory Synchronization

Shared Memory Synchronization Shared Memory Synchronization Gadi Taubenfeld The Interdisciplinary Center, P.O.Box 167, Herzliya 46150, Israel, tgadi@idc.ac.il, http://www.faculty.idc.ac.il/gadi/ September 1, 2008 Abstract. Synchronization

More information

CSE 486/586 Distributed Systems

CSE 486/586 Distributed Systems CSE 486/586 Distributed Systems Mutual Exclusion Steve Ko Computer Sciences and Engineering University at Buffalo CSE 486/586 Recap: Consensus On a synchronous system There s an algorithm that works. On

More information

Concurrency. Chapter 5

Concurrency. Chapter 5 Concurrency 1 Chapter 5 2 Concurrency Is a fundamental concept in operating system design Processes execute interleaved in time on a single processor Creates the illusion of simultaneous execution Benefits

More information

The Complexity of Renaming

The Complexity of Renaming The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale Seth Gilbert NUS Rachid Guerraoui EPFL Abstract We study the complexity of renaming, a fundamental problem in distributed computing in which

More information

Review. Review. Review. Constructing Reliable Registers From Unreliable Byzantine Components 12/15/08. Space of registers: Transformations:

Review. Review. Review. Constructing Reliable Registers From Unreliable Byzantine Components 12/15/08. Space of registers: Transformations: Review Constructing Reliable Registers From Unreliable Byzantine Components Space of registers: Dimension 1: binary vs. multivalued Dimension 2: safe vs. regular vs. atomic Seth Gilbert Dimension 3: SRSW

More information

Consensus Problem. Pradipta De

Consensus Problem. Pradipta De Consensus Problem Slides are based on the book chapter from Distributed Computing: Principles, Paradigms and Algorithms (Chapter 14) by Kshemkalyani and Singhal Pradipta De pradipta.de@sunykorea.ac.kr

More information

MODERN MULTITHREADING

MODERN MULTITHREADING MODERN MULTITHREADING Implementing, Testing, and Debugging Multithreaded Java and C++/Pthreads/Win32 Programs RICHARD H. CARVER KUO-CHUNG TAI A JOHN WILEY & SONS, INC., PUBLICATION MODERN MULTITHREADING

More information

Distributed Recursion

Distributed Recursion Distributed Recursion March 2011 Sergio Rajsbaum Instituto de Matemáticas, UNAM joint work with Eli Gafni, UCLA Introduction Though it is a new field, computer science already touches virtually every aspect

More information

Contents. 1.1 What Operating Systems Do Computer-System Organization Computer-System Architecture 12. Operating-System Structures

Contents. 1.1 What Operating Systems Do Computer-System Organization Computer-System Architecture 12. Operating-System Structures PART ONE Chapter 1 Introduction OVERVIEW 1.1 What Operating Systems Do 3 1.2 Computer-System Organization 6 1.3 Computer-System Architecture 12 1.4 Operating-System Structure 18 1.5 Operating-System Operations

More information

Concurrent Computing

Concurrent Computing Concurrent Computing Introduction SE205, P1, 2017 Administrivia Language: (fr)anglais? Lectures: Fridays (15.09-03.11), 13:30-16:45, Amphi Grenat Web page: https://se205.wp.imt.fr/ Exam: 03.11, 15:15-16:45

More information

DD2451 Parallel and Distributed Computing --- FDD3008 Distributed Algorithms

DD2451 Parallel and Distributed Computing --- FDD3008 Distributed Algorithms DD2451 Parallel and Distributed Computing --- FDD3008 Distributed Algorithms Lecture 4 Consensus, I Mads Dam Autumn/Winter 2011 Slides: Much material due to M. Herlihy and R Wa8enhofer Last Lecture Shared

More information

DISTRIBUTED COMPUTING COLUMN. Stefan Schmid TU Berlin & T-Labs, Germany

DISTRIBUTED COMPUTING COLUMN. Stefan Schmid TU Berlin & T-Labs, Germany DISTRIBUTED COMPUTING COLUMN Stefan Schmid TU Berlin & T-Labs, Germany stefan.schmid@tu-berlin.de 1 The Renaming Problem: Recent Developments and Open Questions Dan Alistarh (Microsoft Research) 1 Introduction

More information

Two-Phase Atomic Commitment Protocol in Asynchronous Distributed Systems with Crash Failure

Two-Phase Atomic Commitment Protocol in Asynchronous Distributed Systems with Crash Failure Two-Phase Atomic Commitment Protocol in Asynchronous Distributed Systems with Crash Failure Yong-Hwan Cho, Sung-Hoon Park and Seon-Hyong Lee School of Electrical and Computer Engineering, Chungbuk National

More information

Mutual Exclusion. 1 Formal problem definitions. Time notion CSE /17/2015. Outline of this lecture:

Mutual Exclusion. 1 Formal problem definitions. Time notion CSE /17/2015. Outline of this lecture: CSE 539 03/17/2015 Mutual Exclusion Lecture 15 Scribe: Son Dinh Outline of this lecture: 1. Formal problem definitions 2. Solution for 2 threads 3. Solution for n threads 4. Inherent costs of mutual exclusion

More information

Module 6: Process Synchronization. Operating System Concepts with Java 8 th Edition

Module 6: Process Synchronization. Operating System Concepts with Java 8 th Edition Module 6: Process Synchronization 6.1 Silberschatz, Galvin and Gagne 2009 Module 6: Process Synchronization Background The Critical-Section Problem Peterson s Solution Synchronization Hardware Semaphores

More information

Module 6: Process Synchronization

Module 6: Process Synchronization Module 6: Process Synchronization Background The Critical-Section Problem Synchronization Hardware Semaphores Classical Problems of Synchronization Critical Regions Monitors Synchronization in Solaris

More information

The Relative Power of Synchronization Methods

The Relative Power of Synchronization Methods Chapter 5 The Relative Power of Synchronization Methods So far, we have been addressing questions of the form: Given objects X and Y, is there a wait-free implementation of X from one or more instances

More information

6.852: Distributed Algorithms Fall, Class 12

6.852: Distributed Algorithms Fall, Class 12 6.852: Distributed Algorithms Fall, 2009 Class 12 Today s plan Weak logical time and vector timestamps Consistent global snapshots and stable property detection. Applications: Distributed termination.

More information

Introduction to Distributed Systems Seif Haridi

Introduction to Distributed Systems Seif Haridi Introduction to Distributed Systems Seif Haridi haridi@kth.se What is a distributed system? A set of nodes, connected by a network, which appear to its users as a single coherent system p1 p2. pn send

More information

Asynchronous Models. Chapter Asynchronous Processes States, Inputs, and Outputs

Asynchronous Models. Chapter Asynchronous Processes States, Inputs, and Outputs Chapter 3 Asynchronous Models 3.1 Asynchronous Processes Like a synchronous reactive component, an asynchronous process interacts with other processes via inputs and outputs, and maintains an internal

More information

Shared Objects. Shared Objects

Shared Objects. Shared Objects Shared Objects Shared Objects Invoked operations have a non-zero duration Invocations can overlap Useful for: modeling distributed shared memory Objects can be combined together to implement higher level

More information

Process Synchronization: Semaphores. CSSE 332 Operating Systems Rose-Hulman Institute of Technology

Process Synchronization: Semaphores. CSSE 332 Operating Systems Rose-Hulman Institute of Technology Process Synchronization: Semaphores CSSE 332 Operating Systems Rose-Hulman Institute of Technology Critical-section problem solution 1. Mutual Exclusion - If process Pi is executing in its critical section,

More information

Conceptual Modelling in Information Systems Engineering

Conceptual Modelling in Information Systems Engineering Conceptual Modelling in Information Systems Engineering Bearbeitet von John Krogstie, Andreas Lothe Opdahl, Sjaak Brinkkemper 1. Auflage 2007. Buch. xiv, 346 S. Hardcover ISBN 978 3 540 72676 0 Format

More information

Distributed Algorithms. Partha Sarathi Mandal Department of Mathematics IIT Guwahati

Distributed Algorithms. Partha Sarathi Mandal Department of Mathematics IIT Guwahati Distributed Algorithms Partha Sarathi Mandal Department of Mathematics IIT Guwahati Thanks to Dr. Sukumar Ghosh for the slides Distributed Algorithms Distributed algorithms for various graph theoretic

More information

Concurrency pros and cons. Concurrent Programming Problems. Linked list example. Linked list example. Mutual Exclusion. Concurrency is good for users

Concurrency pros and cons. Concurrent Programming Problems. Linked list example. Linked list example. Mutual Exclusion. Concurrency is good for users Concurrency pros and cons Con Programming Problems OS Spring 2011 Concurrency is good for users One of the reasons for multiprogramming Working on the same problem, simultaneous execution of programs,

More information

Concurrency: Mutual Exclusion and Synchronization

Concurrency: Mutual Exclusion and Synchronization Concurrency: Mutual Exclusion and Synchronization 1 Needs of Processes Allocation of processor time Allocation and sharing resources Communication among processes Synchronization of multiple processes

More information

Curriculum 2013 Knowledge Units Pertaining to PDC

Curriculum 2013 Knowledge Units Pertaining to PDC Curriculum 2013 Knowledge Units Pertaining to C KA KU Tier Level NumC Learning Outcome Assembly level machine Describe how an instruction is executed in a classical von Neumann machine, with organization

More information

arxiv: v8 [cs.dc] 29 Jul 2011

arxiv: v8 [cs.dc] 29 Jul 2011 On the Cost of Concurrency in Transactional Memory Petr Kuznetsov TU Berlin/Deutsche Telekom Laboratories Srivatsan Ravi TU Berlin/Deutsche Telekom Laboratories arxiv:1103.1302v8 [cs.dc] 29 Jul 2011 Abstract

More information

Threads. Threads The Thread Model (1) CSCE 351: Operating System Kernels Witawas Srisa-an Chapter 4-5

Threads. Threads The Thread Model (1) CSCE 351: Operating System Kernels Witawas Srisa-an Chapter 4-5 Threads CSCE 351: Operating System Kernels Witawas Srisa-an Chapter 4-5 1 Threads The Thread Model (1) (a) Three processes each with one thread (b) One process with three threads 2 1 The Thread Model (2)

More information

Time and Space Lower Bounds for Implementations Using k-cas

Time and Space Lower Bounds for Implementations Using k-cas Time and Space Lower Bounds for Implementations Using k-cas Hagit Attiya Danny Hendler September 12, 2006 Abstract This paper presents lower bounds on the time- and space-complexity of implementations

More information

Process Synchronization. Mehdi Kargahi School of ECE University of Tehran Spring 2008

Process Synchronization. Mehdi Kargahi School of ECE University of Tehran Spring 2008 Process Synchronization Mehdi Kargahi School of ECE University of Tehran Spring 2008 Producer-Consumer (Bounded Buffer) Producer Consumer Race Condition Producer Consumer Critical Sections Structure of

More information

Concurrent Computing. January 21, 2018

Concurrent Computing. January 21, 2018 Concurrent Computing Rachid Guerraoui Petr Kuznetsov January 21, 2018 Contents 1. Introduction 7 1.1. A broad picture: the concurrency revolution........................ 7 1.2. The topic: shared objects..................................

More information

Process Synchronization

Process Synchronization CSC 4103 - Operating Systems Spring 2007 Lecture - VI Process Synchronization Tevfik Koşar Louisiana State University February 6 th, 2007 1 Roadmap Process Synchronization The Critical-Section Problem

More information

Dr. D. M. Akbar Hussain DE5 Department of Electronic Systems

Dr. D. M. Akbar Hussain DE5 Department of Electronic Systems Concurrency 1 Concurrency Execution of multiple processes. Multi-programming: Management of multiple processes within a uni- processor system, every system has this support, whether big, small or complex.

More information

Programming with POSIX Threads

Programming with POSIX Threads Programming with POSIX Threads David R. Butenhof :vaddison-wesley Boston San Francisco New York Toronto Montreal London Munich Paris Madrid Capetown Sidney Tokyo Singapore Mexico City Contents List of

More information

ACONCURRENT system may be viewed as a collection of

ACONCURRENT system may be viewed as a collection of 252 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 10, NO. 3, MARCH 1999 Constructing a Reliable Test&Set Bit Frank Stomp and Gadi Taubenfeld AbstractÐThe problem of computing with faulty

More information

Distributed Systems. Chapman & Hall/CRC. «H Taylor S* Francis Croup Boca Raton London New York

Distributed Systems. Chapman & Hall/CRC. «H Taylor S* Francis Croup Boca Raton London New York Distributed Systems An Algorithmic Approach Sukumar Ghosh University of Iowa Iowa City, U.S.A. Chapman & Hall/CRC «H Taylor S* Francis Croup Boca Raton London New York Chapman & Hall/CRC is an imprint

More information

Web Archiving. Bearbeitet von Julien Masanès

Web Archiving. Bearbeitet von Julien Masanès Web Archiving Bearbeitet von Julien Masanès 1. Auflage 2006. Buch. vii, 234 S. Hardcover ISBN 978 3 540 23338 1 Format (B x L): 15,5 x 23,5 cm Gewicht: 532 g Weitere Fachgebiete > EDV, Informatik > EDV,

More information

A Timing Assumption and a t-resilient Protocol for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems

A Timing Assumption and a t-resilient Protocol for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems A Timing Assumption and a t-resilient Protocol for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems Antonio FERNÁNDEZ y Ernesto JIMÉNEZ z Michel RAYNAL? Gilles TRÉDAN? y LADyR,

More information

Constant RMR Transformation to Augment Reader-Writer Locks with Atomic Upgrade/Downgrade Support

Constant RMR Transformation to Augment Reader-Writer Locks with Atomic Upgrade/Downgrade Support Constant RMR Transformation to Augment Reader-Writer Locks with Atomic Upgrade/Downgrade Support Jake Stern Leichtling Thesis Advisor: Prasad Jayanti With significant contributions from Michael Diamond.

More information

Concurrency pros and cons. Concurrent Programming Problems. Mutual Exclusion. Concurrency is good for users

Concurrency pros and cons. Concurrent Programming Problems. Mutual Exclusion. Concurrency is good for users Concurrency pros and cons Con Programming Problems OS Spring 2009 Concurrency is good for users One of the reasons for multiprogramming Working on the same problem, simultaneous execution of programs,

More information

Synchronization for Concurrent Tasks

Synchronization for Concurrent Tasks Synchronization for Concurrent Tasks Minsoo Ryu Department of Computer Science and Engineering 2 1 Race Condition and Critical Section Page X 2 Synchronization in the Linux Kernel Page X 3 Other Synchronization

More information

[module 2.2] MODELING CONCURRENT PROGRAM EXECUTION

[module 2.2] MODELING CONCURRENT PROGRAM EXECUTION v1.0 20130407 Programmazione Avanzata e Paradigmi Ingegneria e Scienze Informatiche - UNIBO a.a 2013/2014 Lecturer: Alessandro Ricci [module 2.2] MODELING CONCURRENT PROGRAM EXECUTION 1 SUMMARY Making

More information

Concurrency: a crash course

Concurrency: a crash course Chair of Software Engineering Carlo A. Furia, Marco Piccioni, Bertrand Meyer Concurrency: a crash course Concurrent computing Applications designed as a collection of computational units that may execute

More information

The Timed Asynchronous Distributed System Model By Flaviu Cristian and Christof Fetzer

The Timed Asynchronous Distributed System Model By Flaviu Cristian and Christof Fetzer The Timed Asynchronous Distributed System Model By Flaviu Cristian and Christof Fetzer - proposes a formal definition for the timed asynchronous distributed system model - presents measurements of process

More information

Application Programming

Application Programming Multicore Application Programming For Windows, Linux, and Oracle Solaris Darryl Gove AAddison-Wesley Upper Saddle River, NJ Boston Indianapolis San Francisco New York Toronto Montreal London Munich Paris

More information

Computing with Infinitely Many Processes under assumptions on concurrency and participation -M.Merritt&G.Taubenfeld. Dean Christakos & Deva Seetharam

Computing with Infinitely Many Processes under assumptions on concurrency and participation -M.Merritt&G.Taubenfeld. Dean Christakos & Deva Seetharam Computing with Infinitely Many Processes under assumptions on concurrency and participation -M.Merritt&G.Taubenfeld Dean Christakos & Deva Seetharam November 25, 2003 Abstract This paper explores four

More information

A Case Study of Agreement Problems in Distributed Systems : Non-Blocking Atomic Commitment

A Case Study of Agreement Problems in Distributed Systems : Non-Blocking Atomic Commitment A Case Study of Agreement Problems in Distributed Systems : Non-Blocking Atomic Commitment Michel RAYNAL IRISA, Campus de Beaulieu 35042 Rennes Cedex (France) raynal @irisa.fr Abstract This paper considers

More information