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 条
  • [21] Integrating Software Distributed Shared Memory and Message Passing Programming
    Wong, H. J.
    Rendell, A. P.
    2009 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING AND WORKSHOPS, 2009, : 197 - +
  • [22] Naplus: a software distributed shared memory for virtual clusters in the cloud
    Zeng, Lingfang
    Wang, Yang
    Kent, Kenneth B.
    Xiao, Ziliang
    SOFTWARE-PRACTICE & EXPERIENCE, 2017, 47 (09): : 1201 - 1220
  • [23] An improvement technique for hybrid protocol for software distributed shared memory
    Lee, SW
    Yoo, KY
    DISTRIBUTED AND PARALLEL SYSTEMS : FROM INSTRUCTION PARALLELISM TO CLUSTER COMPUTING, 2000, 567 : 155 - 164
  • [24] 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
  • [25] Compiler and software distributed shared memory support for irregular applications
    Lu, HH
    Cox, AL
    Dwarkadas, S
    Rajamony, R
    Zwaenepoel, W
    ACM SIGPLAN NOTICES, 1997, 32 (07) : 48 - 56
  • [26] Migrating-home protocol for software distributed shared memory
    Cheung, BWL
    Wang, CL
    Lau, FCM
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2002, 18 (06) : 929 - 957
  • [27] Cashmere-VLM: Remote memory paging for software distributed shared memory
    Dwarkadas, S
    Hardavellas, N
    Kontothanassis, L
    Nikhil, R
    Stets, R
    IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 153 - 159
  • [28] Cashmere-VLM: Remote memory paging for software distributed shared memory
    Dwarkadas, Sandhya
    Hardavellas, Nikolaos
    Kontothanassis, Leonidas
    Nikhil, Rishiyur
    Stets, Robert
    Proceedings of the International Parallel Processing Symposium, IPPS, : 153 - 159
  • [29] CAS-DSM: A compiler assisted software distributed shared memory
    Manoj, NP
    Manjunath, KV
    Govindarajan, R
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2004, 32 (02) : 77 - 122
  • [30] Selecting threads for workload migration in software distributed shared memory systems
    Liang, TY
    Shieh, CK
    Li, JQ
    PARALLEL COMPUTING, 2002, 28 (06) : 893 - 913