Parallel Shared-Memory Simulator Performance for Large ATM Networks

被引:5
|
作者
Unger, Brian [1 ]
Xiao, Zhonge [1 ]
Cleary, John [2 ]
Tsai, Jya-Jang [2 ]
Williamson, Carey [3 ]
机构
[1] Department of Computer Science, University of Calgary, Calgary, T2N 1N4, Canada
[2] University of Waikato, Waikato, New Zealand
[3] University of Saskatchewan, Saskatchewan, Canada
关键词
Benchmarking - Computer architecture - Computer networks - Computer simulation - Network protocols - Parallel processing systems - Synchronization;
D O I
10.1145/369534.369537
中图分类号
学科分类号
摘要
A performance comparison between an optimistic and a conservative parallel simulation kernel is presented. Performance of the parallel kernels is also compared to a central-event-list sequential kernel. A spectrum of ATM network and traffic scenarios representative of those used by ATM networking researchers are used for the comparison. Experiments are conducted with a cell-level ATM network simulator and an 18-processor SGI Power Challenge shared-memory multiprocessor. The results show the performance advantages of parallel simulation over sequential simulation for ATM networks. Speedups of 4-5 relative to a fast sequential kernel are achieved on 16 processors for several large irregular ATM benchmark scenarios and the optimistic kernel achieves 2 to 5 times speedup on all 7 benchmarks. However, the relative performance of the two parallel simulation kernels is dependent on the size of the ATM network, the number of traffic sources, and the traffic source types used in the simulation. For some benchmarks the best single point performance is provided by the conservative kernel even on a single processor. Unfortunately, the conservative kernel performance is susceptible to small changes in the modeling code and is outperformed by the optimistic kernel on 5 of the 7 benchmarks. The optimistic parallel simulation kernel thus provides more robust performance, but its speedup is limited by the overheads of its implementation, which make it approximately half the speed of the sequential kernel on one processor. These performance results represent the first comparative analysis of parallel simulation for a spectrum of realistic, irregular, low-granularity, communication network models.
引用
收藏
页码:358 / 391
相关论文
共 50 条
  • [21] Distributed, Shared-Memory Parallel Triangle Counting
    Kanewala, Thejaka Amila
    Zalewski, Marcin
    Lumsdaine, Andrew
    PROCEEDINGS OF THE PLATFORM FOR ADVANCED SCIENTIFIC COMPUTING CONFERENCE (PASC '18), 2017,
  • [22] PARALLEL CHOLESKY FACTORIZATION ON A SHARED-MEMORY MULTIPROCESSOR
    GEORGE, A
    HEATH, MT
    LIU, J
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1986, 77 : 165 - 187
  • [23] Shared-Memory Parallel Maximal Clique Enumeration
    Das, Apurba
    Sanei-Mehri, Seyed-Vahid
    Tirthapura, Srikanta
    2018 IEEE 25TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING (HIPC), 2018, : 62 - 71
  • [24] A PARALLEL LINKED LIST FOR SHARED-MEMORY MULTIPROCESSORS
    TANG, PY
    YEW, PC
    ZHU, CQ
    PROCEEDINGS : THE THIRTEENTH ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE, 1989, : 130 - 135
  • [25] Correctness properties in a shared-memory parallel language
    Caplain, G
    JOURNAL OF THE ACM, 2002, 49 (06) : 785 - 827
  • [26] Parallel VLSI test in a shared-memory multiprocessor
    Gil, C
    Ortega, J
    Montoya, MG
    CONCURRENCY-PRACTICE AND EXPERIENCE, 2000, 12 (05): : 311 - 326
  • [27] A MODEL FOR ASYNCHRONOUS SHARED-MEMORY PARALLEL COMPUTATION
    NISHIMURA, N
    SIAM JOURNAL ON COMPUTING, 1994, 23 (06) : 1231 - 1252
  • [28] Truss Decomposition on Shared-Memory Parallel Systems
    Smith, Shaden
    Liu, Xing
    Ahmed, Nesreen K.
    Tom, Ancy Sarah
    Petrini, Fabrizio
    Karypis, George
    2017 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2017,
  • [29] SHARED-MEMORY PARALLEL PROGRAMMING IN C++
    BECK, B
    IEEE SOFTWARE, 1990, 7 (04) : 38 - 48
  • [30] MEMORY REFERENCING CHARACTERISTICS AND CACHING PERFORMANCE OF AND-PARALLEL PROLOG ON SHARED-MEMORY MULTIPROCESSORS
    HERMENEGILDO, M
    TICK, E
    NEW GENERATION COMPUTING, 1989, 7 (01) : 37 - 58