Predicting the performance of reconfigurable optical interconnects in distributed shared-memory systems

被引:0
|
作者
Wim Heirman
Joni Dambre
Iñigo Artundo
Christof Debaes
Hugo Thienpont
Dirk Stroobandt
Jan Van Campenhout
机构
[1] Ghent University,ELIS Department
[2] Free University of Brussels,TONA Department
来源
Photonic Network Communications | 2008年 / 15卷
关键词
Prediction; Reconfiguration; Interconnect; Shared-memory;
D O I
暂无
中图分类号
学科分类号
摘要
New advances in reconfigurable optical interconnect technologies will allow the fabrication of low-cost, fast and run-time adaptable networks for connecting processors and memory modules in large distributed shared-memory multiprocessor machines. Since the switching times of these components are typically high compared to the memory access time, reconfiguration exploits low frequency dynamics in the network traffic patterns. These are however not easily reproduced using statistical traffic generation, a tool commonly used when doing a fast design space exploration. In this paper, we present a technique that can predict network performance, based on the traffic patterns obtained from simulating the execution of real benchmark applications, but without the need to perform these slow full-system simulations for every parameter set of interest. This again allows for a quick comparison of different network implementations with good relative accuracy, narrowing down the design space for more detailed examination.
引用
收藏
页码:25 / 40
页数:15
相关论文
共 32 条
  • [21] Performance analysis and hardware implementation of a nearly optimal buffer management scheme for high-performance shared-memory switches
    Zheng, Ling
    Pan, Weitao
    Li, Yinghua
    Gao, Ya
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2020, 33 (08)
  • [22] Relationships between broadcast and shared memory in reliable anonymous distributed systems
    James Aspnes
    Faith Ellen Fich
    Eric Ruppert
    Distributed Computing, 2006, 18 : 209 - 219
  • [23] Relationships between broadcast and shared memory in reliable anonymous distributed systems
    Aspnes, J
    Fich, F
    Ruppert, E
    DISTRIBUTED COMPUTING, 2006, 18 (03) : 209 - 219
  • [24] Towards A Portable Hierarchical View of Distributed Shared Memory Systems: Challenges and Solutions
    Ghane, Millad
    Chandrasekaran, Sunita
    Cheung, Margaret S.
    PROCEEDINGS OF THE ELEVENTH INTERNATIONAL WORKSHOP ON PROGRAMMING MODELS AND APPLICATIONS FOR MULTICORES AND MANYCORES, PMAM 2020, 2020, : 41 - 50
  • [25] A Performance Evaluation of Distributed Algorithms on Shared Memory and Message Passing Middleware Platforms
    Ahuja, Sanjay P.
    Eggen, Roger
    Jha, Anjani K.
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2005, 29 (03): : 327 - 333
  • [26] SPRIGHT: High-Performance eBPF-Based Event-Driven, Shared-Memory Processing for Serverless Computing
    Qi, Shixiong
    Monis, Leslie
    Zeng, Ziteng
    Wang, Ian-Chin
    Ramakrishnan, K. K.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2024, 32 (03) : 2539 - 2554
  • [27] Design issues for a high-performance distributed shared memory on symmetrical multiprocessor clusters
    Sumit Roy
    Vipin Chaudhary
    Cluster Computing, 1999, 2 (3) : 177 - 186
  • [28] Parallelizing with BDSC, a resource-constrained scheduling algorithm for shared and distributed memory systems
    Khaldi, Dounia
    Jouvelot, Pierre
    Ancourt, Corinne
    PARALLEL COMPUTING, 2015, 41 : 66 - 89
  • [29] Real-Time Performance Analysis of Multiprocessor Systems with Shared Memory
    Schliecker, Simon
    Ernst, Rolf
    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2010, 10 (02)
  • [30] COMPARATIVE PERFORMANCE EVALUATION OF HOT-SPOT CONTENTION BETWEEN MIN-BASED AND RING-BASED SHARED-MEMORY ARCHITECTURES
    ZHANG, XD
    YAN, Y
    CASTANEDA, R
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1995, 6 (08) : 872 - 886