In heterogeneous distributed computing system, diversity can be present both in the computational resources and in the types of arriving tasks. In an inconsistently Heterogeneous Computing (HC) system, different task types can have different performance characteristics (i.e., execution times) on heterogeneous machines. A mapping method is required to match arriving tasks with machines based on both machine availability and performance to maximize the number of tasks meeting their deadlines (known as robustness). In particular, for tasks with hard individual deadlines ( e.g., live video streaming tasks), those that have missed their deadlines are dropped, as there is no value in executing them. The problem investigated in this research is how to maximize robustness of an HC system, specifically, when it is oversubscribed. The proposal is to prune (i.e., defer or drop) tasks with low probability of meeting their deadlines. Pruning low-chance tasks increases the probability of other tasks meeting their deadlines. To that end, first a model is provided to estimate the probability of meeting deadline for each task in the presence of task dropping. Second, a pruning mechanism is proposed to predictively defer or drop tasks in an effort to maximize the overall robustness of the HC system. Third, a mapping method is proposed that functions based on the pruning mechanism and improves robustness of the HC system. Fourth, to show a broad application, the pruning mechanism is applied to other mapping heuristics. Fifth, further development of the pruning mechanism is made from multiple fronts to improve robustness, engender fairness amongst completed task types, and examine the cost ramifications of using a pruning mechanism. Simulation results, harnessing a selection of mapping heuristics, show the efficacy of the proposed pruning mechanism can improve robustness of some oversubscribed HC system by more than 40%.
|Advisor:||Salehi, Mohsen A.|
|Commitee:||Chen, Sheng, Jin, Miao, Tzeng, Nian-Feng|
|School:||University of Louisiana at Lafayette|
|School Location:||United States -- Louisiana|
|Source:||MAI 58/05M(E), Masters Abstracts International|
|Keywords:||Distributed computing, Heterogeneous computing, Mapping heuristic, Robustness, Scheduling|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be