Load-balancing strategies in distributed workflow management system

Author

Zhang, Ming ; Wei, Zu-kuan

Author_Institution

Coll. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China

Volume

1

fYear

2010

fDate

June 29 2010-July 1 2010

Firstpage

235

Lastpage

238

Abstract

The grid technology has been used to solve complicated scientific problems for a long time. Since the heterogeneity of gird, we need an effective method to dispatch the tasks to computational units with different process abilities. In this paper, we first propose a new measurement standard for workload, and then three load-balancing strategies, namely RANDOM, shortest processing time first (SPTF) and longest processing time first (LPTF), are compared in order to find out a relatively optional one. The LPTF rule shows better performance when the number of workflow instances increases beyond a specific threshold value.

Keywords

grid computing; resource allocation; RANDOM; distributed workflow management system; grid technology; load balancing strategy; longest processing time first; shortest processing time first; Computer architecture; Engines; Fires; Radio access networks; Distributed computing; Load balancing; Scheduling strategy; Workflow;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Systems, Networks and Applications (ICCSNA), 2010 Second International Conference on

Conference_Location

Hong Kong

Print_ISBN

978-1-4244-7475-2

Type

conf

DOI

10.1109/ICCSNA.2010.5588701

Filename

5588701