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 条
  • [41] ATM switch with shared-memory input buffer and expansive ports
    Huazhong Ligong Daxue Xuebao/Journal Huazhong (Central China) University of Science and Technology, 1996, 24 (07):
  • [42] Performance analysis tools for parallel Java']Java applications on shared-memory systems
    Guitart, J
    Torres, J
    Ayguadé, E
    Bull, JM
    PROCEEDINGS OF THE 2001 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 2001, : 357 - 364
  • [43] MulticoreBSP for C: A High-Performance Library for Shared-Memory Parallel Programming
    A. N. Yzelman
    R. H. Bisseling
    D. Roose
    K. Meerbergen
    International Journal of Parallel Programming, 2014, 42 : 619 - 642
  • [44] MulticoreBSP for C: A High-Performance Library for Shared-Memory Parallel Programming
    Yzelman, A. N.
    Bisseling, R. H.
    Roose, D.
    Meerbergen, K.
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2014, 42 (04) : 619 - 642
  • [45] A Methodology Approach to Compare Performance of Parallel Programming Models for Shared-Memory Architectures
    Utrera, Gladys
    Gil, Marisa
    Martorell, Xavier
    NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS, PT I, 2020, 11973 : 318 - 325
  • [46] Parallel Shared-Memory Workloads Performance on Asymmetric Multi-core Architectures
    Madruga, Felipe L.
    Freitas, Henrique C.
    Navaux, Philippe O. A.
    PROCEEDINGS OF THE 18TH EUROMICRO CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, 2010, : 163 - 169
  • [47] Parallel-vector algorithm for optimization of large steel structures on a shared-memory machine
    Soegiarso, R.
    Adeli, Hojjat
    Computer-Aided Civil and Infrastructure Engineering, 1998, 13 (03): : 207 - 217
  • [48] BASIC PARALLEL ALGORITHMIC TECHNIQUES FOR SHARED-MEMORY MACHINES
    ALBACEA, EA
    AUSTRALIAN COMPUTER JOURNAL, 1995, 27 (02): : 51 - 61
  • [49] Adaptive Space-Shared Scheduling for Shared-Memory Parallel Programs
    Cho, Younghyun
    Oh, Surim
    Egger, Bernhard
    JOB SCHEDULING STRATEGIES FOR PARALLEL PROCESSING, JSSPP 2016, 2017, 10353 : 158 - 177
  • [50] Efficient shared-memory support for parallel graph reduction
    Bennett, AJ
    Kelly, PHJ
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 1997, 12 (06): : 481 - 503