Using Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems

Simple item page
dc.contributor.authorHegazy, Tamir A.en
dc.contributor.committeechairRavindran, Binoyen
dc.contributor.committeememberDavis, Nathaniel J. IVen
dc.contributor.committeememberMidkiff, Scott F.en
dc.contributor.departmentElectrical and Computer Engineeringen
dc.date.accessioned2014-03-14T20:46:21Zen
dc.date.adate2001-10-12en
dc.date.available2014-03-14T20:46:21Zen
dc.date.issued2001-09-20en
dc.date.rdate2002-10-12en
dc.date.sdate2001-10-05en
dc.description.abstractThis thesis presents two proactive resource allocation algorithms, RBA* and OBA, for asynchronous real-time distributed systems. The algorithms consider an application model where timeliness requirements are expressed using Jensen's benefit functions and propose adaptation functions to describe anticipated workload for future time intervals. Furthermore, an adaptation model is considered where processes are replicated for sharing workload increases. A real-time Ethernet system model is considered where message collisions are resolved. Given such models, the objective is to maximize aggregate application benefit and minimize aggregate missed deadline ratio. Since determining the optimal allocation is computationally intractable, the algorithms heuristically compute the allocation so that it is as "close" as possible to the optimal allocation. While RBA* analyzes process response times to determine the allocation, OBA analyzes processor overloads to compute the decision in a much faster way. RBA* incurs a quadratic amortized complexity in terms of subtask arrivals for the most computationally intensive component when DASA is used as the underlying process-scheduling algorithm, whereas OBA incurs a logarithmic amortized complexity for the corresponding component. To study how different process-scheduling and message-scheduling algorithms affect the performance of the algorithms and to compare their performances, benchmark-driven experiments were conducted. The experimental results reveal that RBA* produces higher aggregate benefit and lower missed deadline ratio when DASA is used for process scheduling and message scheduling. Furthermore, it is observed that RBA* produces higher aggregate benefit and lower missed deadline ratio than OBA, confirming the intuition that accurate response time analysis can lead to better results.en
dc.description.degreeMaster of Scienceen
dc.identifier.otheretd-10052001-132416en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-10052001-132416/en
dc.identifier.urihttp://hdl.handle.net/10919/35296en
dc.publisherVirginia Techen
dc.relation.haspartThesis.pdfen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectasynchronous systemsen
dc.subjectresource allocationen
dc.subjectcomputeren
dc.subjectreal-timeen
dc.subjectdistributed systemsen
dc.titleUsing Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systemsen
dc.typeThesisen
thesis.degree.disciplineElectrical and Computer Engineeringen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Thesis.pdf
Size:
358.56 KB
Format:
Adobe Portable Document Format
Download

Collections

Masters Theses