%0 Conference Proceedings
%T Timely Dataflow: A Model
%+ Google Inc [Mountain View]
%+ University of California [Santa Cruz] (UC Santa Cruz)
%+ Microsoft Research
%A Abadi, Martín
%A Isard, Michael
%Z Part 3: Real Time Systems
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Grenoble, France
%Y Susanne Graf
%Y Mahesh Viswanathan
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-9039
%P 131-145
%8 2015-06-02
%D 2015
%R 10.1007/978-3-319-19195-9_9
%K Outgoing Edge
%K Internal Edge
%K Local History
%K Back Edge
%K Partial Order
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01767326/document
%2 https://inria.hal.science/hal-01767326/file/978-3-319-19195-9_9_Chapter.pdf
%L hal-01767326
%U https://inria.hal.science/hal-01767326
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-9039