• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
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.
Citation: 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.

A Priority Mapping Algorithm Without Affecting the Schedulability of Tasks Set

More Information
  • Published Date: June 14, 2006
  • In practice, the schedulability of static priority scheduling may be reduced if priority levels of the system are insufficient. When the priority levels that a task set requires are more than the system can support, more than one task must be assigned the same priority. The priority mapping algorithms that have been used can augment the worst-case response time of task with higher priority, and may reduce the system schedulability. If keeping system schedulable, these algorithms may require more priority levels than the system can support. With preemption threshold scheduling model, the schedulability is improved as compared to both preemption and non-preemption scheduling models, and all tasks can be handled with the minimum number of event handling threads. But, the number of system priority levels that a thread needs does not be reduced. This paper presents a priority mapping algorithm called TSM (threshold segment mapping) and a thread implementation architecture with event-driven. It is shown that the TSM algorithm can maintain the strict order of tasks' priorities, and does not improve task's worst-case response time. The number of system priority levels used by the algorithm and architecture equals to that of threads. Simulations show that when maintaining system schedulability, the TSM algorithm uses less priority levels than existing priority mapping algorithms.
  • Related Articles

    [1]Li Xiaoping, Zhou Zhixing, Chen Long, Zhu Jie. Task Offloading and Cooperative Scheduling for Heterogeneous Edge Resources[J]. Journal of Computer Research and Development, 2023, 60(6): 1296-1307. DOI: 10.7544/issn1000-1239.202110936
    [2]Tang Xuhao, Liu Fagui, Wang Bin, Li Chao, Jiang Jun, Tang Quan, Chen Weiming, He Fengwen. Survey on Task Scheduling in Inter-Cloud Environment[J]. Journal of Computer Research and Development, 2023, 60(6): 1262-1275. DOI: 10.7544/issn1000-1239.202220021
    [3]Wang Yawen, Guo Yunfei, Liu Wenyan, Hu Hongchao, Huo Shumin, Cheng Guozhen. A Task Scheduling Method for Cloud Workflow Security[J]. Journal of Computer Research and Development, 2018, 55(6): 1180-1189. DOI: 10.7544/issn1000-1239.2018.20170425
    [4]Hu Haiyang, Liu Runhua, Hu Hua. Multi-Objective Optimization for Task Scheduling in Mobile Cloud Computing[J]. Journal of Computer Research and Development, 2017, 54(9): 1909-1919. DOI: 10.7544/issn1000-1239.2017.20160757
    [5]Li Xuejun, Xu Jia, Zhu Erzhou, Zhang Yiwen. A Novel Computation Method for Adaptive Inertia Weight of Task Scheduling Algorithm[J]. Journal of Computer Research and Development, 2016, 53(9): 1990-1999. DOI: 10.7544/issn1000-1239.2016.20151175
    [6]Wang Qiang, Li Xiongfei, Wang Jing. A Data Placement and Task Scheduling Algorithm in Cloud Computing[J]. Journal of Computer Research and Development, 2014, 51(11): 2416-2426. DOI: 10.7544/issn1000-1239.2014.20130749
    [7]Yu Guoliang, Wu Weiguo, Yang Zhihua, Qian Depei. A Boundary-Table-Based Algorithm for Reconfigurable Resource Management and Hardware Task Scheduling[J]. Journal of Computer Research and Development, 2011, 48(4): 699-708.
    [8]Wu Lei and Du Zhihui. A Dynamic Knowledge-Based Task Scheduling Algorithm in Simulation Grid Environment[J]. Journal of Computer Research and Development, 2008, 45(2): 261-268.
    [9]Chen Tingwei, Zhang Bin, and Hao Xianwen. Dependent Task Scheduling in Grid Based on T-RAG Optimization Selection[J]. Journal of Computer Research and Development, 2007, 44(10): 1741-1750.
    [10]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.

Catalog

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

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return