An efficient protocol with synchronization accelerator for multi-processor embedded systems

被引:0
|
作者
Yu, Jiyang [1 ]
Liu, Peng [1 ]
Wang, Weidong [1 ]
Huang, Chunming [1 ,3 ]
Yang, Jie [1 ,4 ]
Jiang, Yingtao [2 ]
Yao, Qingdong [1 ]
机构
[1] Zhejiang Univ, Dept Informat Sci & Elect Engn, Hangzhou 310003, Zhejiang, Peoples R China
[2] Univ Nevada, Dept Elect & Comp Engn, Las Vegas, NV 89154 USA
[3] Baidu Co Ltd, Dept Mobile Applicat, Shanghai, Peoples R China
[4] NetEase Inc, Pangu Creator Studio, Hangzhou, Zhejiang, Peoples R China
基金
国家高技术研究发展计划(863计划); 中国国家自然科学基金;
关键词
Real-time operating system; Parallel programming; Interface protocol; Synchronization; Multicore; SUPPORT;
D O I
10.1016/j.parco.2013.04.008
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
With the proliferation of multi-processor core systems, parallel programming imposes a difficult challenge where current solutions are far from being considered efficient. In order to alleviate the difficulty of parallel programming, we propose a scheduler, which is part of a master-slave RTOS, to efficiently manage the parallel programs running on a multi-processor core system. We also propose an efficient protocol that serves as the interface between the operating system and application programs. This interface protocol runs on a dedicated control subnet to cut down the synchronization overhead between the parallel tasks. Such synchronization overhead incurred in these multi-core parallel systems has been recognized as one of the severe limiting factors when pushing up the performance envelope. Experimental results, obtained from the register-transfer level simulations of various benchmark parallel programs, show that the proposed protocol and the control subnet can improve the system efficiency by up to 33.5%. This protocol, as it is designed to be compatible with the minimum subset of the massage-passing interface functions (MPI), scales well with the number of cores. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:461 / 474
页数:14
相关论文
共 50 条
  • [41] A consideration of processor utilization on multi-processor system
    Kashiwagi, Koichi
    Higami, Yoshinobu
    Kobayashi, Shin-Ya
    ADVANCES IN INFORMATION PROCESSING AND PROTECTION, 2007, : 383 - 390
  • [42] Shared multi-processor scheduling
    Dereniowski, Dariusz
    Kubiak, Wieslaw
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 261 (02) : 503 - 514
  • [43] Multi-Processor Debug in SoC and Processor designs
    Penner, Bill
    2013 INTERNATIONAL SYMPOSIUM ON VLSI DESIGN, AUTOMATION, AND TEST (VLSI-DAT), 2013,
  • [44] Chip multi-processor generator
    Solomatnikov, Alex
    Firoozshahian, Amin
    Qadeer, Wajahat
    Shacham, Ofer
    Kelley, Kyle
    Asgar, Zain
    Wachs, Megan
    Hameed, Rehan
    Horowitz, Mark
    2007 44TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2007, : 262 - +
  • [45] Design and program multi-processor platform for high-performance embedded processing
    Liu, Yijun
    Li, Zhenkun
    Journal of Software, 2009, 4 (10) : 1069 - 1075
  • [46] Design space exploration algorithm for heterogeneous multi-processor embedded system design
    Karkowski, I
    Corporaal, H
    1998 DESIGN AUTOMATION CONFERENCE, PROCEEDINGS, 1998, : 82 - 87
  • [47] Design of an Embedded Health Monitoring Infrastructure for Accessing Multi-Processor SoC Degradation
    Zhao, Yong
    Kerkhoff, Hans G.
    2014 17TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD), 2014, : 154 - 160
  • [48] PERFORMANCE RELIABILITY EVALUATION FOR MULTI-PROCESSOR SYSTEMS WITH COMPUTATIONAL DEMANDS
    NAKAMURA, M
    OSAKI, S
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1984, 15 (01) : 95 - 105
  • [49] PERFORMANCE RELIABILITY EVALUATION FOR MULTI-PROCESSOR SYSTEMS WITH COMPUTATIONAL DEMANDS
    OSAKI, S
    NAKAGAWA, T
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 1985, 19 (01) : 48 - 49
  • [50] MULTI-PROCESSOR DATA ACQUISITION AND MONITORING SYSTEMS FOR PARTICLE PHYSICS
    WHITE, V
    BURCH, B
    ENG, K
    HEINICKE, P
    PYATETSKY, M
    RITCHIE, D
    IEEE TRANSACTIONS ON NUCLEAR SCIENCE, 1983, 30 (05) : 3925 - 3930