Eliminating redundant communication of code generation for distributed memory machines

被引：0
|
作者：
Shen, Ya Nan [1 ]
Zhao, Rong Cai [1 ]
Wang, Lei [2 ]
机构：
[1] Natl Digital Switching Syst Engn & Technol R&D Ct, Zhengzhou 450002, Peoples R China
[2] Beijing Univ Aeronaut & Astronaut, Beijing 100083, Peoples R China
来源：
SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 2, PROCEEDINGS | 2007年
关键词：
D O I：
10.1109/SNPD.2007.482
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
How to, eliminate redundant communications is a key issue in developing, parallelizing compilers for distributed' memory, machines. An important way, to) improve the, performance of the code generated by parallelizing compiler in distributed memory systems is to eliminate as much communications as possible. This paper investigates algorithms for generating communications code from previously published work and modifies them to eliminate redundant communications. Based on the mathematical model of symbolic coefficient linear inequalities the revisited formal specification of communications sets are presented and the corresponding improved algorithms are given. Experimental results indicate that the new algorithms can reduce communication messages and improve the performance of parallelized code significantly.
引用
收藏
页码：751 / +
页数：2
相关论文
共 50 条
  • [41] Load balancing strategies for distributed memory machines
    Diekman, R
    Preis, R
    [J]. PARALLEL AND DISTRIBUTED PROCESSING FOR COMPUTATIONAL MECHANICS: SYSTEMS AND TOOLS, 1997, : 124 - 157
  • [42] ON THE DESIGN OF PARALLEL PROGRAMS FOR MACHINES WITH DISTRIBUTED MEMORY
    GOMM, D
    HECKNER, M
    LANGE, KJ
    RIEDLE, G
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 487 : 381 - 391
  • [43] Parallel numerical algorithms for distributed memory machines
    Bassomo, P
    Sakho, I
    Corbel, A
    [J]. PARALLEL COMPUTATION, 1999, 1557 : 581 - 583
  • [44] ARRAY PRIVATIZATION FOR SHARED AND DISTRIBUTED MEMORY MACHINES
    TU, P
    PADUA, D
    [J]. SIGPLAN NOTICES, 1993, 28 (01): : 64 - 67
  • [45] Scalable scheduling algorithm for distributed memory machines
    Darbha, S
    Agrawal, DP
    [J]. EIGHTH IEEE SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1996, : 84 - 91
  • [46] Code generation for multi-phase tasks on a multi-core distributed memory platform
    Fort, Frederic
    Forget, Julien
    [J]. 2019 IEEE 25TH INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS (RTCSA 2019), 2019,
  • [47] Automatic Code Generation from Finite State Machines
    Rincon Nigro, Mario
    Aguilar Castro, Jose
    Hidrobo Torres, Francisco
    [J]. COMPUTACION Y SISTEMAS, 2011, 14 (04): : 405 - 421
  • [48] Code Generation for Multiprocessor Distributed Computing Systems
    Volkov, Victor
    Ivanova, Vera
    Syschikov, Alexey
    [J]. PROCEEDINGS OF THE 2017 21ST CONFERENCE OF OPEN INNOVATIONS ASSOCIATION (FRUCT), 2017, : 358 - 363
  • [49] Automatic data layout for distributed-memory machines
    Kennedy, K
    Kremer, U
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1998, 20 (04): : 869 - 916
  • [50] A distributed power generation communication system
    Meng, J
    [J]. CCECE 2003: CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1-3, PROCEEDINGS: TOWARD A CARING AND HUMANE TECHNOLOGY, 2003, : 483 - 486
12345