Implementing declarative overlays
By Boon Thau Loo, Tyson Condie, Joseph M Hellerstein, Petros Maniatis, Timothy Roscoe, Ion Stoica. Symposium on Operating Systems Principles, 2005
381 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Information Systems
View Paper: https://www.semanticscholar.org/paper/d67f903d6db26a00285cf5c16707bdd85cfc3a34
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Ion Stoica
- Joseph M Hellerstein
- Petros Maniatis
- Frank McSherry
- Tyson Condie
- Paul Barham
- David E. Gay
- Raghu Ramakrishnan
In Information Systems
- Derek Gordon Murray
- Michael Isard
- Ion Stoica
- Petros Maniatis
- Martín Abadi
- Paul Barham
- Joseph M Hellerstein
- Raghu Ramakrishnan
Citations in the corpus
- Pip: Detecting the Unexpected in Distributed Systems (2006, neutral): “Languages like Estelle [11], -calculus [20], joincalculus [9], and P2 [ 18 ] embrace a formal, declarative approach.”
- Naiad: a timely dataflow system (2013, methodology): “Previous systems have constructed cyclic dataflow graphs for purposes such as distributed overlays [24] and routing protocols [23, 25], packet processing in software [20], and high-throughput server design [39].”
- A catalog of stream processing optimizations (2014, background): “There are also dialects of logic languages for streaming, for example, Overlog [Loo et al. 2005].”
- Declarative networking: language, execution and optimization (2006, methodology): “We note thatNDlog is flexible enough for expressing most of these programs efficiently, and provides the advantages of having clear semantics as described above (something that is not available in the original language for P2 described in [23]) and a clearly defined link-restricted implementation as”