An Asynchronous Protocol for Release Consistent Distributed Shared Memory Systems

被引:0
|
作者
Jaeheung Yeo
Heon Y. Yeom
Taesoon Park
机构
[1] Seoul National University,Department of Computer Science
[2] Sejong University,Department of Computer Engineering
来源
关键词
distributed shared memory; lazy release consistency; asynchronous release consistency; page fault;
D O I
暂无
中图分类号
学科分类号
摘要
Distributed shared memory (DSM) systems provide a simple programming paradigm for networks of workstations, which are gaining popularity due to their cost-effective high computing power. However, DSM systems usually exhibit poor performance due to the large communication delay between the nodes; and a lot of different memory consistency models have been proposed to mask the network delay. In this paper, we propose an asynchronous protocol for the release consistent memory model, which we call an Asynchronous Release Consistency (ARC) protocol. Unlike other protocols where the communication adheres to the synchronous request/receive paradigm, the ARC protocol is asynchronous, such that the necessary pages are broadcast before they are requested. Hence, the network delay can be reduced by proper prefetching of necessary pages. We have also compared the performance of the ARC protocol with the lazy release protocol by running standard benchmark programs; and the experimental results showed that the ARC protocol achieves a performance improvement of up to 29%.
引用
收藏
页码:25 / 41
页数:16
相关论文
共 50 条
  • [31] Is It Time To Rethink Distributed Shared Memory Systems?
    Ramesh, Bharath
    Ribbens, Calvin J.
    Varadarajan, Srinidhi
    2011 IEEE 17TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2011, : 212 - 219
  • [32] Fault recovery for distributed shared memory systems
    Dieter, WR
    Lumpp, JE
    1997 IEEE AEROSPACE CONFERENCE PROCEEDINGS, VOL 2, 1997, : 525 - 540
  • [33] Reducing overheads in distributed shared memory systems
    Morris, J
    Gregg, RR
    Herbert, D
    McCoull, J
    THIRTIETH HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL 1: SOFTWARE TECHNOLOGY AND ARCHITECTURE, 1997, : 244 - 252
  • [34] PANEL - PARALLEL AND DISTRIBUTED COMPUTING DISTRIBUTED MEMORY OR SHARED MEMORY-SYSTEMS
    REIJNS, GL
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 12 : 543 - 544
  • [35] Simulating shared memory primitives in asynchronous message passing systems
    Univ of Nevada, Las Vegas, United States
    Comput Syst Sci Eng, 2 (75-83):
  • [36] Model checking parameterized asynchronous shared-memory systems
    Durand-Gasselin, Antoine
    Esparza, Javier
    Ganty, Pierre
    Majumdar, Rupak
    FORMAL METHODS IN SYSTEM DESIGN, 2017, 50 (2-3) : 140 - 167
  • [37] EFFICIENCY OF SEMISYNCHRONOUS VERSUS ASYNCHRONOUS SYSTEMS - ATOMIC SHARED MEMORY
    MAVRONICOLAS, M
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1993, 25 (02) : 81 - 91
  • [38] Model Checking Parameterized Asynchronous Shared-Memory Systems
    Durand-Gasselin, Antoine
    Esparza, Javier
    Ganty, Pierre
    Majumdar, Rupak
    COMPUTER AIDED VERIFICATION, PT I, 2015, 9206 : 67 - 84
  • [39] Model checking parameterized asynchronous shared-memory systems
    Antoine Durand-Gasselin
    Javier Esparza
    Pierre Ganty
    Rupak Majumdar
    Formal Methods in System Design, 2017, 50 : 140 - 167
  • [40] The boundary-restricted coherence protocol for scalable and highly available distributed shared memory systems
    Theel, OE
    Fleisch, BD
    COMPUTER JOURNAL, 1996, 39 (06): : 496 - 510