Balanced Job Assignment Based on Ant Algorithm for Computing Grids

Grid computing is a new research subject. The computing power and storage space of grids is collected from heterogeneous or homogeneous resources in order to support complicated computing problems. Job scheduling in computing grid is a very important problem. Current scientific applications become more complex and need huge computing power and storage space. It may take a very long time to complete a complicated job. However, to utilize grids, we need an efficient job scheduling algorithm to assign jobs to resources in grids. In this paper, we propose a Balanced Ant Colony Optimization (BACO) algorithm for job scheduling in the Grid environment. There are two schemes introduced in this paper regarding local and global pheromone update. The main contributions of our work are to balance the entire system load and minimize the makespan of a given set of jobs. Compared with the other proposed algorithms, BACO can outperform them according to the experimental results.

[1]  David E. Culler,et al.  A transmission control scheme for media access in sensor networks , 2001, MobiCom '01.

[2]  Rachel Cardell-Oliver,et al.  FlexiMAC: A flexible TDMA-based MAC protocol for fault-tolerant and energy-efficient wireless sensor networks , 2006, 2006 14th IEEE International Conference on Networks.

[3]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[4]  É. Taillard,et al.  Adaptive memories for the Quadratic Assignment Problems , 1997 .

[5]  Satish K. Tripathi,et al.  Static and Dynamic Processor Scheduling Disciplines in Heterogeneous Parallel Architectures , 1995, J. Parallel Distributed Comput..

[6]  K. M. Sim,et al.  Multiple ant-colony optimization for network routing , 2002, First International Symposium on Cyber Worlds, 2002. Proceedings..

[7]  Suresh Singh,et al.  PAMAS—power aware multi-access protocol with signalling for ad hoc networks , 1998, CCRV.

[8]  J. J. Garcia-Luna-Aceves,et al.  A new approach to channel access scheduling for Ad Hoc networks , 2001, MobiCom '01.

[9]  David E. Culler,et al.  Versatile low power media access for wireless sensor networks , 2004, SenSys '04.

[10]  Honggang Wang,et al.  An Energy Efficient Pre-Schedule Scheme for Hybrid CSMA/TDMA MAC in Wireless Sensor Networks , 2006, 2006 10th IEEE Singapore International Conference on Communication Systems.

[11]  Gregory J. Pottie,et al.  Performance of a novel self-organization protocol for wireless ad-hoc sensor networks , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[12]  Yan Zhou,et al.  Overview of Power-Efficient MAC and Routing Protocols for Wireless Sensor Networks , 2006, 2006 2nd IEEE/ASME International Conference on Mechatronics and Embedded Systems and Applications.

[13]  Bhaskar Krishnamachari,et al.  An adaptive energy-efficient and low-latency MAC for data gathering in wireless sensor networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[14]  Deborah Estrin,et al.  Medium access control with coordinated adaptive sleeping for wireless sensor networks , 2004, IEEE/ACM Transactions on Networking.

[15]  F. Pettersson,et al.  Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem , 2007, Appl. Math. Comput..

[16]  Katia Obraczka,et al.  Energy-efficient collision-free medium access control for wireless sensor networks , 2003, SenSys '03.

[17]  Hui Yan,et al.  An improved ant algorithm for job scheduling in grid computing , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[18]  A. Menendez,et al.  Preamble Sampling MAC Protocol for Low Power Wireless Sensor Networks with IEEE 802.15.4 Transceivers , 2006, 2006 IEEE Instrumentation and Measurement Technology Conference Proceedings.