Maximizing speedup through performance prediction for Distributed Shared Memory systems

被引:0
|
作者
Zhuang, YC [1 ]
Shieh, CK [1 ]
Liang, TY [1 ]
Chou, CH [1 ]
机构
[1] Natl Cheng Kung Univ, Dept Elect Engn, Tainan 70101, Taiwan
关键词
D O I
10.1109/ICDSC.2001.919009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Parallel applications executing on large system size of parallel systems achieve better speedup than on small system size. However, because of the design and implementation of the Distributed Shared Memory (DSM) system, there are some instances that large system size has no further performance improvement over small system size. It is important to determine what system size will result in the maximum speedup while all kinds of applications are running on DSM systems. In this paper rte describe rite design and implementation of we performance prediction mechanism ill our DSM system, Proteus [13], which supports node reconfiguration to adjust system size at runtime. We adopt a simple computation model and combine it with runtime information to predict the performance under different system sizes. With this work, it is possible to provide timely prediction result for the underlying system to adjust system size and thus maximize speedup.
引用
收藏
页码:723 / 726
页数:4
相关论文
共 50 条
  • [41] Performance of multistage bus networks for a distributed shared memory multiprocessor
    Bhuyan, LN
    Iyer, RR
    Nanda, AK
    Kumar, M
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (01) : 82 - 95
  • [42] SoftFLASH: Analyzing the Performance of Clustered Distributed Virtual Shared Memory
    Erlichson, A.
    Nuckolls, N.
    Chesson, G.
    Hennessy, J.
    Computer Architecture News, 24
  • [43] SoftFLASH: Analyzing the performance of clustered distributed virtual shared memory
    Erlichson, A
    Nuckolls, N
    Chesson, G
    Hennessy, J
    ACM SIGPLAN NOTICES, 1996, 31 (09) : 210 - 220
  • [44] SoftFLASH: analyzing the performance of clustered distributed virtual shared memory
    Stanford Univ, Stanford, United States
    Comput Archit News, Special Issu (210-220):
  • [45] An efficient logging scheme for recoverable distributed shared memory systems
    Park, T
    Cho, S
    Yeom, HY
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 1997, : 305 - 313
  • [46] An Asymmetric Distributed Shared Memory Model for Heterogeneous Parallel Systems
    Gelado, Isaac
    Cabezas, Javier
    Navarro, Nacho
    Stone, John E.
    Patel, Sanjay
    Hwu, Wen-mei W.
    ASPLOS XV: FIFTEENTH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS, 2010, : 347 - 358
  • [47] TRANSACTION SYNCHRONIZATION IN DISTRIBUTED SHARED VIRTUAL MEMORY-SYSTEMS
    HSU, MC
    TAM, VO
    PROCEEDINGS : THE THIRTEENTH ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE, 1989, : 166 - 175
  • [48] Fundamentals for consistent event ordering in distributed shared memory systems
    Preissinger, J
    Landes, T
    PDPTA '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3, 2005, : 890 - 896
  • [49] 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
  • [50] Performance of multistage bus networks for a distributed shared memory multiprocessor
    Texas A&M Univ, College Station, United States
    IEEE Trans Parallel Distrib Syst, 1 (82-95):