Distinguishing sharing types to minimize communication in software distributed shared memory systems

被引:8
|
作者
Liang, TY [1 ]
Ueng, JC [1 ]
Shieh, CK [1 ]
Chuang, DY [1 ]
Lee, JQ [1 ]
机构
[1] Natl Cheng Kung Univ, Dept Elect Engn, Tainan, Taiwan
关键词
thread migration; DSM; minimizing communication; data consistency; sharing types;
D O I
10.1016/S0164-1212(00)00055-8
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Using thread migration to redistribute threads to processors is a common scheme for minimizing communication needed to maintain data consistency in software distributed shared memory (DSM) systems. In order to minimize data-consistency communication, the number of shared pages is used to identify the pair of threads that will cause the most communication. This pair of threads is then co-located on the same node. Thread pairs sharing a given page can be classified into thee types, i.e., read/read (r/r), read/write (r/w) and write/write (w/w). Based on memory-consistency protocol, these three types of sharing generate distinct amounts of data-consistency communication. Ignoring this factor will mispredict the amount of communication caused by cross-node sharing and generate wrong decisions in thread migration. This paper presents a new policy called distinguishing of types sharing (DOTS) for DSM systems. The basic concept of this policy is to classify sharing among threads as r/r, r/w or w/w, each with a different weight, and then evaluate communication cost in terms of these weights. Experiments show that considering sharing types is necessary for minimization of data-consistency communication in DSM. Using DOTS for thread mapping produces more communication reduction than considering only the number of shared pages. (C) 2000 Elsevier Science Inc. All rights reserved.
引用
收藏
页码:73 / 85
页数:13
相关论文
共 50 条
  • [1] Tradeoffs between false sharing and aggregation in software distributed shared memory
    Amza, C
    Cox, A
    Rajamani, K
    Zwaenepoel, W
    ACM SIGPLAN NOTICES, 1997, 32 (07) : 90 - 99
  • [2] Optimizing OpenMP programs on software distributed shared memory systems
    Min, SJ
    Basumallik, A
    Eigenmann, R
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2003, 31 (03) : 225 - 249
  • [3] Optimizing OpenMP Programs on Software Distributed Shared Memory Systems
    Seung-Jai Min
    Ayon Basumallik
    Rudolf Eigenmann
    International Journal of Parallel Programming, 2003, 31 : 225 - 249
  • [4] Scheduling loop applications in software distributed shared memory systems
    Liang, Tyng-Yeu
    Shieh, Ce-Kuen
    Liu, Deh-Cheng
    IEICE Transactions on Information and Systems, 2000, E83-D (09) : 1721 - 1730
  • [5] Scheduling loop applications in software distributed shared memory systems
    Liang, TY
    Shieh, CK
    Liu, DC
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2000, E83D (09): : 1721 - 1730
  • [6] A transparent Software Distributed Shared Memory
    Kohn, ED
    Schuster, A
    EURO-PAR 2003 PARALLEL PROCESSING, PROCEEDINGS, 2003, 2790 : 1180 - 1189
  • [7] Software Transactional Distributed Shared Memory
    Dash, Alokika
    Demsky, Brian
    ACM SIGPLAN NOTICES, 2009, 44 (04) : 297 - 298
  • [8] Using page access behavior for load sharing on software distributed shared memory system
    Chua, EJ
    PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, 2003, : 480 - 486
  • [9] Design of a software distributed shared memory system using an MPI communication layer
    Ojima, Y
    Sato, M
    Boku, T
    Takahashi, D
    8th International Symposium on Parallel Architectures, Algorithms and Networks, Proceedings, 2005, : 220 - 227
  • [10] Selecting threads for workload migration in software distributed shared memory systems
    Liang, TY
    Shieh, CK
    Li, JQ
    PARALLEL COMPUTING, 2002, 28 (06) : 893 - 913