摘要： 针对Linux 任务调度算法在多核系统中交互性能差的问题,提出一种分组任务调度算法GFS。根据多核系统硬件特性,自动配置物理距离近的一组CPU 共享一个任务运行队列,通过平衡组内CPU 对任务运行队列的访问竞争与任务迁移的代价,实现组间任务运行队列的负载均衡,减少调度延迟。通过优先调度唤醒任务,加快多核系统中交互任务的响应速度。测试结果表明,在不同任务负载下,GFS 能够明显降低交互任务的平均响应时间,从而有效提高多核系统交互应用的调度性能。
关键词:
多核系统,
调度算法,
交互性能,
自动配置,
唤醒任务,
载均衡
Abstract: To improve interactive performance of Linux in multi-core systems,this paper designs and implements an
improved task scheduling algorithm named Group Fair Schedule (GFS). According to the hardware characteristics of multi-core system, GFS allows to configure a group of CPUs with close affinity to share one task run queue
automatically,so that the cost of competitive access,task migration inside a group and run queue load balance between groups can be weighed, and reduces scheduling delay. GFS gives priority to awakening tasks so that interactive performance of multi-core systems is improved. Test results show that GFS decreases the average response time of interactive tasks under different background loads, and improves interactive performance of multi-core systems effectively.
Key words:
multi-core system,
scheduling algorithm,
interactive performance,
automotive configuration,
awakening
task,
load balance
中图分类号:
曹越,顾乃杰,任开新,张旭,吴志强. 一种面向多核系统的Linux 任务调度算法[J]. 计算机工程, doi: 10.3969/j.issn.1000-3428.2015.02.008.
CAO Yue,GU Naijie,REN Kaixin,ZHANG Xu,WU Zhiqiang. A Linux Task Scheduling Algorithm for Multi-core System[J]. Computer Engineering, doi: 10.3969/j.issn.1000-3428.2015.02.008.