Research on tasks scheduling algorithms for dynamic and uncertain computing grid based on a+bi connection number of SPA

Document Type

Article

Publication Date

12-1-2009

Abstract

Task scheduling algorithms are key techniques in task management system of computing grid. Because of the uncertainty nature of a grid, traditional task scheduling algorithms do not work well in an open, heterogeneous and dynamic grid environment of real world. In this paper, Set Pair Analysis (SPA), a new soft computation method is used to process the synthetic uncertainty in the task scheduling of a computing grid. After introducing SPA and its application, the paper goes on to introduce the definition of connection number to express the uncertain Expected Time to Compute of tasks, analysis operation properties and linear order relation suitable for computing grid scheduling. Three online uncertain dynamic scheduling algorithms, OUD_OLB, OUD_MET, OUD_MCT, and three batch uncertain dynamic scheduling algorithms BUD_Min-min, BUD_Min-max, BUD_Surferage, are presented for the uncertain dynamic computing grid. Theoretical analysis and experimental results illustrate that these algorithms are capable of representing the dynamics and uncertainty in a computing grid environment. These algorithms are the generalization of traditional grid scheduling algorithms, and they possess high value in theory and application in a grid environment. Certainly it will be a new method to design tasks scheduling algorithm in uncertain computing grid environment. © 2009 Academy Publisher.

Identifier

77954099619 (Scopus)

Publication Title

Journal of Software

External Full Text Location

https://doi.org/10.4304/jsw.4.10.1102-1109

ISSN

1796217X

First Page

1102

Last Page

1109

Issue

10

Volume

4

This document is currently not available here.

Share

COinS