Application of grid task scheduling algorithm RR to medium-grained evolution strategies

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A computational method for implementation of Evolution Strategies (ES) 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 in Medium-grained ES. Our results show that the replication in RR can reduce the synchronous waiting time in comparison with Work Queue (WQ) methods. © 2007 IEEE.

Cite

CITATION STYLE

APA

Matsumura, Y., Oiso, M., Matsuda, M., Fujimoto, N., Hagihara, K., Ohkura, K., … Yao, X. (2007). Application of grid task scheduling algorithm RR to medium-grained evolution strategies. In Proceedings - Third International Conference on Natural Computation, ICNC 2007 (Vol. 4, pp. 223–227). https://doi.org/10.1109/ICNC.2007.256

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free