Recent enthusiasm in grid computing has resulted in a tremendous amount of research in resource scheduling techniques for tasks in a (scientific) workflow. There are many factors that may affect the scheduling results, one of which is whether the application is computing-intensive or data-intensive. Most of the grid scheduling researches focus on a single aspect of the environments. In this thesis, we base on our previous work, a probability-based framework for dynamic resource scheduling, and consider data transmission overhead in our scheduling algorithms. The goal is to dynamically assign resources to tasks so as to maximize the probability of completing the entire workflow within a desired total response time. We propose two algorithms for the dynamic resource scheduling in grid environment, namely largest deadline completion probability (LDCP) and smallest deadline completion probability (SDCP). Furthermore, considering the data transmission overhead, we propose a suite of push-based scheduling algorithms, which schedule all the immediate descendant tasks when a task is completed. These are algorithms will be compared to the pull-demand scheduling algorithms in our previous work and workflow-based algorithms proposed by other researchers. We use GridSim toolkit to model the grid environment and evaluate the performance of the various scheduling algorithms.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0723108-124114 |
| Date | 23 July 2008 |
| Creators | Li, Shih-Yung |
| Contributors | Wan-Shiou Yang, San-Yih Hwang, Te-Min Chang |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723108-124114 |
| Rights | campus_withheld, Copyright information available at source archive |
Page generated in 0.0023 seconds