Title page for ETD etd-07102006-164018


Type of Document Master's Thesis
Author Basavaraj, Veena
Author's Email Address veenabs@vt.edu
URN etd-07102006-164018
Title Optimality of Heuristic Schedulers in Utility Accrual Real-time Scheduling Environments
Degree Master of Science
Department Computer Science
Advisory Committee
Advisor Name Title
Back, Godmar V. Committee Chair
Cameron, Kirk W. Committee Member
Jensen, E. Douglas Committee Member
Keywords
  • real-time
  • utility accrual
  • time-utility functions
  • optimality
Date of Defense 2006-07-06
Availability unrestricted
Abstract
Scheduling decisions in soft real-time environments are based on a utility function. The goal of such schedulers is to use a best-effort approach to maximize the utility function and ensure graceful degradation at overloads. Utility Accrual (UA) schedulers use heuristics to maximize the accrued utility. Heuristic-based scheduling do not always yield the optimal schedule even if there exists one because they do not explore the entire search space of task orderings. In distributed systems, local UA schedulers use the same heuristics along with deadline decomposition for task segments.

At present, there has been no evaluation and analysis of the degree to which these polynomial-time, heuristic algorithms succeed in maximizing the total utility accrued. We implemented a preemptive, off-line static scheduling algorithm that performs an exhaustive search of all the possible task orderings to yield the optimal schedules. We simulated two important online dynamic UA schedulers, DASA-ND and LBESA for different system loads, task models, utility and load distribution patterns, and compared their performance with their corresponding optimal schedules.

Our experimental analysis indicates that for most scenarios, both DASA-ND and LBESA create optimal schedules. When task utilities are equal or form a geometric sequence with an order of magnitude difference in their utility values, UA schedulers show more than 90% probability of being optimal for single-node workloads. Even though deadline decomposition substantially improves the optimality of both DASA-ND and LBESA under different scenarios for distributed workloads, it can adversely affect the scheduling decisions for some task sets we considered.

Files
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  VB_OPTIMALITY_ETD.pdf 2.95 Mb 00:13:39 00:07:01 00:06:08 00:03:04 00:00:15

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.