Setting Priority Points for Global EDF-like Scheduling of Sporadic Tasks with Arbitrary Deadlines on Multiprocessors

Simple item page
dc.contributor.advisorYang, Kecheng
dc.contributor.authorLiang, Tian
dc.contributor.committeeMemberChen, Xiao
dc.contributor.committeeMemberGao, Byron
dc.date.accessioned2021-04-30T17:12:29Z
dc.date.available2021-04-30T17:12:29Z
dc.date.issued2021-05
dc.description.abstractUnder the well-studied global earliest-deadline-first (G-EDF) scheduling, the deadline of each job serves for two functionalities simultaneously. First, it specifies the response-time requirement of the job; second, it determines the priority of the job. The concept of the family of G-EDF-like (GEL) schedulers extends G-EDF by separating these two functionalities: the deadline of a job only serves as the first one, and another parameter, called the priority point of a job, serves as the second one. This thesis studies the problem of GEL scheduling arbitrary-deadline sporadic tasks on multiprocessor platforms where every processor is identical. In particular, the focus is on the priority point setting and schedulability analysis under both preemptive and non-preemptive global earliest-priority-point-first (G-EPPF) scheduling. This work shows that the response times under G-EPPF scheduling can be upper bounded by the relative priority points as well as specification parameters of the tasks and the platform. Thus, the problem of setting proper priority points can be formalized as a linear program (LP), which can be solved efficiently by readily available LP solvers. The schedulability experiments demonstrate the effectiveness of the proposed method and its merits over the state-of-art for the schedulability analysis of arbitrary-deadline tasks.
dc.description.departmentComputer Science
dc.formatText
dc.format.extent66 pages
dc.format.medium1 file (.pdf)
dc.identifier.citationLiang, T. (2021). <i>Setting priority points for global EDF-like scheduling of sporadic tasks with arbitrary deadlines on multiprocessors</i> (Unpublished thesis). Texas State University, San Marcos, Texas.
dc.identifier.urihttps://hdl.handle.net/10877/13466
dc.language.isoen
dc.subjectPriority point
dc.subjectGlobal EDF-like scheduling
dc.subjectSporadic task
dc.subjectArbitrary deadline
dc.subjectMultiprocessor
dc.subjectResponse-time bound
dc.subject.lcshComputer science
dc.subject.lcshSoftware engineering
dc.titleSetting Priority Points for Global EDF-like Scheduling of Sporadic Tasks with Arbitrary Deadlines on Multiprocessors
dc.typeThesis
thesis.degree.departmentComputer Science
thesis.degree.disciplineComputer Science
thesis.degree.grantorTexas State University
thesis.degree.levelMasters
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
LIANG-THESIS-2021.pdf
Size:
755.18 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
4.52 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
2.96 KB
Format:
Plain Text
Description:
Download

Collections

Graduate Theses and Dissertations