• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Zheng Ninghan, Gu Zhimin, Sun Xianhe. Performance Improvement for Irregular Data Intensive Hot-Slice with Low Computing Workload[J]. Journal of Computer Research and Development, 2013, 50(11): 2436-2443.
Citation: Zheng Ninghan, Gu Zhimin, Sun Xianhe. Performance Improvement for Irregular Data Intensive Hot-Slice with Low Computing Workload[J]. Journal of Computer Research and Development, 2013, 50(11): 2436-2443.

Performance Improvement for Irregular Data Intensive Hot-Slice with Low Computing Workload

More Information
  • Published Date: November 14, 2013
  • With the rising and development of cloud computing, more and more irregular data intensive applications based on chip multi-core processors (CMP) appear, their application performances are badly affected by data cache misses. Traditional methods based on helper thread running in idle cores try to push irregular data into the shared last layer cache (LLC) in advance, which will be soon used by a computing core. If the helper thread runs faster than the main thread, the helper thread can push hot-data into LLC before the main thread uses them, thus the performance of hot slice may be improved. But for the hot-slice with low computing workload, it is impossible to build a helper thread running faster than the main thread by traditional method. This paper is aimed at the performance optimization of irregular data intensive hot-slice with low computing workload. First, the formalization description of the prefetch QoS of the helper thread is given, and then a new performance optimization method is proposed. The new method is implemented in real commercial processors without involving additional hardware modifications. Measurement results show that the performance of science computing benchmark em3d, mst and SPEC CPU2006 mcf gets the increases of 1.97%, 31.63% and 1.10% respectively compared with the traditional method in Intel Core 2 Duo Processor 6550.
  • Related Articles

    [1]Hu Jun, Chen Yan, Zhang Qinghua, Wang Guoyin. Optimal Scale Selection for Generalized Multi-Scale Set-Valued Decision Systems[J]. Journal of Computer Research and Development, 2022, 59(9): 2027-2038. DOI: 10.7544/issn1000-1239.20210196
    [2]Wang Nian, Peng Zhenghong, Cui Li. EasiFFRA: A Fast Feature Reduction Algorithm Based on Neighborhood Rough Set[J]. Journal of Computer Research and Development, 2019, 56(12): 2578-2588. DOI: 10.7544/issn1000-1239.2019.20180541
    [3]Xie Qin, Zhang Qinghua, Wang Guoyin. An Adaptive Three-way Spam Filter with Similarity Measure[J]. Journal of Computer Research and Development, 2019, 56(11): 2410-2423. DOI: 10.7544/issn1000-1239.2019.20180793
    [4]Wu Weizhi, Yang Li, Tan Anhui, Xu Youhong. Granularity Selections in Generalized Incomplete Multi-Granular Labeled Decision Systems[J]. Journal of Computer Research and Development, 2018, 55(6): 1263-1272. DOI: 10.7544/issn1000-1239.2018.20170233
    [5]Yao Sheng, Xu Feng, Zhao Peng, Ji Xia. Intuitionistic Fuzzy Entropy Feature Selection Algorithm Based on Adaptive Neighborhood Space Rough Set Model[J]. Journal of Computer Research and Development, 2018, 55(4): 802-814. DOI: 10.7544/issn1000-1239.2018.20160919
    [6]Fu Zhiyao, Gao Ling, Sun Qian, Li Yang, Gao Ni. Evaluation of Vulnerability Severity Based on Rough Sets and Attributes Reduction[J]. Journal of Computer Research and Development, 2016, 53(5): 1009-1017. DOI: 10.7544/issn1000-1239.2016.20150065
    [7]Duan Jie, Hu Qinghua, Zhang Lingjun, Qian Yuhua, Li Deyu. Feature Selection for Multi-Label Classification Based on Neighborhood Rough Sets[J]. Journal of Computer Research and Development, 2015, 52(1): 56-65. DOI: 10.7544/issn1000-1239.2015.20140544
    [8]Hu Xiaojian, Yang Shanlin, Hu Xiaoxuan, Fang Fang. Optimal Decomposition of Decision Table Systems Based on Bayesian Networks[J]. Journal of Computer Research and Development, 2007, 44(4): 667-673.
    [9]Wei Lai, Miao Duoqian, Xu Feifei, and Xia Fuchun. Research on a Covering Rough Fuzzy Set Model[J]. Journal of Computer Research and Development, 2006, 43(10): 1719-1723.
    [10]Yi Gaoxiang and Hu Heping. A Web Search Result Clustering Based on Tolerance Rough Set[J]. Journal of Computer Research and Development, 2006, 43(2): 275-280.

Catalog

    Article views (872) PDF downloads (517) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return