Emulation and Forecast of HPL Test Performance

Zhang Wenli, Chen Mingyu, and Fan Jianping

Journal of Computer Research and Development > 2006 > 43(3): 557-562.

Zhang Wenli, Chen Mingyu, and Fan Jianping. Emulation and Forecast of HPL Test Performance[J]. Journal of Computer Research and Development, 2006, 43(3): 557-562.

Citation:

Zhang Wenli, Chen Mingyu, and Fan Jianping. Emulation and Forecast of HPL Test Performance[J]. Journal of Computer Research and Development, 2006, 43(3): 557-562.

Citation:

Zhang Wenli, Chen Mingyu, and Fan Jianping. Emulation and Forecast of HPL Test Performance[J]. Journal of Computer Research and Development, 2006, 43(3): 557-562.

PDF (375 KB)

Emulation and Forecast of HPL Test Performance

Zhang Wenli, Chen Mingyu, and Fan Jianping

(Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080)

More Information

Published Date: March 14, 2006

Graphical Abstract

Abstract

Abstract

HPL is a Linpack benchmark package widely used in performance test of massively parallel systems. A law to determine block size NB theoretically, which breaks through the dependence on trial-and-error experiments, is found based on algorithm analysis and real test of HPL. According to that law, estimated execution time can be obtained through algorithm complexity. An emulation model is constructed to estimate the HPL execution time in more detail. Verified by real system test, the model is used to forecast the benefits of Linpack test brought by the intending system improvement. It is expected to afford reference to system improvement on optimizing HPL test in the future.
- high performance Linpack (HPL),
- linear algebra equations,
- LU factorization,
- MPI

FullText(HTML)

References (0)

[1]	Hu Yujing, Gao Yang, An Bo. Online Counterfactual Regret Minimization in Repeated Imperfect Information Extensive Games[J]. Journal of Computer Research and Development, 2014, 51(10): 2160-2170. DOI: 10.7544/issn1000-1239.2014.20130823
[2]	Tian Youliang, Peng Chenggen, Ma Jianfeng, Jiang Qi, Zhu Jianming. Game-Theoretic Mechanism for Cryptographic Protocol[J]. Journal of Computer Research and Development, 2014, 51(2): 344-352.
[3]	Zhu Guiming, Jin Shiyao, Guo Deke, Wei Hailiang. SOSC：A Self-Organizing Semantic Cluster Based P2P Query Routing Algorithm[J]. Journal of Computer Research and Development, 2011, 48(5): 736-745.
[4]	Cheng Bailiang, Zeng Guosun, Jie Anquan. Study of Multi-Agent Trust Coalition Based on Self-Organization Evolution[J]. Journal of Computer Research and Development, 2010, 47(8): 1382-1391.
[5]	Shi Chunqi, Shi Zhiping, Liu Xi, Shi Zhongzhi. Image Segmentation Based on Self-Organizing Dynamic Neural Network[J]. Journal of Computer Research and Development, 2009, 46(1): 23-30.
[6]	Luo Junhai and Fan Mingyu. Research on Trust Model Based on Game Theory in Mobile Ad-Hoc Networks[J]. Journal of Computer Research and Development, 2008, 45(10): 1704-1710.
[7]	Wang Wei and Zeng Guosun. Self-Organization Resource Topology Revolution Based on Trust Mechanism[J]. Journal of Computer Research and Development, 2007, 44(11): 1849-1856.
[8]	Huang Guanyao, Hong Peilin, and Li Jinsheng. P2P-VCG: A Game Theory Proposal for Bandwidth Allocation[J]. Journal of Computer Research and Development, 2007, 44(1): 78-84.
[9]	Tang Jiuyang, Zhang Weiming, Xiao Weidong, and Tang Daquan. Self-Organizing Peer-to-Peer Network Based on Community Mimicking Social Society[J]. Journal of Computer Research and Development, 2006, 43(8): 1383-1390.
[10]	Hou Yuexian, Ding Zheng, and He Pilian. Self-Organizing Isometric Embedding[J]. Journal of Computer Research and Development, 2005, 42(2): 188-195.