Tampere University of Technology

TUTCRIS Research Portal

Toward efficient many-core scheduling of partial expansion graphs

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

Details

Original languageEnglish
Title of host publicationProceedings of the 21st International Workshop on Software and Compilers for Embedded Systems, SCOPES 2018
PublisherAssociation for Computing Machinery, Inc
Pages100-103
Number of pages4
ISBN (Print)9781450357807
DOIs
Publication statusPublished - 28 May 2018
Publication typeA4 Article in a conference publication
EventInternational Workshop on Software and Compilers for Embedded Systems - St. Goar, Germany
Duration: 28 May 201830 May 2018

Conference

ConferenceInternational Workshop on Software and Compilers for Embedded Systems
CountryGermany
CitySt. Goar
Period28/05/1830/05/18

Abstract

Transformation of synchronous data flow graphs (SDF) into equivalent homogeneous SDF representations has been extensively applied as a pre-processing stage when mapping signal processing algorithms onto parallel platforms. While this transformation helps fully expose task and data parallelism, it also presents several limitations such as an exponential increase in the number of actors and excessive communication overhead. Partial expansion graphs were introduced to address these limitations for multi-core platforms. However, existing solutions are not well-suited to achieve efficient scheduling on many-core architectures. In this article, we develop a new approach that employs cyclo-static data flow techniques to provide a simple but efficient method of coordinating the data production and consumption in the expanded graphs. We demonstrate the advantage of our approach through experiments on real application models.

ASJC Scopus subject areas

Publication forum classification

Field of science, Statistics Finland