Weighted fair share scheduling for loosely controlled concurrent event systems

In asynchronous event systems, the production of an event is decoupled from its consumption via an event queue. The loose coupling of such systems allows great flexibility as to where and when within the system the event handler of a given event is actually executed, allowing them to scale with increasing number of processors on a given node or across multiple nodes in a distributed system. Although this flexibility is useful in heterogeneous distributed systems, such as SOA, it may appear not to be well suited for real-time systems, which require an upper bound on how long an event can remain unhandled in a queue. However, we show how the weighted fair scheduling algorithms developed for QoS routing can be adapted to event queues to bound the delay between production and consumption. We achieve this despite the fact that the underlying execution environment is only weakly controlled, through the use of predictive techniques on a calibrated model of the event system. Our choice of a...

• Type: Journal
• Year: 2010
• Where: SOCA
• Authors: Sean Rooney, Luis Garcés-Erice, Kristijan Dragicevic, Daniel Bauer
• Keywords: Applied Computing, Asynchronous Event Systems, Distributed Systems, Event Queue, SOCA 2010