Copyright ©2009 Opher Etzion Event Processing Course Lecture 10 – Focal points on challenging topics (related to chapter 11)

Slides:



Advertisements
Similar presentations
Global States.
Advertisements

Distributed Computing 5. Snapshot Shmuel Zaks ©
1 Fault Diagnosis for Timed Automata Stavros Tripakis VERIMAG.
CS 542: Topics in Distributed Systems Diganta Goswami.
CS4231 Parallel and Distributed Algorithms AY 2006/2007 Semester 2 Lecture 6 Instructor: Haifeng YU.
ILP: IntroductionCSCE430/830 Instruction-level parallelism: Introduction CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng.
Lecture 8: Asynchronous Network Algorithms
Hoare’s Correctness Triplets Dijkstra’s Predicate Transformers
Parallel and Distributed Simulation Lookahead Deadlock Detection & Recovery.
Lookahead. Outline Null message algorithm: The Time Creep Problem Lookahead –What is it and why is it important? –Writing simulations to maximize lookahead.
Time and Global States Part 3 ECEN5053 Software Engineering of Distributed Systems University of Colorado, Boulder.
Chapter 5. Probabilistic Analysis and Randomized Algorithms
Stochastic Processes Dr. Nur Aini Masruroh. Stochastic process X(t) is the state of the process (measurable characteristic of interest) at time t the.
Getting Started with MPI Self Test with solution.
PTIDES: Programming Temporally Integrated Distributed Embedded Systems Yang Zhao, EECS, UC Berkeley Edward A. Lee, EECS, UC Berkeley Jie Liu, Microsoft.
Distributed Systems Fall 2010 Time and synchronization.
S. Barua – CPSC 440 CHAPTER 6 ENHANCING PERFORMANCE WITH PIPELINING This chapter presents pipelining.
CMPT 431 Dr. Alexandra Fedorova Lecture VIII: Time And Global Clocks.
Distributed Systems Fall 2009 Logical time, global states, and debugging.
Copyright ©2009 Opher Etzion Event Processing Course Lecture 11 – Event processing of tomorrow (related to chapter 12)
1 Lecture 4: Advanced Pipelines Data hazards, control hazards, multi-cycle in-order pipelines (Appendix A.4-A.10)
CPSC 668Set 16: Distributed Shared Memory1 CPSC 668 Distributed Algorithms and Systems Fall 2006 Prof. Jennifer Welch.
Software Testing and Quality Assurance
1 Lecture 5: Pipeline Wrap-up, Static ILP Basics Topics: loop unrolling, VLIW (Sections 2.1 – 2.2) Assignment 1 due at the start of class on Thursday.
Event Processing Course Event Types (relates to chapter 3)
Design of Fault Tolerant Data Flow in Ptolemy II Mark McKelvin EE290 N, Fall 2004 Final Project.
1 Psych 5500/6500 The t Test for a Single Group Mean (Part 5): Outliers Fall, 2008.
Copyright ©2009 Opher Etzion Event Processing Course Engineering and implementation considerations (related to chapter 10)
Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring Principles of Reliable Distributed Systems Recitation 5: Reliable.
1 Lecture 4: Advanced Pipelines Data hazards, control hazards, multi-cycle in-order pipelines (Appendix A.4-A.10)
Event Processing Course Event Patterns (relates to chapter 9)
Copyright ©2009 Opher Etzion Event Processing Course Filtering and transformation (Relates to Chapter 8)
Event Processing Course Event processing networks (relates to chapter 6)
1 Lecture 4: Advanced Pipelines Control hazards, multi-cycle in-order pipelines, static ILP (Appendix A.4-A.10, Sections )
Program Analysis Mooly Sagiv Tel Aviv University Sunday Scrieber 8 Monday Schrieber.
Lecture 12 Synchronization. EECE 411: Design of Distributed Software Applications Summary so far … A distributed system is: a collection of independent.
Composition Model and its code. bound:=bound+1.
Event Processing Course Producers and consumers (relates to chapters 4 + 5)
Prepared By: Ronak Shah Professor :Dr. T. Y Lin ID: 116.
Time, Clocks, and the Ordering of Events in a Distributed System Leslie Lamport (1978) Presented by: Yoav Kantor.
Distributed Systems Foundations Lecture 1. Main Characteristics of Distributed Systems Independent processors, sites, processes Message passing No shared.
Chapter 17 Theoretical Issues in Distributed Systems
Higher-Level Cognitive Processes
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
DISTRIBUTED ALGORITHMS By Nancy.A.Lynch Chapter 18 LOGICAL TIME By Sudha Elavarti.
Page 1 Logical Clocks Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation is.
Distributed Systems Fall 2010 Logical time, global states, and debugging.
Copyright © Lopamudra Roychoudhuri
Section 3.2 Notes Conditional Probability. Conditional probability is the probability of an event occurring, given that another event has already occurred.
Event Processing In Action Opher Etzion Peter Niblett First and only book that provides in-depth explanation of event processing concepts in generic way,
1 TCP Timeout And Retransmission Chapter 21 TCP sets a timeout when it sends data and if data is not acknowledged before timeout expires it retransmits.
CIS825 Lecture 2. Model Processors Communication medium.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Building Dependable Distributed Systems, Copyright Wenbing Zhao
Finding document topics for improving topic segmentation Source: ACL2007 Authors: Olivier Ferret (18 route du Panorama, BP6) Reporter:Yong-Xiang Chen.
Logical Clocks. Topics r Logical clocks r Totally-Ordered Multicasting.
Chapter One Introduction to Pipelined Processors
Study & Conclusions. Perspectives on Face-to-face Interaction Success at anticipating the actions of the other – Implies need for Model of user that supports.
© Kenneth C. Louden, Chapter 7 - Control I: Expressions and Statements Programming Languages: Principles and Practice, 2nd Ed. Kenneth C. Louden.
1 Software Testing. 2 What is Software Testing ? Testing is a verification and validation activity that is performed by executing program code.
PHIL 2 Philosophy: Ethics in Contemporary Society Week 2 Topic Outlines.
Distributed Systems Lecture 6 Global states and snapshots 1.
Logical time Causality between events is fundamental to the design of parallel and distributed systems. In distributed systems, it is not possible to have.
Syntax Analysis Chapter 4.
The TESLA Broadcast Authentication Protocol CS 218 Fall 2017
COT 5611 Operating Systems Design Principles Spring 2012
Objective of This Course
Chap 5 Distributed Coordination
COT 5611 Operating Systems Design Principles Spring 2014
Presentation transcript:

Copyright ©2009 Opher Etzion Event Processing Course Lecture 10 – Focal points on challenging topics (related to chapter 11)

Copyright ©2009 Opher Etzion 2 Lecture outline  Temporal semantics of event processing  Inexact event processing  Retraction and causality

Copyright ©2009 Opher Etzion 3 Time point vs. time interval A time interval is a data type that designates a continuous segment in time, starting at a time point (Ts) and ending at a time point (Te). A temporal element is a non overlapping collection of time intervals

Copyright ©2009 Opher Etzion 4 Putting derived events in order

Copyright ©2009 Opher Etzion 5 Occurrence time of derived events 1.Occurrence time := detection time 2. Occurrence time := Occurrence time of last event / expiration of context 3. Occurrence time := time interval that includes all relevant event/ temporal context

Copyright ©2009 Opher Etzion 6 Event order and out-of-order semantics – occurrence time synchronization  Clock synchronization  Time server. Example:

Copyright ©2009 Opher Etzion 7 Ordering in a distributed environment - possible issues  The occurrence time of an event is accurate, but the event arrives out-of-order and processing that should have included the event might already been executed.  Neither the occurrence time nor detection time can be trusted, so the order of events cannot be accurately determined.

Copyright ©2009 Opher Etzion 8 Buffering technique  Assumptions: oEvents are reported by the producers as soon as they occur; oThe delay in reporting events to the system is relatively small, and can be bounded by a time-out offset; oEvents arriving after this time-out can be ignored.  Principles: o Let  be the time-out offset, according to the assumption it is safe to assume that at any time-point t, all events whose occurrence time is earlier than t -  have already arrived. o Each event whose occurrence time is To is then kept in the buffer until To+ , at which time the buffer can be sorted by occurrence time, and then events can be processed in this sorted order.

Copyright ©2009 Opher Etzion 9 Retrospective compensation  Find out all EPAs that have already sent derived events which would have been affected by the "out-of-order" event if it had arrived at the right time.  Retract all the derived events that should not have been emitted in their current form.  Replay the original events with the late one inserted in its correct place in the sequence so that the correct derived events are generated.

Copyright ©2009 Opher Etzion 10 Inexact event processing  uncertainty whether an event actually occurred  inexact content in the event payload  inexact matching between derived events and the situations they purport to describe

Copyright ©2009 Opher Etzion 11 False positives and false negatives  False positive situation detection refers to cases in which an event representing a situation was emitted by an event processing system, but the situation did not occur in reality.  False negative situation detection refers to cases in which a situation occurred in reality, but the event representing this situation was not emitted by an event processing system

Copyright ©2009 Opher Etzion 12 Handling inexact event processing  Example: probabilistic approach

Copyright ©2009 Opher Etzion 13 Retraction

Copyright ©2009 Opher Etzion 14 Event Causality  Event Causality is a relation between two events e1 and e2, designating the fact that the occurrence of the event e1 caused the occurrence of event e2. oType I: predetermined causality. This type of causality refers to raw events, e1 and e2 where we know that event e2 always occurs as a result the occurrence of e1. We may thus assume that if e1 has been reported, e2 occurred whether reported or not. This occurrence may also be conditioned, for example some time offset or interval may be attached to this causality. oType II: Induced causality. The event e1 is an input to an EPA a1, and the derived event e2 is the output of a1. oType III: Potential causality. The event e1 is an event that is sent from an EPN to a consumer c1. The actions of c1 are beyond the borders of the event processing system, but c1 also acts as an event producer and can produce events of type e2. The event processing system cannot know, without further knowledge, whether there is indeed causality among events e1 and e2, but cannot rule out this possibility.

Copyright ©2009 Opher Etzion 15 Summary In the lecture we discussed:  Temporal semantics issues: temporal intervals, occurrence time of derived events, and keeping events in order  Inexact event processing, false positives and false negatives  Retraction  Causality