Staged event-driven architecture
The staged event-driven architecture (SEDA) refers to an approach to software architecture that decomposes a complex, event-driven application into a set of stages connected by queues. It avoids the high overhead associated with thread-based concurrency models (i.e. locking, unlocking, and polling for locks), and decouples event and thread scheduling from application logic. By performing admission control on each event queue, the service can be well-conditioned to load, preventing resources from being overcommitted when demand exceeds service capacity.
SEDA employs dynamic control to automatically tune runtime parameters (such as the scheduling parameters of each stage) as well as to manage load (like performing adaptive load shedding). Decomposing services into a set of stages also enables modularity and code reuse, as well as the development of debugging tools for complex event-driven applications.
- "SEDA: An Architecture for Highly Concurrent Server Applications" (PDF). Harvard University. Retrieved 2013-09-03.
SEDA is an acronym for staged event-driven architecture, and decomposes a complex, event-driven application into a set of stages connected by queues.CS1 maint: discouraged parameter (link)
- Welsh, Matt; Culler, David; Brewer, Eric (December 2001), "SEDA: an architecture for well-conditioned, scalable internet services" in "SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles" (1st ed.), Association for Computing Machinery, pp. 230–243, ISBN 978-1-58113-389-9
- Apache ServiceMix provides a Java SEDA wrapper, combining it with related message architectures (JMS, JCA & straight-through flow).
- JCyclone: Java open source implementation of SEDA
- Mule ESB is another open-source Java implementation
- SEDA: An Architecture for Highly Concurrent Server Applications describing the PhD thesis by Matt Welsh from Harvard University
- A Retrospective on SEDA by Matt Welsh, July 26, 2010