Abstract
The grid computing system can support execution of computationally intensive parallel and distributed applications. The main characteristics of grid computing system are similar to the heterogeneous computing system, except the fluctuant transfer rate. A dynamic scheduling algorithm, called Dynamic HEFT (DH) algorithm is proposed in this paper to enhance the functions of the original static HEFT (SH) algorithm. Instead of dispatching tasks to physical processors directly, the DH algorithm dispatches tasks to multiple queues. During runtime, the DH algorithm continues to dispatch the scheduled tasks to corresponding physical processor and predicts the transfer rate. Once the difference between two consecutive transfer rates is greater than the threshold value, rescheduling will be performed. The experimental results show that the proposed DH algorithm performs better than the SH algorithm in the system, especially under the grid computing environment, with fluctuant transfer rate and high bandwidth differences.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
