Decidable signal processing dataflow graphs

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Digital signal processing algorithms can be naturally represented by a dataflow graph where nodes represent function blocks and arcs represent the data dependency between nodes. Among various dataflow models, decidable dataflow models have restricted semantics so that we can determine the execution order of nodes at compile-time and decide if the program has the possibility of buffer overflow or deadlock. In this chapter, we explain the synchronous dataflow (SDF) model as the pioneering and representative decidable dataflow model and its decidability focusing on how the static scheduling decision can be made. Through static scheduling, we can estimate the performance and resource requirement of an SDF graph on a multiprocessor system. In addition the cyclo-static dataflow model and a few other extended models are briefly introduced to show how they overcome the limitations of the SDF model.

Cite

CITATION STYLE

APA

Ha, S., & Oh, H. (2018). Decidable signal processing dataflow graphs. In Handbook of Signal Processing Systems (pp. 907–937). Springer International Publishing. https://doi.org/10.1007/978-3-319-91734-4_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free