DocumentCode
2657316
Title
Study and realization of process scheduling policy facing user
Author
Chen, Yuan ; Li, Liang
Author_Institution
Dept. of Comput. Sci., Chongqing Univ. of Technol., Chongqing, China
Volume
3
fYear
2010
fDate
16-18 April 2010
Abstract
Aiming at the problem of Linux process scheduling policy just regards the system capability and neglects user service, the paper presents a kind of process scheduling policy facing to user according to the discrepancy of process quantity every user owned, which invokes Linux dynamic priority scheduling policy, fair share scheduling policy and self-adapting fair share scheduling policy in order to meet the every user´s need in whole system to most degree and realize the fair principle of process scheduling. In the realization process, the author settles the problem of decision-making account and introduces the dynamic right adjusting mechanism to realize self-adapting fair share arithmetic. The experiment result indicates that the process scheduling policy is effective and valuable applying on the time-sharing system which regards user´s contentment degree.
Keywords
Linux; decision making; scheduling; Linux dynamic priority scheduling policy; decision-making; dynamic right adjusting mechanism; process scheduling policy; self-adapting fair share arithmetic; self-adapting fair share scheduling policy; time-sharing system; Application software; Arithmetic; Computer science; Decision making; Degradation; Dynamic scheduling; Linux; Paper technology; Processor scheduling; Time sharing computer systems; Linux; facing user; process scheduling policy; self-adapting fair share;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Engineering and Technology (ICCET), 2010 2nd International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-6347-3
Type
conf
DOI
10.1109/ICCET.2010.5485835
Filename
5485835
Link To Document