A parallel algorithm for computing minimum spanning trees
Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures (SPAA '92)
By Donald B. Johnson, Panagiotis Metaxas
Issue Date:June 1992
We propose a new design for highly concurrent Internet services, which we call the staged event-driven architecture (SEDA). SEDA is intended to support massive concurrency demands and simplify the construction of well-conditioned services. In SEDA, applica...