Default Compensation Order Satish Thatte Dieter Roller.

Slides:



Advertisements
Similar presentations
Supplemental Figure S1. Additional topological metrics of the GIL constructed from varied partitioning sizes.
Advertisements

Global States.

Vered Gafni – Formal Development of Real Time Systems 1 Statecharts Semantics.
SSA.
Review Linked list: Doubly linked list, insertback, insertbefore Remove Search.
PRIME FACTORIZATION USING FACTOR TREES!.
Tailored Scopes: A Fresh Look at Issues 1 and 10 Satish Thatte Dieter Roller Frank Leymann.
6.001 SICP SICP – October environment Trevor Darrell 32-D512 Office Hour: W web page:
Honors Compilers Semantic Analysis and Attribute Grammars Mar 5th 2002.
IBM WebSphere survey Kristian Bisgaard Lassen. University of AarhusIBM WebSphere survey2 Tools  WebSphere Application Server Portal Studio Business Integration.
Semantic analysis Enforce context-dependent language rules that are not reflected in the BNF, e.g.a function must have a return statement. Decorate AST.
1 Pertemuan 20 Run-Time Environment Matakuliah: T0174 / Teknik Kompilasi Tahun: 2005 Versi: 1/6.
BPEL (Business Process Execution Language)
Semantic analysis Enforce context-dependent language rules that are not reflected in the BNF, e.g.a function must have a return statement. Decorate AST.
Transforming Infix to Postfix
B + -Trees (Part 1) COMP171. Slide 2 Main and secondary memories  Secondary storage device is much, much slower than the main RAM  Pages and blocks.
Data Structures Using C++ 2E Chapter 11 Binary Trees and B-Trees.
C++ Programming: Program Design Including Data Structures, Third Edition Chapter 20: Binary Trees.
Software causes many failures - significant mission risk Hard to quantify effects on system risk of: software defects software development practices software.
HIT241 - TIME MANAGEMENT Introduction
80386DX.
CHP-4 QUEUE.
Basic Communication Operations Based on Chapter 4 of Introduction to Parallel Computing by Ananth Grama, Anshul Gupta, George Karypis and Vipin Kumar These.
UML / UML 2.0 Diagrams (Part III) 1. Sequence diagram is the most common kind of interaction diagram. It focuses on the message interchange between a.
BPEL4WS (Business Process Execution Language for Web Services) Nirmal Mukhi Component Systems Department IBM Research.
Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 122 – Data Structures Classes: A Deeper Look Part.
Introduction Of Tree. Introduction A tree is a non-linear data structure in which items are arranged in sequence. It is used to represent hierarchical.
AXML Transactions Debmalya Biswas. 16th AprSEIW Transactions A transaction can be considered as a group of operations encapsulated by the operations.
Guide to State Transition Diagram. 2 Contents  What is state transition diagram?  When is state transition diagram used?  What are state transition.
1 Run-Time Environments. 2 Procedure Activation and Lifetime A procedure is activated when called The lifetime of an activation of a procedure is the.
Lab 04.
Review for Final Andy Wang Data Structures, Algorithms, and Generic Programming.
CSC3315 (Spring 2008)1 CSC 3315 Subprograms Hamid Harroud School of Science and Engineering, Akhawayn University
Activity diagrams. Introduction ● Activity diagrams are a behavioural model that represent the dynamics of the system. ● An activity diagram is essentially.
An Introduction to Programming with C++ Sixth Edition Chapter 14 Sequential Access Files.
Lecture 13 Advanced Transaction Models. 2 Protocols considered so far are suitable for types of transactions that arise in traditional business applications,
Issue 53 and friends Tony Fletcher, Peter Furniss, Alastair Green Choreology Ltd.
M180: Data Structures & Algorithms in Java Trees & Binary Trees Arab Open University 1.
Evaluation and Assessment Mike Fleming. Assessment can be source of disagreement and tension implications for a Framework of reference for Languages of.
PC-Trees & PQ-Trees. 2 Table of contents Review of PQ-trees –Template operations Introducing PC-trees The PC-tree algorithm –Terminal nodes –Splitting.
Integration Testing Beyond unit testing. 2 Testing in the V-Model Requirements Detailed Design Module implementation Unit test Integration test System.
PC-Trees vs. PQ-Trees. 2 Table of contents Review of PQ-trees –Template operations Introducing PC-trees The PC-tree algorithm –Terminal nodes –Splitting.
MIMO Stacking Document and the current RMG are inconsistent with current logic and should be updated.
BoldLeads - Bold Leads Real Estate Reviews
Run-Time Environments Presented By: Seema Gupta 09MCA102.
© 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1 Advanced UML State Diagrams.
Chapter 14: Sequential Access Files
16 Exception Handling.
Run-Time Environments Chapter 7
Data Structure and Algorithms
Model Multiplication Name: _______________________________
Process Management Process Concept Why only the global variables?
Appendix D: Network Model
CHAPTER 6 PROJECT TIME MANAGEMENT
Bevel Gear Exercise This is an introductory exercise to get the user familiar with the joint coupler option.
Run-Time Environments
Model Multiplication Name: _______________________________
Names, Scopes, and Bindings: Scopes
Chapter 9 Classes: A Deeper Look, Part 1
Packages and Interfaces
Run-Time Environments
Exception Handling Imran Rashid CTO at ManiWeber Technologies.
UNIT V Run Time Environments.
Box plots of quality scores over positions in sequenced reads.
Chapter 20: Binary Trees.
Red-Black Implementation of 2-3 Trees
CHAPTER 6 PROJECT TIME MANAGEMENT
More C++ Classes Systems Programming.
Data Structures Using C++ 2E
Presentation transcript:

Default Compensation Order Satish Thatte Dieter Roller

Current Statement is Imprecise Current Statement is Run all available compensation handlers for immediately enclosed scopes in the reverse order of completion of the corresponding scopes Implies stack unraveling order to most people Problematic implications in the presence of concurrency and control links We need to define a partial order that respects completion at leaf scopes

Restatement of the Problem Default compensation traverses a tree of compensation handlers for successfully completed scopes starting from the original fault handler Real compensation occurs at the leaves where custom handlers are The order among these leaf scopes is the semantically significant question The reverse order could be about respecting Modeled order imposed by the process definition Contingent order imposed by resource contention Contingent order is hard to keep track of Must account for potential as well as actual contention

A B C E F G D H I S1S2 S3 Bold activity circles have custom compensation handlers Arrows indicate control dependencies such as sequence or link

Needs Flipping Between Stacks The operation of custom compensation handlers depends on a stack of parent scope handlers for shared state Per resolution of Issue#3 Multiple of these stacks will need to be simultaneously active during default compensation as shown on the next slide

Compensation Order for the example S3 S2S1I CABFH Compensation order indicated by numbering