TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

Automatic hierarchical discovery of quasi-static schedules of RVC-CAL dataflow programs

Tutkimustuotosvertaisarvioitu

Standard

Automatic hierarchical discovery of quasi-static schedules of RVC-CAL dataflow programs. / Boutellier, Jani; Raulet, Mickaël; Silvén, Olli.

julkaisussa: Journal of Signal Processing Systems, Vuosikerta 71, Nro 1, 2013, s. 35-40.

Tutkimustuotosvertaisarvioitu

Harvard

Boutellier, J, Raulet, M & Silvén, O 2013, 'Automatic hierarchical discovery of quasi-static schedules of RVC-CAL dataflow programs', Journal of Signal Processing Systems, Vuosikerta. 71, Nro 1, Sivut 35-40. https://doi.org/10.1007/s11265-012-0676-4

APA

Boutellier, J., Raulet, M., & Silvén, O. (2013). Automatic hierarchical discovery of quasi-static schedules of RVC-CAL dataflow programs. Journal of Signal Processing Systems, 71(1), 35-40. https://doi.org/10.1007/s11265-012-0676-4

Vancouver

Boutellier J, Raulet M, Silvén O. Automatic hierarchical discovery of quasi-static schedules of RVC-CAL dataflow programs. Journal of Signal Processing Systems. 2013;71(1):35-40. https://doi.org/10.1007/s11265-012-0676-4

Author

Boutellier, Jani ; Raulet, Mickaël ; Silvén, Olli. / Automatic hierarchical discovery of quasi-static schedules of RVC-CAL dataflow programs. Julkaisussa: Journal of Signal Processing Systems. 2013 ; Vuosikerta 71, Nro 1. Sivut 35-40.

Bibtex - Lataa

@article{3c07ff2874c243cc85e6e21248112542,
title = "Automatic hierarchical discovery of quasi-static schedules of RVC-CAL dataflow programs",
abstract = "RVC-CAL is an actor-based dataflow language that enables concurrent, modular and portable description of signal processing algorithms. RVC-CAL programs can be compiled to implementation languages such as C/C++ and VHDL for producing software or hardware implementations. This paper presents a methodology for automatic discovery of piecewise-deterministic (quasi-static) execution schedules for RVC-CAL program software implementations. Quasi-static scheduling moves computational burden from the implementable run-time system to design-time compilation and thus enables making signal processing systems more efficient. The presented methodology divides the RVC-CAL program into segments and hierarchically detects quasi-static behavior from each segment: first at the level of actors and later at the level of the whole segment. Finally, a code generator creates a quasi-statically scheduled version of the program. The impact of segment based quasi-static scheduling is demonstrated by applying the methodology to several RVC-CAL programs that execute up to 58 {\%} faster after applying the presented methodology.",
keywords = "Dataflow analysis, Scheduling, Signal processing",
author = "Jani Boutellier and Micka{\"e}l Raulet and Olli Silv{\'e}n",
year = "2013",
doi = "10.1007/s11265-012-0676-4",
language = "English",
volume = "71",
pages = "35--40",
journal = "Journal of Signal Processing Systems",
issn = "1939-8018",
publisher = "Springer Verlag",
number = "1",

}

RIS (suitable for import to EndNote) - Lataa

TY - JOUR

T1 - Automatic hierarchical discovery of quasi-static schedules of RVC-CAL dataflow programs

AU - Boutellier, Jani

AU - Raulet, Mickaël

AU - Silvén, Olli

PY - 2013

Y1 - 2013

N2 - RVC-CAL is an actor-based dataflow language that enables concurrent, modular and portable description of signal processing algorithms. RVC-CAL programs can be compiled to implementation languages such as C/C++ and VHDL for producing software or hardware implementations. This paper presents a methodology for automatic discovery of piecewise-deterministic (quasi-static) execution schedules for RVC-CAL program software implementations. Quasi-static scheduling moves computational burden from the implementable run-time system to design-time compilation and thus enables making signal processing systems more efficient. The presented methodology divides the RVC-CAL program into segments and hierarchically detects quasi-static behavior from each segment: first at the level of actors and later at the level of the whole segment. Finally, a code generator creates a quasi-statically scheduled version of the program. The impact of segment based quasi-static scheduling is demonstrated by applying the methodology to several RVC-CAL programs that execute up to 58 % faster after applying the presented methodology.

AB - RVC-CAL is an actor-based dataflow language that enables concurrent, modular and portable description of signal processing algorithms. RVC-CAL programs can be compiled to implementation languages such as C/C++ and VHDL for producing software or hardware implementations. This paper presents a methodology for automatic discovery of piecewise-deterministic (quasi-static) execution schedules for RVC-CAL program software implementations. Quasi-static scheduling moves computational burden from the implementable run-time system to design-time compilation and thus enables making signal processing systems more efficient. The presented methodology divides the RVC-CAL program into segments and hierarchically detects quasi-static behavior from each segment: first at the level of actors and later at the level of the whole segment. Finally, a code generator creates a quasi-statically scheduled version of the program. The impact of segment based quasi-static scheduling is demonstrated by applying the methodology to several RVC-CAL programs that execute up to 58 % faster after applying the presented methodology.

KW - Dataflow analysis

KW - Scheduling

KW - Signal processing

UR - http://www.scopus.com/inward/record.url?scp=84873689972&partnerID=8YFLogxK

U2 - 10.1007/s11265-012-0676-4

DO - 10.1007/s11265-012-0676-4

M3 - Article

VL - 71

SP - 35

EP - 40

JO - Journal of Signal Processing Systems

JF - Journal of Signal Processing Systems

SN - 1939-8018

IS - 1

ER -