Abstract
This paper considers strictly periodic schedules for Cyclo-Static Dataflow Graphs (CSDFGs) where, for every task, only the start time of the first phase of the first iteration is fixed. This alternative CSDFG scheduling paradigm presents further computational optimization for throughput computations and buffer sizing. It also allows us to consider a wider range of DSP applications and real-time devices, such as time triggered architectures and bufferless software-defined Network-on-chips (NoCs), where the number of periodic executions could be limited. We propose a new framework that defines a necessary and sufficient condition for the existence of such schedules, and present throughput evaluation and buffer sizing use cases.
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.
Available online: https://github.com/bbodin/kiter.
References
Sriram, S., Bhattacharyya, S.S.: Embedded Multiprocessors: Scheduling and Synchronization. CRC, Boca Raton, second edition (2009)
Lee, E.A., Messerschmitt, D.G.: Synchronous data flow. Proc. IEEE 75(9), 1235–1245 (1987)
Bilsen, G., Engels, M., Lauwereins, R., Peperstraete, J.A.: Cyclo-static data flow. IEEE Trans. Sign. Process. 3255–3258 (1995)
Mousavi, M.R., et al.: Throughput analysis of synchronous data flow graphs. In: Application of Concurrency to System Design (2006)
de Groote, R.: Throughput analysis of dataflow graphs. In: Handbook of Signal Processing Systems, pp. 751–786. Springer (2018)
Benabid, A., Hanen, C., Marchetti, O., Munier-Kordon, A.: Periodic schedules for bounded timed weighted event graphs. IEEE Trans. Autom. Control 57(5), 1222–1232 (2012)
Bodin, B., Munier-Kordon, A., De Dinechin, B.D.: Periodic schedules for cyclo-static dataflow. In: ESTIMedia 2013–11th IEEE Symposium on Embedded Systems for Real-Time Multimedia, pp. 105–114 (2013)
Wiggers, M.H., Bekooij, M.J.G., Smit, G.J.M.: Efficient computation of buffer capacities for cyclo-static dataflow graphs. In: Design Automation Conference, pp. 658–663 (2007)
Benazouz, M., Marchetti, O., Munier-Kordon, A., Michel, T.: A new method for minimizing buffer sizes for cyclo-static dataflow graphs. In: IEEE Workshop on Embedded Systems for Real-Time Multimedia, pp. 11–20 (2010)
Benazouz, M., Munier-Kordon, A.: Cyclo-static dataflow phases scheduling optimization for buffer sizes minimization, pp. 3–12. International Workshop on Software and Compilers for Embedded Systems, M-SCOPES (2013)
Gendy, A.K., Pont, M.J.: Automatically configuring time-triggered schedulers for use with resource-constrained, single-processor embedded systems. IEEE Trans. Ind. Inform. 4(1), 37–46 (2008)
Venkataramani, V., Kulkarni, A., Mitra, T., Peh, L.S.: Spectrum: a software-defined predictable many-core architecture for LTE/5g baseband processing. ACM Trans. Embed. Comput. Syst. 19(5), 1–28 (2020)
Aubry, P., et al.: Extended cyclostatic dataflow program compilation and execution for an integrated manycore processor. Proc. Comput. Sci. 18, 1624–1633 (2013)
Bell, S., et al.: TILE64™processor: a 64-core SoC with mesh interconnect. In: Digest of Technical Papers - IEEE International Solid-State Circuits Conference (2008)
Niknam, S., Wang, P., Stefanov, T.: Hard Real-Time Scheduling of Streaming Applications Modeled as Cyclic CSDF Graphs. Design, Automation and Test in Europe, pp. 1549–1554 (2019)
Stuijk, S., Geilen, M., Basten, T.: Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs. In: Proceedings - Design Automation Conference, pp. 899–904 (2006)
Reiter, R.: Scheduling parallel computations. JACM 15(4), 590–599 (1968)
De Groote, R., Hölzenspies, P.K.F., Kuper, J., Broersma, H.: Back to basics: homogeneous representations of multi-rate synchronous dataflow graphs. In: International Conference on Formal Methods and Models for Codesign (2013)
Damavandpeyma, M., Stuijk, S., Basten, T., Geilen, M., Corporaal, H.: Schedule-extended synchronous dataflow graphs. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 32(10) (2013)
Honorat, A., Desnos, K., Bhattacharyya, S.S., Nezan, J.-F.: Scheduling of synchronous dataflow graphs with partially periodic real-time constraints. In: RTNS 2020: Proceedings of the 28th International Conference on Real-Time Networks and Systems, pp. 22–33 (2020)
Stuijk, S., Geilen, M., Basten, T.: Throughput-buffering trade-off exploration for cyclo-static and synchronous dataflow graphs. IEEE Trans. Comput. 57(10), 1331–1345 (2008)
Hendriks, M., et al.: Monotonic optimization of dataflow buffer sizes. J. Sign. Process. Syst. 91(1), 21–32 (2019)
Bodin, B., Munier-Kordon, A., De Dinechin, B.D.: Optimal and fast throughput evaluation of CSDF. In: Design Automation Conference (2016)
Acknowledgements
The authors wish to express their thanks for the financial support of the Yale-NUS College Summer Research Programme. This work was also supported by a grant awarded to Dr. Bruno Bodin by the Singapore Ministry of Education (AcRF Tier 1/Yale-NUS Internal Grant IG19-SG102).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Kouteili, S.N., Spagnuolo, F., Bodin, B. (2022). Strictly Periodic Scheduling of Cyclo-Static Dataflow Models. In: Orailoglu, A., Jung, M., Reichenbach, M. (eds) Embedded Computer Systems: Architectures, Modeling, and Simulation. SAMOS 2021. Lecture Notes in Computer Science, vol 13227. Springer, Cham. https://doi.org/10.1007/978-3-031-04580-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-031-04580-6_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-04579-0
Online ISBN: 978-3-031-04580-6
eBook Packages: Computer ScienceComputer Science (R0)