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.
Unable to display preview. Download preview PDF.
- 1.X. Yao (1999),“Evolving Artificial Neural Networks”, Proceedings of the IEEE, 87, 1423–1447, IEEE press.Google Scholar
- 2.Harvey, P. Husbands and D. Clif (1993), “Issues in Evolutionary Robotics”, From animals to animats 2: Proceedings of the Second International Conference on Simulation of Adaptive Behaviour (SAB92), 364–373, MIT Press, Cambridge.Google Scholar
- 3.Y. Matsumura, X. Yao, J. Wyatt, K. Ohkura and K. Ueda (2003), “Robust Evolution Strategies Use Adaptive Search Strategies to Design the Continuous-Time Recurrent Neural Networks”, Proceedings of 2nd International Conference on Computational Intelligence, Robotics and Autonomous Systems (CIRAS 2003).Google Scholar
- 5.N. Fujimoto and K. Hagihara (2003), “Near-Optimal Dynamic Task Scheduling of Independent Coarse-Grained Tasks onto a Computational Grid”, Proceedings of the 32nd Annual International Conference on Parallel Processing (ICPP-03), 391–398, IEEE Press, Kaohsiung.Google Scholar
- 6.Y. Matsumura, K. Ohkura, Y. Matsuura, M. Oiso, N. Fujimoto and K. Hagihara (2007), “Grid Task Scheduling Algorithm R3Q for Evolution Strategies”, Proceedings of IEEE Congress on Evolutionary Computation (CEC 2007), Singapore.Google Scholar
- 7.R. L. Graham (1966), “Bounds for certain multiprocessing anomalies”, Bell System Technical Journal, 45, 1563–1581.Google Scholar