TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

Toward efficient many-core scheduling of partial expansion graphs

Tutkimustuotosvertaisarvioitu

Yksityiskohdat

AlkuperäiskieliEnglanti
OtsikkoProceedings of the 21st International Workshop on Software and Compilers for Embedded Systems, SCOPES 2018
KustantajaAssociation for Computing Machinery, Inc
Sivut100-103
Sivumäärä4
ISBN (painettu)9781450357807
DOI - pysyväislinkit
TilaJulkaistu - 28 toukokuuta 2018
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisussa
TapahtumaInternational Workshop on Software and Compilers for Embedded Systems - St. Goar, Saksa
Kesto: 28 toukokuuta 201830 toukokuuta 2018

Conference

ConferenceInternational Workshop on Software and Compilers for Embedded Systems
MaaSaksa
KaupunkiSt. Goar
Ajanjakso28/05/1830/05/18

Tiivistelmä

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

Julkaisufoorumi-taso