Toward Efficient Many-core Scheduling of Partial Expansion Graphs

被引:0
|
作者
Hai Nam Tran [1 ]
Bhattacharyya, Shuvra S. [2 ,3 ]
Talpin, Jean-Pierre [1 ]
Gautier, Thierry [1 ]
机构
[1] INRIA, Rennes, France
[2] Univ Maryland, College Pk, MD 20742 USA
[3] Tampere Univ Technol, Tampere, Finland
来源
SCOPES '18: PROCEEDINGS OF THE 21ST INTERNATIONAL WORKSHOP ON SOFTWARE AND COMPILERS FOR EMBEDDED SYSTEMS | 2018年
关键词
PROGRAMS;
D O I
10.1145/3207719.3207734
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:100 / 103
页数:4
相关论文
共 50 条
  • [21] Efficient and Scalable Barrier Synchronization for Many-Core CMPs
    Abellan, Jose L.
    Fernandez, Juan
    Acacio, Manuel E.
    PROCEEDINGS OF THE 2010 COMPUTING FRONTIERS CONFERENCE (CF 2010), 2010, : 73 - 74
  • [22] Efficient Hardware Barrier Synchronization in Many-Core CMPs
    Abellan, Jose L.
    Fernandez, Juan
    Acacio, Manuel E.
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2012, 23 (08) : 1453 - 1466
  • [23] Toward High-Throughput Algorithms on Many-Core Architectures
    Orozco, Daniel
    Garcia, Elkin
    Khan, Rishi
    Livingston, Kelly
    Gao, Guang R.
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2012, 8 (04)
  • [24] Efficient Scheduling of Dependent Tasks in Many-Core Real-Time System Using a Hardware Scheduler
    Norollah, Amin
    Kazemi, Zahra
    Sayadi, Niloufar
    Beitollahi, Hakem
    Fazeli, Mahdi
    Hely, David
    2021 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2021,
  • [25] DAG Scheduling Algorithm for a Cluster-Based Many-Core Architecture
    Kitagawa, Yuto
    Ishigooka, Tasuku
    Azumi, Takuya
    2018 IEEE 16TH INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (EUC 2018), 2018, : 150 - 157
  • [26] Particle Swarm Algorithm Based Task Scheduling for Many-Core Systems
    Lu Junliang
    Hu Wei
    Shen Huan
    Li Yaxin
    Liu Jing
    PROCEEDINGS OF THE 2017 12TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA), 2017, : 1860 - 1864
  • [27] A discussion in favor of Dynamic Scheduling for regular applications in Many-core Architectures
    Garcia, Elkin
    Orozco, Daniel
    Pavel, Robert
    Gao, Guang R.
    2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS & PHD FORUM (IPDPSW), 2012, : 1591 - 1600
  • [28] Many-Core Real-Time Task Scheduling with Scratchpad Memory
    Cheng, Sheng-Wei
    Chang, Che-Wei
    Chen, Jian-Jia
    Kuo, Tei-Wei
    Hsiu, Pi-Cheng
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (10) : 2953 - 2966
  • [29] Efficient Distributed Data Structures for Future Many-core Architectures
    Fatourou, Panagiota
    Kallimanis, Nikolaos D.
    Kanellou, Eleni
    Makridakis, Odysseas
    Symeonidou, Christi
    2016 IEEE 22ND INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2016, : 835 - 842
  • [30] DANBI: Dynamic Scheduling of Irregular Stream Programs for Many-Core Systems
    Min, Changwoo
    Eom, Young Ik
    2013 22ND INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES (PACT), 2013, : 189 - 200