Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


ohiou1300244698.pdf (424.26 KB)

ETD Abstract Container

Abstract Header

Scheduling Time-Sensitive Tasks using a Combination of Proportional-Share and Priority Scheduling Algorithms

Jovanovska, Delfina
http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1300244698

Abstract Details

2011, Master of Science (MS), Ohio University, Computer Science (Engineering and Technology).
An operating system supports different types of applications while providing flexible and efficient resource allocation. Scheduling time sensitive tasks requires satisfying constrains in meeting deadlines and quality of service guarantee. In this thesis a new approach of scheduling time sensitive applications by combining proportional share and priority share scheduling algorithms is proposed. This approach combines the features of fairness of proportional share algorithms and reservations guarantee that priority algorithms provide. The Earliest Eligible Virtual Deadline First (EEVDF) was used as an underlying algorithm because it provides theoretical bounds on the allocation deviation (lag). The basic idea is adding priority to the time sensitive tasks by injecting artificial positive lag in proportional share scheduling algorithm, so that tasks arriving with positive lag will have priority over the others. For the purpose of the thesis an implementation of scheduler simulation using EEVDF algorithm was provided. A priority lag handling strategy while maintaining the essential properties of EEVDF was introduced. Analysis of the impact of this strategy was provided as well as design guidelines for setting properties in a real system and a pseudo code for real system implementations with time complexity of O(nlogn).
Frank Drews, PhD (Advisor)
Shawn Ostermann, PhD (Committee Member)
Jundong Liu, PhD (Committee Member)
Hans Kruse, PhD (Committee Member)
80 p.
Computer Science
scheduling; priority; proportional-share; time-sensitive; tasks; combination; EEVDF; algorithm; lag; positive lag;

Recommended Citations

Citations

  • Jovanovska, D. (2011). Scheduling Time-Sensitive Tasks using a Combination of Proportional-Share and Priority Scheduling Algorithms [Master's thesis, Ohio University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1300244698

    APA Style (7th edition)

  • Jovanovska, Delfina. Scheduling Time-Sensitive Tasks using a Combination of Proportional-Share and Priority Scheduling Algorithms. 2011. Ohio University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1300244698.

    MLA Style (8th edition)

  • Jovanovska, Delfina. "Scheduling Time-Sensitive Tasks using a Combination of Proportional-Share and Priority Scheduling Algorithms." Master's thesis, Ohio University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1300244698

    Chicago Manual of Style (17th edition)

ohiou1300244698
1,913
© 2011, all rights reserved.
This open access ETD is published by Ohio University and OhioLINK.