Font Size: a A A

Research On Grid Task Scheduling Algorithm Based On Multi-dimensional QoS Constraints

Posted on:2011-02-07Degree:MasterType:Thesis
Country:ChinaCandidate:Y L TanFull Text:PDF
GTID:2178360305487428Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
High-performance grid computing technology has great future potential and has been the study of international hot topic. Grid task scheduling is the core of grid technology, and QoS is an important indicator of grid scheduling. Therefore, research on grid task scheduling algorithm based on Multi-dimensional QoS is the main focus of grid computing. In this paper, the goal is to reduce the makespan of tasks and the loss rate of discarded tasks. Specific method is to try to avoid delays caused by the incident.With the grid computing research, the grid scheduling algorithm not only stand in the angle of the grid system to improve the overall throughput, but also give full consideration to the actual needs of users to improve customer's satisfaction and improve the overall grid system quality of service. The paper provides particular method of solution for the unique QoS when it's design the model of algorithm, and the"false appearance"make rational regulation to the result caused by the"inaccurate value", and with the concern of two factors which are delay the tasks, proposed a new kind of scheduling policy—QoS-F algorithm by using the filter idea. The results of simulation experiments show that QoS-F algorithm to some extent improved the grid task scheduling of time delays and reduced the makespan of tasks and the loss rate of tasks.
Keywords/Search Tags:Grid Computing, Task Scheduling, QoS, Makespan, Filter Value
PDF Full Text Request
Related items