Scalable Efficient Composite Event Detection

Jayaram, K. R.; Eugster, Patrick

doi:10.1007/978-3-642-13414-2_12

Cited by 10 publications

(4 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, static typing of events does not preclude the addition of new event types at runtime [3]. The small overhead incurred by such infrequent additions is largely outweighed by the gain on every event [24].…”

Section: Event Representationmentioning

confidence: 99%

See 1 more Smart Citation

Program analysis for event-based distributed systems

Jayaram

Eugster

2011

Proceedings of the 5th ACM International Conference on Distributed Event-Based System

Self Cite

View full text Add to dashboard Cite

Designing distributed applications around the idiom of events has several benefits including extensibility and scalability. To improve conciseness, safety, and efficiency of corresponding programs, several authors have recently proposed programming languages or language extensions with support for event-based programming.The presence of a dedicated programming language and compilation process offers avenues for program analyses to further improve simplicity, safety, and expressiveness of distributed event-based software. This paper presents three program analyses specifically designed for event-based programs: immutability analysis avoids costly cloning of events in the presence of co-located handlers for same events; guard analysis allows for simple yet expressive subscriptions which can be further simplified and handled efficiently; causality analysis determines causal dependencies among events which are related, allowing unrelated events to be transferred independently for efficiency. We convey the benefits of our approach by empirically evaluating their performance benefits.

show abstract

Section: Event Representationmentioning

confidence: 99%

“…In our earlier work on EventJava [15], we formalize and proves guarantees (e.g., total order) in the presence of correlation. We exploit the language to generate code for efficient correlation of events [24].…”

Section: Programming Languages and Modelsmentioning

confidence: 99%

Program analysis for event-based distributed systems

Jayaram

Eugster

2011

Proceedings of the 5th ACM International Conference on Distributed Event-Based System

Self Cite

View full text Add to dashboard Cite

show abstract

“…More elaborate and efficient matching algorithms exist, offering the same semantics. A common approach consists in storing partial matches in specialized datastructures for matching a given message effectively (e.g., [20]). The goal of this paper is not to give guidelines on how exactly correlation-enabled multicast systems should be devised but to explore the foundations.…”

Section: C-mdmcast Using Tobcastmentioning

confidence: 99%

Multicasting in the presence of aggregated deliveries

Wilkin¹,

Eugster²

2013

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

An increasing number of distributed systems relies on forms of message correlation, which result in atomic delivery of multiple messages aggregated by following processspecific criteria. Generally, more than one process is aggregating messages, implying that messages are multicast. While delivery guarantees for multicast scenarios with single message delivery are well understood, existing systems and models for aggregated deliveries either consider only unicast, centralized setups, or focus on efficiency thus providing only best-effort guarantees. This paper investigates the foundations of Multi-Delivery Multicast (MDMcast) in asynchronous distributed systems with crashstop failures. We first describe a succinct aggregation model with a concise and generic predicate grammar for expressing conjunctions on messages and properties for a corresponding multicast primitive, which we term Conjunction-MDMcast (C-MDMcast).We show that for processes interested in identical conjunctions to achieve agreement on delivered messages, a total order on individual messages (or equivalent oracle) is not only useful but necessary, which is clearly opposed to single-message deliveries.We show this indirectly by exhibiting an algorithm implementing C-MDMcast on top of Total Order Broadcast (TOBcast) and vice-versa for a majority of correct processes.Then, we extend our predicate grammar with disjunctions, leading to the specification of Disjunction-MDMcast (D-MDMcast). We exhibit an algorithm implementing D-MDMcast, derived from our algorithm implementing C-MDMcast. We formalize several additional properties for both of our specifications, including ordering properties on aggregated messages and a notion of agreement capturing non-identical yet "related" conjunctions, and show how our respective algorithms implement these.

show abstract

“…In addition it allows to anonymize the production and the consumption of the message, so producers can be effectively hidden from consumers and vice-versa, and to be more flexible than the request-reply paradigm allowing asynchronous processing. Another interesting feature of these types of system is the possibility to aggregate low level messages as higher level events: this is called Composite Event Detection [25,43] and it allows to use the same system as communication middleware, that means a single communication layer can support various applications that have dependency in the semantic of the messages they exchanges as shown in Figure 2.1.…”

Section: Distributed Event-based Systemsmentioning

confidence: 99%

A Novel Approach to Context-Aware Content-Based Middleware

Vavassori¹

View full text Add to dashboard Cite

Realizado el acto de defensa y lectura de la Tesis el día de de 2016 en la E.T.S.I. Informáticos EL PRESIDENTE LOS VOCALESLA SECRETARIA AcknowledgementsI would like to express my gratitude to all those people who directly, indirectly or unconsciously have pushed me to improve myself continuously. AbstractThe application of pervasive computing is extending from field-specific to everyday use. The Internet of Things (IoT) is the shiniest example of its application and of its intrinsic complexity compared with classical application development.The main characteristic that differentiates pervasive from other forms of computing lies in the use of contextual information. Some classical applications do not use any contextual information whatsoever. Others, on the other hand, use only part of the contextual information, which is integrated in an ad hoc fashion using an application-specific implementation. This information is handled in a one-off manner because of the difficulty of sharing context across applications. As a matter of fact, the application type determines what the contextual information is. For instance, for an imaging editor, the image is the information and its meta-data, like the time of the shot or camera settings, are the context, whereas, for a file-system application, the image, including its camera settings, is the information and the meta-data external to the file, like the modification date or the last accessed timestamps, constitute the context. This means that contextual information is hard to share. A communication middleware that supports context decidedly eases application development in pervasive computing. However, the use of context should not be mandatory; otherwise, the communication middleware would be reduced to a context middleware and no longer be compatible with non-context-aware applications.SilboPS, our implementation of content-based publish/subscribe inspired by SIENA [11,9], solves this problem by adding two new elements to the paradigm: the context and the context function. Context represents the actual contextual information specific to the message to be sent or that needs to be notified to the subscriber, whereas the context function is evaluated using the publisher's context and the subscriber's context to decide whether the current message and context are useful for the subscriber. In this manner, context logic management is decoupled from context management, increasing the flexibility of communication and usage across different applications. IIISince the default context is empty, context-aware and classical applications can use the same SilboPS, resolving the syntactic mismatch that there is between the two categories. In any case, the possible semantic mismatch is still present because it depends on how each application interprets the data, and it cannot be resolved by an agnostic third party.The IoT environment introduces not only context but scaling challenges too. The number of sensors, the volume of the data that they produce and the number of applications that coul...

show abstract

Scalable Efficient Composite Event Detection

Cited by 10 publications

References 24 publications

Program analysis for event-based distributed systems

Program analysis for event-based distributed systems

Multicasting in the presence of aggregated deliveries

A Novel Approach to Context-Aware Content-Based Middleware

Contact Info

Product

Resources

About