The impact of symmetry on software distributed shared memory

被引:2
|
作者
Keleher, PJ [1 ]
机构
[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
关键词
software DSM; consistency protocols; shared memory; home-based;
D O I
10.1006/jpdc.2000.1637
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A homeless protocol is one in which all nodes are treated identically when they access common resources. By contrast, home-based protocols assign a home or manager to each resource. Use of the resource by the home incurs less overhead than use by other processors. The key to good performance in such systems is to ensure that the asymmetry of the underlying protocol is skewed in the same way as that of the application. This paper presents a comparative evaluation of invalidation-based homeless and home-based software DSM protocols, We pay particular attention to those performance differences caused by symmetric and asymmetric features of the protocols. We then show how the picture changes when update protocols are targeted. We show that a modified home-based protocol can significantly outperform more general protocols in this application domain because of reduced protocol complexity. We further optimize our protocol by completely eliminating such memory manipulation calls from the steady-stale execution. Our resulting protocol improves average application performance by a further 34%, on top of the 19% improvement gained by our initial modification of the home-based protocol. (C) 2000 Academic Press.
引用
收藏
页码:1388 / 1419
页数:32
相关论文
共 50 条
  • [1] A transparent Software Distributed Shared Memory
    Kohn, ED
    Schuster, A
    EURO-PAR 2003 PARALLEL PROCESSING, PROCEEDINGS, 2003, 2790 : 1180 - 1189
  • [2] Software Transactional Distributed Shared Memory
    Dash, Alokika
    Demsky, Brian
    ACM SIGPLAN NOTICES, 2009, 44 (04) : 297 - 298
  • [3] Implementation of software distributed shared memory in Linux
    Software Engineering Institute, Beijing University of Aeronautics and Astronautics, Beijing 100083, China
    Jisuanji Gongcheng, 2006, 4 (58-60):
  • [4] Adaptive protocols for software distributed shared memory
    Amza, C
    Cox, AL
    Dwarkadas, S
    Jin, LJ
    Rajamani, K
    Zwaenepoel, W
    PROCEEDINGS OF THE IEEE, 1999, 87 (03) : 467 - 475
  • [5] Improving the performance of software distributed shared memory with speculation
    Kistler, M
    Alvisi, L
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2005, 16 (09) : 885 - 896
  • [6] Supporting software distributed shared memory with an optimizing complier
    Inagaki, T
    Niwa, J
    Matsumoto, T
    Hiraki, K
    1998 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING - PROCEEDINGS, 1998, : 225 - 234
  • [7] Synergy: A comprehensive software distributed shared memory system
    Hobbs, M
    Silcock, J
    Goscinski, A
    PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS, 2003, 2745 : 239 - 247
  • [8] Priority Based Messaging for Software Distributed Shared Memory
    Sven Karlsson
    Mats Brorsson
    Cluster Computing, 2003, 6 (2) : 161 - 169
  • [9] ViSMI: Software distributed shared memory for InfiniBand clusters
    Osendorfer, C
    Tao, J
    Trinitis, C
    Mairandres, M
    THIRD IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS, PROCEEDINGS, 2004, : 185 - 191
  • [10] Performance improvement techniques for software distributed shared memory
    Yu, BH
    Werstein, P
    Purvis, M
    Cranefield, S
    11TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL I, PROCEEDINGS, 2005, : 119 - 125