• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Chen Yongran, Dou Wenhua, Qian Yue, and Qi Xingyun. Research and Implementation of Parallel Program Profiler Based on System-Sampling[J]. Journal of Computer Research and Development, 2007, 44(10): 1694-1701.
Citation: Chen Yongran, Dou Wenhua, Qian Yue, and Qi Xingyun. Research and Implementation of Parallel Program Profiler Based on System-Sampling[J]. Journal of Computer Research and Development, 2007, 44(10): 1694-1701.

Research and Implementation of Parallel Program Profiler Based on System-Sampling

More Information
  • Published Date: October 14, 2007
  • Analyzing the performance of program is the basis of understanding the behaviors of programs. It is important to find the performance bottlenecks and learn the utilization of hardware and software resource. In the performance evaluation of parallel computing system, the performance characters of the application cannot be analyzed completely because of the restriction of the time and the space. An effective method is analyzing the performance characters of part of the application codes, and regarding them as the performance characters of the whole applications. In this paper, a method of analyzing the performance of the programs based on sampling is put forward. Furthermore, a profiler named SamplePro based on sample theory is developed. Compared with other methods under the condition of the same sample error, this technique can effectively reduce the needed instruction numbers, which means only 1%~3% instructions are used to achieve less than 3% analyzing error.
  • Related Articles

    [1]Zheng Wenping, Wu Zhikang, Yang Gui. A Novel Algorithm for Identifying Critical Nodes in Networks Based on Local Centrality[J]. Journal of Computer Research and Development, 2019, 56(9): 1872-1880. DOI: 10.7544/issn1000-1239.2019.20180831
    [2]Liu Haolin, Chi Jinlong, Deng Qingyong, Peng Xin, Pei Tingrui. Multi-Objective Evolutionary Sparse Recovery Approach Based on Adaptive Local Search[J]. Journal of Computer Research and Development, 2019, 56(7): 1420-1431. DOI: 10.7544/issn1000-1239.2019.20180557
    [3]Xu Zhengguo, Zheng Hui, He Liang, Yao Jiaqi. Self-Adaptive Clustering Based on Local Density by Descending Search[J]. Journal of Computer Research and Development, 2016, 53(8): 1719-1728. DOI: 10.7544/issn1000-1239.2016.20160136
    [4]Li Guilin, Yang Yuqi, Gao Xing, and Liao Minghong. Personalized Representation and Rank Algorithm for Enterprise Search Engines[J]. Journal of Computer Research and Development, 2014, 51(1): 206-214.
    [5]Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
    [6]Li Wenjun, Wang Jianxin, and Chen Jianer. An Improved Parameterized Algorithm for Hyperplane-Cover Problem[J]. Journal of Computer Research and Development, 2012, 49(4): 804-811.
    [7]Wang Chuyang, Li Xiaoping, Wang Qian, Yuan Yingchun. A New Local Search Algorithm for No-Wait Fowshops with Setup Time[J]. Journal of Computer Research and Development, 2010, 47(4): 653-662.
    [8]Zhang Peng. Approximation Algorithms for Generalized Multicut in Trees[J]. Journal of Computer Research and Development, 2008, 45(7): 1195-1202.
    [9]Zeng Liping and Huang Wenqi. A New Local Search Algorithm for the Job Shop Scheduling Problem[J]. Journal of Computer Research and Development, 2005, 42(4): 582-587.
    [10]Yang Jinji, Su Kaile. Improvement of Local Research in SAT Problem[J]. Journal of Computer Research and Development, 2005, 42(1): 60-65.

Catalog

    Article views (570) PDF downloads (423) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return