A transparent distributed shared memory for clustered symmetric multiprocessors

被引:9
|
作者
Chang, Jyh-Biau [1 ]
Shieh, Ce-Kuen
Liang, Tyng-Yeu
机构
[1] Natl Cheng Kung Univ, Dept Elect Engn, Tainan 70101, Taiwan
[2] Natl Kaohsiung Univ Appl Sci, Dept Elect Engn, Kaohsiung, Taiwan
来源
JOURNAL OF SUPERCOMPUTING | 2006年 / 37卷 / 02期
关键词
distributed shared memory; symmetric multiprocessor; cluster computing; reconfiguration; thread architecture;
D O I
10.1007/s11227-006-5483-x
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A transparent distributed shared memory (DSM) system must achieve complete transparency in data distribution, workload distribution, and reconfiguration respectively. The transparency of data distribution allows programmers to be able to access and allocate shared data using the same user interface as is used in shared-memory systems. The transparency of workload distribution and reconfiguration can optimize the parallelism at both the user-level and the kernel-level, and also improve the efficiency of run-time reconfiguration. In this paper, a transparent DSM system referred to as Teamster is proposed and is implemented for clustered symmetric multiprocessors. With the transparency provided by Teamster, programmers can exploit all the computing power of the clustered SMP nodes in a transparent way as they do in single SMP computer. Compared with the results of previous researches, Teamster can realize the transparency of cluster computing and obtain satisfactory system performance.
引用
收藏
页码:145 / 160
页数:16
相关论文
共 50 条
  • [41] Brief Announcement: Locally-Accessible Implementations for Distributed Shared Memory Multiprocessors
    Golab, Wojciech
    PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2010, : 394 - 395
  • [42] Single-Level Integrity and Confidentiality Protection for Distributed Shared Memory Multiprocessors
    Rogers, Brian
    Yan, Chenyu
    Chhabra, Siddhartha
    Prvulovic, Milos
    Solihin, Yan
    2008 IEEE 14TH INTERNATIONAL SYMPOSIUM ON HIGH PEFORMANCE COMPUTER ARCHITECTURE, 2008, : 149 - +
  • [43] Software-Based Self-Testing of Symmetric Shared-Memory Multiprocessors
    Apostolakis, Andreas
    Gizopoulos, Dimitris
    Psarakis, Mihalis
    Paschalis, Antonis
    IEEE TRANSACTIONS ON COMPUTERS, 2009, 58 (12) : 1682 - 1694
  • [44] Optimized execution of Fortran 90 array language on symmetric shared-memory multiprocessors
    Sarkar, V
    LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING, 1999, 1656 : 131 - 147
  • [45] SMALL SHARED-MEMORY MULTIPROCESSORS
    BASKETT, F
    HENNESSY, JL
    SCIENCE, 1986, 231 (4741) : 963 - 967
  • [46] AND OR PARALLELISM ON SHARED-MEMORY MULTIPROCESSORS
    GUPTA, G
    JAYARAMAN, B
    JOURNAL OF LOGIC PROGRAMMING, 1993, 17 (01): : 59 - 89
  • [47] Boosting the performance of shared memory multiprocessors
    Chalmers Univ of Technology
    Computer, 7 (63-70):
  • [48] EFFICIENT SYNCHRONIZATION ON MULTIPROCESSORS WITH SHARED MEMORY
    KRUSKAL, CP
    RUDOLPH, L
    SNIR, M
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1988, 10 (04): : 579 - 601
  • [49] Boosting the performance of shared memory multiprocessors
    Stenstrom, P
    Brorsson, M
    Dahlgren, F
    Grahn, H
    Dubois, M
    COMPUTER, 1997, 30 (07) : 63 - +
  • [50] Design alternatives for shared memory multiprocessors
    Carter, J
    Kuo, CC
    Kuramkote, R
    Swanson, M
    FIFTH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 1998, : 41 - 50