• DocumentCode
    652898
  • Title

    Towards an Efficient Online Causal-Event-Pattern-Matching Framework

  • Author

    Pramanik, Sarah ; Taylor, D. ; Wong, Bernard

  • Author_Institution
    David R. Cheriton Sch. of Comput. Sci., Univ. of Waterloo, Waterloo, ON, Canada
  • fYear
    2013
  • fDate
    8-11 July 2013
  • Firstpage
    481
  • Lastpage
    490
  • Abstract
    Event monitoring and logging, that is, recording the communication events between processes, is a critical component in many highly reliable distributed systems. The event logs enable the identification of certain safety-condition violations, such as race conditions and mutual-exclusion violations, as safety is generally contingent on processes communicating in a specific causally ordered pattern. Previous e orts at finding such patterns have often focused on online techniques, which are unable to identify operational problems as they occur. Online monitoring tools exist but they are often restricted to identifying a specific violation condition, such as a deadlock or a race condition, using dedicated data structures. We address the more general problem of detecting causally related event patterns that can be used to identify various undesired behaviours in the system. The main challenge for online pattern matching is the need to store the partial matches to the pattern, as they may combine with future events to form a complete match. Unlike pattern matching in most other domains, causally ordered patterns can span a potentially unbounded number of events and efficiently searching through this large collection poses a significant challenge. In this paper, we introduce OCEP, an efficient online causalevent- pattern-matching framework that bounds the number of partial matches it stores by reporting only a representative subset of pattern matches. We define a subset of matches as representative if it has at least one occurrence of each event in the pattern on each process, which is applicable for a large class of distributed applications. With this definition, OCEP introduces a backtracking algorithm to efficiently find a representative subset from the history of events. An evaluation of the framework shows that OCEP is capable of handling several frequently occurring violation patterns at the event rates of some representative distributed applications.
  • Keywords
    backtracking; computerised monitoring; distributed processing; pattern matching; OCEP; backtracking algorithm; distributed systems; event logging; event monitoring; mutual-exclusion violations; online causal-event-pattern-matching framework; online monitoring tools; online pattern matching; race conditions; safety-condition violations; Clocks; Compounds; History; Monitoring; Pattern matching; Runtime; Safety; Causal Ordering; Distributed System; Distributed System Monitoring.; Event-Based System;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Distributed Computing Systems (ICDCS), 2013 IEEE 33rd International Conference on
  • Conference_Location
    Philadelphia, PA
  • ISSN
    1063-6927
  • Type

    conf

  • DOI
    10.1109/ICDCS.2013.66
  • Filename
    6681617