Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Exploiting statically schedulable regions in dataflow programs

Gu, Ruirui ; Janneck, Jörn LU ; Raulet, Mickaël and Bhattacharyya, Shuvra S. (2011) In Journal of Signal Processing Systems 63(1). p.129-142
Abstract
Abstract in Undetermined
Dataflow descriptions have been used in
a wide range of Digital Signal Processing (DSP)
applications, such as multi-media processing, and
wireless communications. Among various forms of
dataflow modeling, Synchronous Dataflow (SDF) is
geared towards static scheduling of computational
modules, which improves system performance and
predictability. However, many DSP applications
do not fully conform to the restrictions of SDF
modeling. More general dataflow models, such
as CAL (Eker and Janneck 2003), have been
developed to describe dynamically-structured DSP
applications. Such generalized models can express
dynamically changing functionality, but lose... (More)
Abstract in Undetermined
Dataflow descriptions have been used in
a wide range of Digital Signal Processing (DSP)
applications, such as multi-media processing, and
wireless communications. Among various forms of
dataflow modeling, Synchronous Dataflow (SDF) is
geared towards static scheduling of computational
modules, which improves system performance and
predictability. However, many DSP applications
do not fully conform to the restrictions of SDF
modeling. More general dataflow models, such
as CAL (Eker and Janneck 2003), have been
developed to describe dynamically-structured DSP
applications. Such generalized models can express
dynamically changing functionality, but lose the
powerful static scheduling capabilities provided by
SDF. This paper focuses on the detection of SDF-
like regions in dynamic dataflow descriptions—
in particular, in the generalized specification
framework of CAL. This is an important step for
applying static scheduling techniques within a dynamic
dataflow framework. Our techniques combine the advantages of different dataflow languages and tools,
including CAL (Eker and Janneck 2003), DIF (Hsu
et al. 2005) and CAL2C (Roquier et al. 2008). In
addition to detecting SDF-like regions, we apply
existing SDF scheduling techniques to exploit the
static properties of these regions within enclosing
dynamic dataflow models. Furthermore, we propose
an optimized approach for mapping SDF-like regions
onto parallel processing platforms such as multi-core
processors. (Less)
Please use this url to cite or link to this publication:
author
; ; and
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
Journal of Signal Processing Systems
volume
63
issue
1
pages
129 - 142
publisher
Springer
external identifiers
  • scopus:79954601701
ISSN
1939-8115
DOI
10.1007/s11265-009-0445-1
language
English
LU publication?
yes
id
9cf79486-6d10-400c-b884-4426f82c0e66 (old id 2224876)
date added to LUP
2016-04-01 11:15:16
date last changed
2021-09-29 05:34:26
@article{9cf79486-6d10-400c-b884-4426f82c0e66,
  abstract     = {Abstract in Undetermined<br/>Dataflow descriptions have been used in<br/>a wide range of Digital Signal Processing (DSP)<br/>applications, such as multi-media processing, and<br/>wireless communications. Among various forms of<br/>dataflow modeling, Synchronous Dataflow (SDF) is<br/>geared towards static scheduling of computational<br/>modules, which improves system performance and<br/>predictability. However, many DSP applications<br/>do not fully conform to the restrictions of SDF<br/>modeling. More general dataflow models, such<br/>as CAL (Eker and Janneck 2003), have been<br/>developed to describe dynamically-structured DSP<br/>applications. Such generalized models can express<br/>dynamically changing functionality, but lose the<br/>powerful static scheduling capabilities provided by<br/>SDF. This paper focuses on the detection of SDF-<br/>like regions in dynamic dataflow descriptions—<br/>in particular, in the generalized specification<br/>framework of CAL. This is an important step for<br/>applying static scheduling techniques within a dynamic<br/>dataflow framework. Our techniques combine the advantages of different dataflow languages and tools,<br/>including CAL (Eker and Janneck 2003), DIF (Hsu<br/>et al. 2005) and CAL2C (Roquier et al. 2008). In<br/>addition to detecting SDF-like regions, we apply<br/>existing SDF scheduling techniques to exploit the<br/>static properties of these regions within enclosing<br/>dynamic dataflow models. Furthermore, we propose<br/>an optimized approach for mapping SDF-like regions<br/>onto parallel processing platforms such as multi-core<br/>processors.},
  author       = {Gu, Ruirui and Janneck, Jörn and Raulet, Mickaël and Bhattacharyya, Shuvra S.},
  issn         = {1939-8115},
  language     = {eng},
  number       = {1},
  pages        = {129--142},
  publisher    = {Springer},
  series       = {Journal of Signal Processing Systems},
  title        = {Exploiting statically schedulable regions in dataflow programs},
  url          = {https://lup.lub.lu.se/search/files/2509886/2224878.pdf},
  doi          = {10.1007/s11265-009-0445-1},
  volume       = {63},
  year         = {2011},
}