SPMD EXECUTION OF PROGRAMS WITH POINTER-BASED DATA-STRUCTURES ON DISTRIBUTED-MEMORY MACHINES

被引:1
|
作者
GUPTA, R
机构
[1] Department of Computer Science, University of Pittsburgh, Pittsburgh
基金
美国国家科学基金会;
关键词
D O I
10.1016/0743-7315(92)90026-J
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper discusses an approach to supporting SPMD (single-program, multiple-data) execution of programs with pointer-based data structures on distributed-memory machines. Through a combination of language design and new compilation techniques, static and dynamic implicit parallelism present in sequential programs based upon pointer-based data structures is exploited. Language support is provided for constructing and manipulating local as well as distributed data structures. The compiler translates the program for execution in SPMD mode in which each processor executes that part of the program which operates on the elements of distributed data structures local to the processor. Therefore the parallelism implicit in a sequential program is exploited. A novel approach for implementing pointers which is based upon the generation of names for the nodes in a data structure is presented in this paper. The name based strategy enables the dynamic distribution of data structures among the processors as well as the traversal of distributed data structures without interprocessor communication. © 1992.
引用
收藏
页码:92 / 107
页数:16
相关论文
共 39 条
  • [1] SUPPORTING DYNAMIC DATA-STRUCTURES ON DISTRIBUTED-MEMORY MACHINES
    ROGERS, A
    CARLISLE, MC
    REPPY, JH
    HENDREN, LJ
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1995, 17 (02): : 233 - 263
  • [2] A GENERAL DATA DEPENDENCE TEST FOR DYNAMIC, POINTER-BASED DATA-STRUCTURES
    HUMMEL, J
    HENDREN, LJ
    NICOLAU, A
    SIGPLAN NOTICES, 1994, 29 (06): : 218 - 229
  • [3] Data distribution analysis and optimization for pointer-based distributed programs
    Lee, JK
    Ho, D
    Chuang, YC
    PROCEEDINGS OF THE 1997 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 1997, : 56 - 63
  • [4] THE DATA ALIGNMENT PHASE IN COMPILING PROGRAMS FOR DISTRIBUTED-MEMORY MACHINES
    LI, JK
    CHEN, M
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 13 (02) : 213 - 221
  • [5] ON DATA DEPENDENCE ANALYSIS FOR COMPILING PROGRAMS ON DISTRIBUTED-MEMORY MACHINES
    SHARMA, S
    HUANG, CH
    SADAYAPPAN, P
    SIGPLAN NOTICES, 1993, 28 (01): : 13 - 16
  • [6] Automatic Copying of Pointer-Based Data Structures
    Chen, Tong
    Sura, Zehra
    Sung, Hyojin
    LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING, LCPC 2016, 2017, 10136 : 265 - 281
  • [7] Nonblocking Data Structures for Distributed-Memory Machines: Stacks as an Example
    Diep, Thanh-Dang
    Furlinger, Karl
    2021 29TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING (PDP 2021), 2021, : 9 - 17
  • [8] Data Reorganization and Prefetching of Pointer-Based Data Structures
    Park, Joonseok
    Diniz, Pedro C.
    IEEE DESIGN & TEST OF COMPUTERS, 2011, 28 (04): : 38 - 46
  • [9] Compiling array expressions for efficient execution on distributed-memory machines
    Gupta, SKS
    Kaushik, SD
    Huang, CH
    Sadayappan, P
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 32 (02) : 155 - 172
  • [10] Parallelizing molecular dynamics programs for distributed-memory machines
    Hwang, Yuan-Shin
    Das, Raja
    Saltz, Joel H.
    Hodoscek, Milan
    Brooks, Bernard R.
    IEEE computational science & engineering, 2 (02): : 18 - 29