A study of the efficiency of shared attraction memories in cluster-based COMA multiprocessors

被引:0
|
作者
Landin, A
Karlgren, M
机构
来源
11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, PROCEEDINGS | 1997年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The performance of a COMA multiprocessor greatly depends on the efficiency of the large node caches, the attraction memories. When more than one processor share an attraction memory its behavior is changed. From experiments with program-driven simulation we have found that clustering may improve the performance of the attraction memory significantly. Traffic is reduced, and the miss rates are lower for shared attraction memories. However clustering may introduce contention for the attraction memory that may ruin any potential performance gain from increased attraction memory hit rate. Provided enough local bandwidth, application execution can remain efficient at higher memory pressure in clustered systems than in systems with single processor nodes. Ar very high memory pressure some applications change behavior and start suffering from clustering. This is caused by conflict misses due to the relatively lower associativity of the shared attraction memory.
引用
收藏
页码:1 / 7
页数:7
相关论文
共 50 条
  • [1] PERFORMANCE ANALYSIS OF CLUSTER-BASED MULTIPROCESSORS
    MOHAPATRA, P
    DAS, CR
    FENG, TY
    IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (01) : 109 - 114
  • [2] Memory conscious scheduling for cluster-based NUMA multiprocessors
    Koita, T
    Katayama, T
    Saisho, K
    Fukuda, A
    JOURNAL OF SUPERCOMPUTING, 2000, 16 (03): : 217 - 235
  • [3] Memory Conscious Scheduling for Cluster-based NUMA Multiprocessors
    Takahiro Koita
    Tetsuro Katayama
    Keizo Saisho
    Akira Fukuda
    The Journal of Supercomputing, 2000, 16 : 217 - 235
  • [4] Processor scheduling with page placement for cluster-based NUMA multiprocessors
    Koita, T
    Katayama, T
    Saisho, K
    Fukuda, A
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, 1998, : 851 - 858
  • [5] Update protocols and cluster-based shared memory
    Keleher, PJ
    COMPUTER COMMUNICATIONS, 1999, 22 (11) : 1045 - 1055
  • [6] Bus-based COMA - Reducing traffic in shared-bus multiprocessors
    Landin, A
    Dahlgren, F
    SECOND INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE, PROCEEDINGS, 1996, : 95 - 105
  • [7] IMPACT OF NETWORK FAILURES ON THE PERFORMANCE DEGRADATION OF A CLASS OF CLUSTER-BASED MULTIPROCESSORS
    KUMAR, A
    AGRAWAL, DP
    MAHGOUB, IO
    GREEN, CR
    IEEE TRANSACTIONS ON RELIABILITY, 1991, 40 (01) : 39 - 44
  • [8] CLUSTER-BASED ASSOCIATIVE MEMORIES BUILT FROM UNRELIABLE STORAGE
    Leduc-Primeau, Francois
    Gripon, Vincent
    Rabbat, Michael G.
    Gross, Warren J.
    2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2014,
  • [9] Cluster-Based Vehicle-to-Everything Model with a Shared Cache
    Vladyko, Andrei
    Tambovtsev, Gleb
    Podgornaya, Elena
    Chelloug, Samia Allaoua
    Alkanhel, Reem
    Plotnikov, Pavel
    MATHEMATICS, 2023, 11 (13)
  • [10] Efficiency and effectiveness of query processing in cluster-based retrieval
    Can, F
    Altingövde, IS
    Demir, E
    INFORMATION SYSTEMS, 2004, 29 (08) : 697 - 717