This paper studies timely dataflow, a model for data-parallel computing in which each communication event is associated with a virtual time. It defines and investigates the could-result-in relation which is central to this model, then the semantics of timely dataflow graphs.
CITATION STYLE
Abadi, M., & Isard, M. (2015). Timely dataflow: A model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9039, pp. 131–145). Springer Verlag. https://doi.org/10.1007/978-3-319-19195-9_9
Mendeley helps you to discover research relevant for your work.