Tampere University of Technology

TUTCRIS Research Portal

Scheduling of parallelized synchronous dataflow actors

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Details

Original languageEnglish
Title of host publication2013 International Symposium on System-on-Chip, SoC 2013 - Proceedings
PublisherIEEE COMPUTER SOCIETY PRESS
Publication statusPublished - 2013
Publication typeA4 Article in a conference publication
Event2013 15th International Symposium on System-on-Chip, SoC 2013 - Tampere, Finland
Duration: 23 Oct 201324 Oct 2013

Conference

Conference2013 15th International Symposium on System-on-Chip, SoC 2013
CountryFinland
CityTampere
Period23/10/1324/10/13

Abstract

Parallelization of Digital Signal Processing (DSP) software is an important trend for Multi Processor System-on-Chip (MPSoC) implementation. The performance of DSP systems composed of parallelized computations depends on the scheduling technique, which must in general allocate computation and communication resources for competing tasks, and ensure that data dependencies are satisfied. In this paper, we formulate a new type of parallel task scheduling problem called Parallel Actor Scheduling (PAS) for MPSoC mapping of DSP systems that are represented as Synchronous DataFlow (SDF) graphs. In contrast to traditional SDF -based scheduling techniques, which focus on exploiting graph level (inter-actor) parallelism, the PAS problem targets the integrated exploitation of both intra- and inter-actor parallelism for platforms in which individual actors can be parallelized across multiple processing units. We address a special case of the PAS problem in which all of the actors in the DSP application or subsystem being optimized can be parallelized. For this special case, we develop and experimentally evaluate a two-phase scheduling framework with two work flows - particle swarm optimization with a mixed integer programming formulation, and particle swarm optimization with a fast heuristic based on list scheduling. We demonstrate that our PAS-targeted scheduling framework provides a useful range of trade-off's between synthesis time requirements and the quality of the derived solutions.