Sessional dataflow: short paper

Authors:
Dominic Duggan;Jianhua Yao
Affiliations:
Stevens Institute of Technology, Hoboken, NJ, USA;Stevens Institute of Technology, Hoboken, NJ, USA
Venue:
DAMP '12 Proceedings of the 7th workshop on Declarative aspects and applications of multicore programming
Year:
2012

Citing 6
Cited 0

LUCID, the dataflow programming language

LUCID, the dataflow programming language
Synchronous Kahn networks

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Languages for Digital Embedded Systems

Languages for Digital Embedded Systems
N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sessions and session types: an overview

WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Dynamic multirole session types

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of sessional dataflow is to provide a compositional semantics for dataflow computations that can be scheduled at compile-time. The interesting issues arise in enforcing static flow requirements in the composition of actors, ensuring that input and output rates of actors on related channels match, and that cycles in the composition of actors do not introduce deadlock. Ultimately the purpose of sessional dataflow is to support dynamic operations on subnets, ensuring that assumptions underlying static scheduling are not violated by operations such as subnet update and reconfiguration. This account focuses on a simplified case of sessional dataflow, to draw out the key points of the approach.