Grid Task Scheduling Algorithm R3Q for Evolving Artificial Neural Networks

Task scheduling algorithms for evolving artificial neural networks (EANNs) in grid computing environments is discussed. In this paper, list scheduling with round-robin order replication (RR) is adopted to reduce waiting times due to synchronization. However, RR is suitable for coarse-grained tasks. For EANNs as medium-grained tasks, we propose a new technique to reduce the communication overhead, called the remote work queue (RWQ) method. We then define round-robin replication remote work queue (R3Q) as RWQ with RR. Our results show that R3Q can reduce both the synchronous waiting time and communication time %, and provides efficient forced termination of tasks compared to other methods.

[1]  Kazuhiro Ohkura,et al.  Grid task scheduling algorithm R3Q for evolution strategies , 2007, 2007 IEEE Congress on Evolutionary Computation.

[2]  Kenichi Hagihara,et al.  Near-optimal dynamic task scheduling of independent coarse-grained tasks onto a computational grid , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..

[3]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[4]  B. Yegnanarayana,et al.  Artificial Neural Networks , 2004 .

[5]  Inman Harvey,et al.  Issues in evolutionary robotics , 1993 .

[6]  Thomas Bäck,et al.  An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.

[7]  Xin Yao,et al.  Evolving artificial neural networks , 1999, Proc. IEEE.