Abstract | ||
---|---|---|
We have extended an Interface Definition Language to handle event registration and notification. Clients register interest in specified classes of events, and servers then notify them of any occurrence asynchronously. Event occurrences are identified by parameters which conform to IDL typing constraints and can therefore be used in synchronous method invocations. Methods to handle registration and notification are generic and can be inherited by objects of any class: as a by-product of IDL processing the stubs to handle event creation and decoding are generated automatically. We have implemented a prototype composite event recogniser based on nested finite state machines and have defined an event algebra and language to specify composite events.The approach is inherently scalable in that only events in which an interest has been registered are notified. Alternative approaches lead to polling, mining for event data or being flooded with superfluous events. |
Year | DOI | Venue |
---|---|---|
1996 | 10.1145/504450.504453 | ACM SIGOPS European Workshop 2004 |
Keywords | Field | DocType |
event creation,superfluous event,event data,composite event,alternative approach,event occurrence,interface definition language,event algebra,prototype composite event recogniser,large scale,event registration,distributed application,finite state machine | Computer science,Server,Polling,Interface description language,Real-time computing,Finite-state machine,Event data,Decoding methods,Composite event,Scalability,Distributed computing | Conference |
Citations | PageRank | References |
14 | 1.85 | 4 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Richard Hayton | 1 | 219 | 33.10 |
Jean Bacon | 2 | 2245 | 177.11 |
John Bates | 3 | 14 | 1.85 |
Ken Moody | 4 | 935 | 85.75 |