contents
play

Contents Part I Lock-Based Synchronization 1 The Mutual Exclusion - PDF document

Apr 14, 2023 •254 likes •402 views

Contents Part I Lock-Based Synchronization 1 The Mutual Exclusion Problem . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1 Multiprocess Program . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.1 The Concept of a

  2. Contents Part I Lock-Based Synchronization 1 The Mutual Exclusion Problem . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1 Multiprocess Program . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.1 The Concept of a Sequential Process. . . . . . . . . . . . 3 1.1.2 The Concept of a Multiprocess Program . . . . . . . . . 4 1.2 Process Synchronization . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2.1 Processors and Processes . . . . . . . . . . . . . . . . . . . . 4 1.2.2 Synchronization . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2.3 Synchronization: Competition. . . . . . . . . . . . . . . . . 5 1.2.4 Synchronization: Cooperation. . . . . . . . . . . . . . . . . 7 1.2.5 The Aim of Synchronization Is to Preserve Invariants . . . . . . . . . . . . . . . . . . . . 7 1.3 The Mutual Exclusion Problem . . . . . . . . . . . . . . . . . . . . . 9 1.3.1 The Mutual Exclusion Problem (Mutex) . . . . . . . . . 9 1.3.2 Lock Object . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.3.3 Three Families of Solutions . . . . . . . . . . . . . . . . . . 12 1.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 1.5 Bibliographic Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2 Solving Mutual Exclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.1 Mutex Based on Atomic Read/Write Registers. . . . . . . . . . . 15 2.1.1 Atomic Register . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.1.2 Mutex for Two Processes: An Incremental Construction . . . . . . . . . . . . . . . . . 17 2.1.3 A Two-Process Algorithm . . . . . . . . . . . . . . . . . . . 19 2.1.4 Mutex for n Processes: Generalizing the Previous Two-Process Algorithm. . . 22 2.1.5 Mutex for n Processes: A Tournament-Based Algorithm . . . . . . . . . . . . . . . 26 2.1.6 A Concurrency-Abortable Algorithm. . . . . . . . . . . . 29 xi

  3. xii Contents 2.1.7 A Fast Mutex Algorithm . . . . . . . . . . . . . . . . . . . . 33 2.1.8 Mutual Exclusion in a Synchronous System. . . . . . . 37 2.2 Mutex Based on Specialized Hardware Primitives . . . . . . . . 38 2.2.1 Test&Set, Swap and Compare&Swap . . . . . . . . . . . 39 2.2.2 From Deadlock-Freedom to Starvation-Freedom. . . . 40 2.2.3 Fetch&Add . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 2.3 Mutex Without Atomicity . . . . . . . . . . . . . . . . . . . . . . . . . 45 2.3.1 Safe, Regular and Atomic Registers . . . . . . . . . . . . 45 2.3.2 The Bakery Mutex Algorithm . . . . . . . . . . . . . . . . 48 2.3.3 A Bounded Mutex Algorithm. . . . . . . . . . . . . . . . . 53 2.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 2.5 Bibliographic Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 2.6 Exercises and Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 3 Lock-Based Concurrent Objects . . . . . . . . . . . . . . . . . . . . . . . . . 61 3.1 Concurrent Objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 3.1.1 Concurrent Object. . . . . . . . . . . . . . . . . . . . . . . . . 61 3.1.2 Lock-Based Implementation. . . . . . . . . . . . . . . . . . 62 3.2 A Base Synchronization Object: the Semaphore . . . . . . . . . . 63 3.2.1 The Concept of a Semaphore . . . . . . . . . . . . . . . . . 63 3.2.2 Using Semaphores to Solve the Producer-Consumer Problem. . . . . . . . . . . . . . . 65 3.2.3 Using Semaphores to Solve a Priority Scheduling Problem . . . . . . . . . . . . . . . . 71 3.2.4 Using Semaphores to Solve the Readers-Writers Problem . . . . . . . . . . . . . . . . . 74 3.2.5 Using a Buffer to Reduce Delays for Readers and Writers. . . . . . . . . . . . . . . . . . . . . 78 3.3 A Construct for Imperative Languages: the Monitor . . . . . . . 81 3.3.1 The Concept of a Monitor . . . . . . . . . . . . . . . . . . . 82 3.3.2 A Rendezvous Monitor Object . . . . . . . . . . . . . . . . 83 3.3.3 Monitors and Predicates. . . . . . . . . . . . . . . . . . . . . 85 3.3.4 Implementing a Monitor from Semaphores . . . . . . . 87 3.3.5 Monitors for the Readers-Writers Problem. . . . . . . . 89 3.3.6 Scheduled Wait Operation . . . . . . . . . . . . . . . . . . . 94 3.4 Declarative Synchronization: Path Expressions. . . . . . . . . . . 95 3.4.1 Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96 3.4.2 Using Path Expressions to Solve Synchronization Problems . . . . . . . . . . . . . . . . . . . 97 3.4.3 A Semaphore-Based Implementation of Path Expressions. . . . . . . . . . . . . . . . . . . . . . . . 98 3.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 3.6 Bibliographic Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102 3.7 Exercises and Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . 102

  4. Contents xiii Part II On the Foundations Side: The Atomicity Concept 4 Atomicity: Formal Definition and Properties . . . . . . . . . . . . . . . . 113 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113 4.2 Computation Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 4.2.1 Processes and Operations. . . . . . . . . . . . . . . . . . . . 115 4.2.2 Objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116 4.2.3 Histories . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117 4.2.4 Sequential History. . . . . . . . . . . . . . . . . . . . . . . . . 119 4.3 Atomicity. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 4.3.1 Legal History . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 4.3.2 The Case of Complete Histories . . . . . . . . . . . . . . . 121 4.3.3 The Case of Partial Histories . . . . . . . . . . . . . . . . . 123 4.4 Object Composability and Guaranteed Termination Property . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 4.4.1 Atomic Objects Compose for Free . . . . . . . . . . . . . 125 4.4.2 Guaranteed Termination . . . . . . . . . . . . . . . . . . . . 127 4.5 Alternatives to Atomicity. . . . . . . . . . . . . . . . . . . . . . . . . . 128 4.5.1 Sequential Consistency . . . . . . . . . . . . . . . . . . . . . 128 4.5.2 Serializability . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130 4.6 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131 4.7 Bibliographic Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132 Part III Mutex-Free Synchronization 5 Mutex-Free Concurrent Objects . . . . . . . . . . . . . . . . . . . . . . . . . 135 5.1 Mutex-Freedom and Progress Conditions. . . . . . . . . . . . . . . 135 5.1.1 The Mutex-Freedom Notion. . . . . . . . . . . . . . . . . . 135 5.1.2 Progress Conditions . . . . . . . . . . . . . . . . . . . . . . . 137 5.1.3 Non-blocking with Respect to Wait-Freedom . . . . . . 140 5.2 Mutex-Free Concurrent Objects . . . . . . . . . . . . . . . . . . . . . 140 5.2.1 The Splitter: A Simple Wait-Free Object from Read/Write Registers. . . . . . . . . . . . . . . . . . . . . . . 140 5.2.2 A Simple Obstruction-Free Object from Read/Write Registers. . . . . . . . . . . . . . . . . . . . . . . 143 5.2.3 A Remark on Compare&Swap: The ABA Problem. . . 145 5.2.4 A Non-blocking Queue Based on Read/Write Registers and Compare&Swap . . . . . . . 146 5.2.5 A Non-blocking Stack Based on Compare&Swap Registers . . . . . . . . . . . . . . . . . . . 150 5.2.6 A Wait-Free Stack Based on Fetch&Add and Swap Registers . . . . . . . . . . . . . . . 152

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Contents Contents Fluid

Contents Contents Fluid

Physics-based Fluid Simulations for Computer Graphics Ryoichi Ando Contents Contents Fluid Solver Contents Fluid Solver Surface Tracker Contents Fluid Solver Surface

2.14k views • 175 slides
Contents Contents.....2 Butter

Contents Contents.....2 Butter

4/8/2019 Milkfat Ingredients, from Cream to AMF 2019 ADPI Dairy 360 Contents Contents.....2 Butter Definition..12 Churning Process..13 Farm Separated

582 views • 9 slides
17 www.scad.ae Table of Contents Table of Contents

17 www.scad.ae Table of Contents Table of Contents

Statistical Report Writing and Data Presentation Guide Methodology and Quality Guides - No. (17) 17 www.scad.ae Table of Contents Table of Contents

1.03k views • 41 slides
Level 1, V2.0 Level 1, V2.0 1 Course Contents Course Contents Course Contents Course

Level 1, V2.0 Level 1, V2.0 1 Course Contents Course Contents Course Contents Course

August 2008 Training Manual: Training Manual: KI7400 & 7800 Series Sources KI7400 & 7800 Series Sources Level 1, V2.0 Level 1, V2.0 1 Course Contents Course Contents Course Contents Course Contents 1 1. General features

590 views • 19 slides
Trigger and DAQ at LHC Trigger and DAQ at LHC C.Schwick Contents Contents INTRODUCTION The

Trigger and DAQ at LHC Trigger and DAQ at LHC C.Schwick Contents Contents INTRODUCTION The

Trigger and DAQ at LHC Trigger and DAQ at LHC C.Schwick Contents Contents INTRODUCTION The context: LHC & experiments PART1: Trigger at LHC Requirements & Concepts Muon and Calorimeter triggers (CMS and ATLAS) Specific solutions

972 views • 66 slides
Trigger and DAQ at LHC Trigger and DAQ at LHC C.Schwick Contents Contents INTRODUCTION The

Trigger and DAQ at LHC Trigger and DAQ at LHC C.Schwick Contents Contents INTRODUCTION The

Trigger and DAQ at LHC Trigger and DAQ at LHC C.Schwick Contents Contents INTRODUCTION The context: LHC & experiments PART1: Trigger at LHC Requirements & Concepts Muon and Calorimeter triggers (CMS and ATLAS) Specific solutions

1.19k views • 90 slides
CONTENTS CONTENTS 1 6 INTRODUCTION APPLICATION 2 ORGANIZATION 7 DISTRIBUTION

CONTENTS CONTENTS 1 6 INTRODUCTION APPLICATION 2 ORGANIZATION 7 DISTRIBUTION

CONTENTS CONTENTS 1 6 INTRODUCTION APPLICATION 2 ORGANIZATION 7 DISTRIBUTION PROCESS 3 8 BUSINESS SCOPE APPROVAL 4 9 FACILITY REFERENCE 5 10 PRODUCT SUMMARY CERTIFICATE 1. INTRODUCTION 1.

818 views • 19 slides
Introduction To Tcl/Tk Introduction To Tcl/Tk - Contents - Contents Whats Tcl/Tk? 3

Introduction To Tcl/Tk Introduction To Tcl/Tk - Contents - Contents Whats Tcl/Tk? 3

Introduction To Tcl/Tk Introduction To Tcl/Tk - Contents - Contents Whats Tcl/Tk? 3 Getting Started 4 Tcl Scripting 5 Basics 5 Variable Substitution 6 Command Substitution 6 Controlling Word Structure 7 Comment 7 Command Line

1.87k views • 18 slides
September 2019 02 CONTENTS 02 VILLA GUASTAVILLANI 03 CONTENTS 04 WHO WE ARE 05 PURPOSE

September 2019 02 CONTENTS 02 VILLA GUASTAVILLANI 03 CONTENTS 04 WHO WE ARE 05 PURPOSE

September 2019 02 CONTENTS 02 VILLA GUASTAVILLANI 03 CONTENTS 04 WHO WE ARE 05 PURPOSE 06 GENERATIVE EDUCATION 07 WHAT WE DO 08 KEY FACTS 09 OUR PROGRAMS 10 DIGITAL TRANSFORMATON 11 SUSTAINABILITY 12 ALUMNI 03 WHO WE ARE

502 views • 18 slides
Oasys Post-Processing: Did you know?... Back to Contents Slide 1 Contents Shortcuts

Oasys Post-Processing: Did you know?... Back to Contents Slide 1 Contents Shortcuts

Oasys Post-Processing: Did you know?... Back to Contents Slide 1 Contents Shortcuts Quick Find Integration with PRIMER Undocking Menus User Defined Components Material Extra Data FAST-TCF Curve Table

1.58k views • 81 slides
Contents Contents Tables i i Figures v v 1.0 1.0 Introduction 1 1 2.0 2.0 Me

Contents Contents Tables i i Figures v v 1.0 1.0 Introduction 1 1 2.0 2.0 Me

i Contents Contents Tables i i Figures v v 1.0 1.0 Introduction 1 1 2.0 2.0 Me Methodology thodology 3 3 3.0 3.0 Knowsley 5 5 3.1 3.1 Drug Drug Te Testing sting Data Data 5 5 3.2 3.2 Assessments (DIR) 7 7 3.3 3.3

1.06k views • 68 slides
Engagement with the Commonwealth 1 PRESENTATION CONTENTS Contents Economic Impact Study

Engagement with the Commonwealth 1 PRESENTATION CONTENTS Contents Economic Impact Study

Engagement with the Commonwealth 1 PRESENTATION CONTENTS Contents Economic Impact Study UVAs Role in Economic Development Industry Attraction and Retention Addressing Workforce Needs Innovation, Entrepreneurship, and

416 views • 39 slides
MOCK-UP Table of Contents

MOCK-UP Table of Contents

Cr par Laura Belloni Introduction to the Canadian Securities Administrators MOCK-UP Table of Contents _______________________________________________________________________________________ 2 Table of Contents Message from the Chair

510 views • 30 slides
WELCOME TO THE EXTRAORDINARY GENERAL MEETING 21 NOVEMBER 2017 CONTENTS CONTENTS THE

WELCOME TO THE EXTRAORDINARY GENERAL MEETING 21 NOVEMBER 2017 CONTENTS CONTENTS THE

Local Property Overseas Property Purpose Built Student Construction Dormitory Development Development Accommodation WELCOME TO THE EXTRAORDINARY GENERAL MEETING 21 NOVEMBER 2017 CONTENTS CONTENTS THE RESOLUTIONS WHY THIS EGM IS

229 views • 18 slides
Contents Contents 1. Establishment of a Big Data Roadmap of the Korean Government 2.

Contents Contents 1. Establishment of a Big Data Roadmap of the Korean Government 2.

April 2013 Ki-bong Park Pilot Project MSIS2013(2013.4.23~ 25, Bangkok) Contents Contents 1. Establishment of a Big Data Roadmap of the Korean Government 2. Beginning of Big Data Use 3.

495 views • 7 slides
HANDOUTS 1 Slide 2 Handout contents Page 2-3 Handout contents 4 Introduction 5 - 6 Paying

HANDOUTS 1 Slide 2 Handout contents Page 2-3 Handout contents 4 Introduction 5 - 6 Paying

Slide 1 Civil Service Pensions Thinking about retirement HANDOUTS 1 Slide 2 Handout contents Page 2-3 Handout contents 4 Introduction 5 - 6 Paying your pension from HR to Capita Hartshead 7 - 8 Benefit Overview ( classic,

668 views • 38 slides
Self-Stabilizing Labeling and Ranking in Ordered Trees Ajoy K. Datta 1 ephane Devismes 2 St

Self-Stabilizing Labeling and Ranking in Ordered Trees Ajoy K. Datta 1 ephane Devismes 2 St

Introduction Labeling with Guide Pairs Application: Ranking Conclusion Self-Stabilizing Labeling and Ranking in Ordered Trees Ajoy K. Datta 1 ephane Devismes 2 St Lawrence L. Larmore 1 Yvan Rivierre 2 1 School of Computer Science, University

1k views • 71 slides
Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions Stphane Devismes 1 Colette

Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions Stphane Devismes 1 Colette

Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions Stphane Devismes 1 Colette Johnen 2 David Ilcinkas 2 1 Univ. Grenoble Alpes, VERIMAG, 38000 Grenoble, France 2 CNRS & Univ. Bordeaux, LaBRI, UMR 5800, F-33400 Talence,

1.25k views • 82 slides
Distinguishing Multiplications from Squaring Operations Frederic Amiel Benoit Feix Michael

Distinguishing Multiplications from Squaring Operations Frederic Amiel Benoit Feix Michael

Distinguishing Multiplications from Squaring Operations Frederic Amiel Benoit Feix Michael Tunstall Claire Whelan William P. Marnane Cork May 20, 2008 Michael Tunstall (University of Bristol) May 20, 2008 Cork 1 / 25 Introduction

400 views • 25 slides
October 16 th 2015, Budapest Workshop on Linguistic and Cognitive aspects of Quantification

October 16 th 2015, Budapest Workshop on Linguistic and Cognitive aspects of Quantification

October 16 th 2015, Budapest Workshop on Linguistic and Cognitive aspects of Quantification The semantics and the acquisition of the distributive marker po , which is notorious, (common to Slavic and has very broad distribution); our

1.02k views • 68 slides
Distributed Algorithms for Message-Passing Systems Contents Part I Distributed Graph

Distributed Algorithms for Message-Passing Systems Contents Part I Distributed Graph

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

128 views • 12 slides
IDN Variant TLDs Program Update 28 June 2012 Agenda Program

IDN Variant TLDs Program Update 28 June 2012 Agenda Program

IDN Variant TLDs Program Update 28 June 2012 Agenda Program Overview Presentation of projects to be completed in 2012/13 Summary of follow on projects Announce the team (staff and consultants) for

388 views • 21 slides
Data Modeling in the NoSQL World By: Ashutosh Kale, Adham Kamel, Jordan Mercado Kevin Kim,

Data Modeling in the NoSQL World By: Ashutosh Kale, Adham Kamel, Jordan Mercado Kevin Kim,

Data Modeling in the NoSQL World By: Ashutosh Kale, Adham Kamel, Jordan Mercado Kevin Kim, Pratyusha Pogaru, Edgar Velazquez Link to paper: https://hal.archives-ouvertes.fr/hal-01611628/document Parts & names 1. Introduction & NoSQL

526 views • 35 slides
SP SPEC ECIF IFICA ICATIONS TIONS Philippine Government Common Platform Dennis Reyes, Ph.D.

SP SPEC ECIF IFICA ICATIONS TIONS Philippine Government Common Platform Dennis Reyes, Ph.D.

ST STAND NDARD ARD DATA SH SHARING ING SP SPEC ECIF IFICA ICATIONS TIONS Philippine Government Common Platform Dennis Reyes, Ph.D. iGov Enterprise Solutions Architect 1 OVERVIEW: GOVERNMENT COMMON PLATFORM 2 Context Of Applied

246 views • 10 slides

More recommend