Login
Event systems - How to have your cake and eat it too

Patrick Eugster, Pascal Felber, Rachid Guerraoui & Sidath B Handurukande

Résumé This paper addresses the fundamental tradeoffs in event systems between scalability (of event filtering, routing, and delivery mechanisms), expressiveness (when describing interests in events), and event safety (ensuring encapsulation and type-safe interaction with polymorphic events). We point out some ramifications underlying these tradeoffs and we propose a pragmatic approach to handle them. We achieve scalability using a multi-stage-filtering strategy that combines approximate and perfect matching techniques for the purpose of event routing and filtering. We achieve expressiveness and event safety by viewing events as objects, i.e., instances of application-defined abstract types.
   
Citation P. Eugster, et al., "Event systems - How to have your cake and eat it too," in 22nd International Conference on Distributed Computing Systems, Vienna, Austria, 2002, p. 625-630.
   
Type Actes de congrès (Anglais)
Editeur R Wagner
Nom de la conférence 22nd International Conference on Distributed Computing Systems (Vienna, Austria)
Date de la conférence 2002
Editeur commercial Ieee Computer Soc
Pages 625-630