• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Lü Fang, Cui Huimin, Huo Wei, Feng Xiaobing. Survey of Scheduling Policies for Co-Run Degradation[J]. Journal of Computer Research and Development, 2014, 51(1): 17-30.
Citation: Lü Fang, Cui Huimin, Huo Wei, Feng Xiaobing. Survey of Scheduling Policies for Co-Run Degradation[J]. Journal of Computer Research and Development, 2014, 51(1): 17-30.

Survey of Scheduling Policies for Co-Run Degradation

More Information
  • Published Date: January 14, 2014
  • With the fast swelling of industry applications, new platforms, such as clusters, datacenter and cloud computing, are becoming mainstream service environments. Meanwhile, high performance chip multiprocessor (CMP) systems begin to play a role on these commercial service platforms as major allocable resources. However, shared resources of CMP architectures would lead to severe co-run performance degradation on concurrent user applications. This problem, if left untouched, would lower the resource utility even users have less demands on the quality of services (QoS). Shared resources are attracting more and more concerns. Proper software scheduling policies keep being effective to the improvement of co-run performance. The paper summarizes the development of key techniques on CMP, variations of shared resources, which are followed with a detailed presentation and analysis for the representative schedulers. Limitations of the state-of-the-art scheduling policies, new challenges are then discussed and prospects for the research trends in the future are presented at the end of the paper.
  • Related Articles

    [1]Dou Xinglei, Liu Lei, Chen Yuetao. An Investigation into Quantum Program Mapping on Superconducting Quantum Computers[J]. Journal of Computer Research and Development, 2021, 58(9): 1856-1874. DOI: 10.7544/issn1000-1239.2021.20210314
    [2]Hu Zhiyao, Li Dongsheng, Li Ziyang. Recent Advances in Datacenter Flow Scheduling[J]. Journal of Computer Research and Development, 2018, 55(9): 1920-1930. DOI: 10.7544/issn1000-1239.2018.20180156
    [3]Peng Hao, Han Jianghong, Wei Zhenchun, Wei Xing. Fault Tolerant Global Scheduling with Backup Priority Promotion[J]. Journal of Computer Research and Development, 2016, 53(2): 354-361. DOI: 10.7544/issn1000-1239.2016.20148380
    [4]Liu Shengfei, Zhang Yunquan, Sun Xiangzheng. An Improved Guided Loop Scheduling Algorithm for OpenMP[J]. Journal of Computer Research and Development, 2010, 47(4): 687-694.
    [5]Wang Baojin, Li Mingshu. A Priority Mapping Algorithm Without Affecting the Schedulability of Tasks Set[J]. Journal of Computer Research and Development, 2006, 43(6): 1083-1089.
    [6]Wang Baojin, Li Mingshu, Wang Zhigang. The Priority Mapping Problem in Static Real-Time Middleware[J]. Journal of Computer Research and Development, 2006, 43(4): 722-728.
    [7]Liu Bo, Li Wei, Luo Junzhou, and Bian Zheng'ai. Semi-Online Scheduling Algorithm of Multi-Agent in Network Management[J]. Journal of Computer Research and Development, 2006, 43(4): 571-578.
    [8]Wen Yanzhi, Lian Ruiqi, Wu Chengyong, Feng Xiaobing, and Zhang Zhaoqing. A Micro-Scheduling Method on Directed Cyclic Graph[J]. Journal of Computer Research and Development, 2005, 42(3).
    [9]Li Qinghua, Han Jianjun, Abbas A. Essa. A Fast and Effective Static Task Scheduling Algorithm in Homogeneous Computing Environments[J]. Journal of Computer Research and Development, 2005, 42(1): 118-125.
    [10]Wang Qiang, Wang Hongan, Jin Hong, Fu Yong, and Dai Guozhong. A Concurrency Control Protocol for Scheduling Mixed Real-Time Transactions[J]. Journal of Computer Research and Development, 2005, 42(1): 18-29.

Catalog

    Article views (791) PDF downloads (622) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return