软件学报
軟件學報
연건학보
JOURNAL OF SOFTWARE
2013年
2期
343-357
,共15页
陈锐忠%齐德昱%林伟伟%李剑
陳銳忠%齊德昱%林偉偉%李劍
진예충%제덕욱%림위위%리검
非对称多核处理器%操作系统调度%负载表征%负载均衡%任务迁移
非對稱多覈處理器%操作繫統調度%負載錶徵%負載均衡%任務遷移
비대칭다핵처리기%조작계통조도%부재표정%부재균형%임무천이
asymmetric multi-core processor%operating system scheduling%workload characterization%load balancing%task migration
在非对称多核处理器上进行任务调度时,现有的操作系统调度器没有考虑其非对称性.针对单一指令集非对称多核处理器上的操作系统调度问题,首先建立线性规划模型,分析各种因素,得出行为匹配、减少迁移和负载均衡的调度原则.然后,基于调度原则提出一种综合性调度算法.该算法包括两个部分:1)集成负载表征,提出集成行为的概念,全面衡量任务的整体性和阶段性行为;2)基于集成行为的调度算法,有效开发非对称多核处理器的特性,能够保证各核心负载均衡,同时可以避免不必要的任务迁移.另外,该算法通过参数调整机制实现了算法的通用性.该算法是一种综合处理任务的整体性和阶段性行为,并具备通用性的调度算法.实际平台上的实验结果表明,该算法可通用于多种环境,且性能比其他对应算法提高6%~22%.
在非對稱多覈處理器上進行任務調度時,現有的操作繫統調度器沒有攷慮其非對稱性.針對單一指令集非對稱多覈處理器上的操作繫統調度問題,首先建立線性規劃模型,分析各種因素,得齣行為匹配、減少遷移和負載均衡的調度原則.然後,基于調度原則提齣一種綜閤性調度算法.該算法包括兩箇部分:1)集成負載錶徵,提齣集成行為的概唸,全麵衡量任務的整體性和階段性行為;2)基于集成行為的調度算法,有效開髮非對稱多覈處理器的特性,能夠保證各覈心負載均衡,同時可以避免不必要的任務遷移.另外,該算法通過參數調整機製實現瞭算法的通用性.該算法是一種綜閤處理任務的整體性和階段性行為,併具備通用性的調度算法.實際平檯上的實驗結果錶明,該算法可通用于多種環境,且性能比其他對應算法提高6%~22%.
재비대칭다핵처리기상진행임무조도시,현유적조작계통조도기몰유고필기비대칭성.침대단일지령집비대칭다핵처리기상적조작계통조도문제,수선건립선성규화모형,분석각충인소,득출행위필배、감소천이화부재균형적조도원칙.연후,기우조도원칙제출일충종합성조도산법.해산법포괄량개부분:1)집성부재표정,제출집성행위적개념,전면형량임무적정체성화계단성행위;2)기우집성행위적조도산법,유효개발비대칭다핵처리기적특성,능구보증각핵심부재균형,동시가이피면불필요적임무천이.령외,해산법통과삼수조정궤제실현료산법적통용성.해산법시일충종합처리임무적정체성화계단성행위,병구비통용성적조도산법.실제평태상적실험결과표명,해산법가통용우다충배경,차성능비기타대응산법제고6%~22%.
This research focuses on the problem of operating system (OS) scheduling on asymmetric multi-core processors (AMP). A task scheduling model based on linear programming is proposed. Several attributes of AMP factors are taken into account in this model. Scheduling principles of behavior matching, migration avoiding, and load balancing are adhered as well. A comprehensive scheduling algorithm is also proposed based on the model. The algorithm has two parts: an integrated workload characterization, which proposes integrated behavior to measure the global and local behaviors of tasks comprehensively, and an integrated behavior- based scheduling algorithm, which efficiently utilizes the asymmetric multi-core processors without frequent task migration. This guarantees the load balance between cores. In addition, the algorithm achieves universality with a flexible parameter adjustment mechanism. It is an algorithm to achieve universality as well as the first to handle the global and local behaviors of tasks comprehensively. The evaluation on real platform demonstrates that the algorithm is universal for different conditions, and it always outperforms other scheduling algorithms on asymmetric multi-core processors (by 6%~22%).