Abstract
In this paper, we take into account lossy channels and retransmission protocols in dataflow models of computation (MoCs).Traditional dataflow MoCs cannot easily cope with lossy channels, due to the strict notion of iteration that does not allow the re-emission of lost or damaged tokens. A general dataflow graph with several lossy channels will indeed require several phases, each of them corresponding to a portion of the initial graph’s schedule. Correctly identifying and sequencing these phases is a challenge. We present a translation of a dataflow graph, written in the well-known Synchronous DataFlow (SDF) MoC of Lee and Messerschmitt, but where some channels may be lossy, into the Boolean Parametric DataFlow (BPDF) MoC.
Grenoble INP—Institute of Engineering Univ. Grenoble Alpes
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
We only consider here the minimal iteration. Any multiple of the minimal iteration is also a valid iteration.
- 2.
Obviously, an assignment does not necessarily change the value.
References
Bebelis, V., Fradet, P., Girault, A.: A framework to schedule parametric dataflow applications on many-core platforms. In: International Conference on Languages, Compilers and Tools for Embedded Systems, LCTES 2014, Edinburgh, UK. ACM, June 2014
Bebelis, V., Fradet, P., Girault, A., Lavigueur, B.: BPDF: a statically analyzable dataflow model with integer and boolean parameters. In: International Conference on Embedded Software EMSOFT 2013. ACM, September 2013
Bhattacharya, B., Bhattacharyya, S.: Parameterized dataflow modeling for DSP systems. IEEE Trans. Sig. Process. 49(10), 2408–2421 (2001)
Bhattacharyya, S., Murthy, P., Lee, E.: Software Synthesis from Dataflow Graphs. Kluwer Academic Pub, Hingham (1996)
Bouakaz, A., Fradet, P., Girault, A.: A survey of parametric dataflow models of computation. ACM Trans. Des. Autom. Electron. Syst. 22(2), 38 (2017)
Lee, E., Messerschmitt, D.: Synchronous data-flow. Proc. IEEE 75, 1235–1245 (1987)
Sih, G., Lee, E.: A compile-time scheduling heuristic for interconnection constraint heterogeneous processor architectures. IEEE Trans. Parallel Distrib. Syst. 4(2), 175–187 (1993)
Skelin, M., Geilen, M., Catthoor, F., Hendseth, S.: Parametrized dataflow scenarios. In: International Conference on Embedded Software EMSOFT 2015, Amsterdam, Netherlands, pp. 95–104. IEEE, October 2015
Stuijk, S., Geilen, M., Theelen, B., Basten, T.: Scenario-aware dataflow: modeling, analysis and implementation of dynamic applications. In: IC-SAMOS 2011, pp. 404–411. IEEE (2011)
Tanenbaum, A., Wetherall, D.: Computer Networks, 5th edn. Pearson, New York City (2011). http://www.worldcat.org/oclc/698581231
Acknowledgments
The authors are grateful for the numerous discussions with Prof. Edward Lee, the invitations to visit Berkeley, and all the good moments spent at various conferences around the world. In more than one way, the work presented in this paper originated in those discussions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Fradet, P., Girault, A., Jamshidian, L., Nicollin, X., Shafiei, A. (2018). Lossy Channels in a Dataflow Model of Computation. In: Lohstroh, M., Derler, P., Sirjani, M. (eds) Principles of Modeling. Lecture Notes in Computer Science(), vol 10760. Springer, Cham. https://doi.org/10.1007/978-3-319-95246-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-95246-8_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95245-1
Online ISBN: 978-3-319-95246-8
eBook Packages: Computer ScienceComputer Science (R0)