z-logo
open-access-imgOpen Access
Solving Optimization Problems in Nimrod/OK using a Genetic Algorithm
Author(s) -
Yu Hua Lim,
Jefferson Tana,
David Abramson
Publication year - 2012
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2012.04.182
Subject(s) - computer science , pipeline (software) , benchmarking , computation , workflow , set (abstract data type) , genetic algorithm , algorithm , kepler , theoretical computer science , programming language , machine learning , marketing , database , business , stars , computer vision
A scientific workflow can be viewed as formal model of the flow of data between processing components. It often involves a combination of data integration, computation, analysis, and visualization steps. An emerging use case involves determining some input parameters that minimize (or maximize) the output of a computation. Kepler is a good framework for specifying such optimizations because arbitrary computations can be composed into a pipeline, which is then repeated until an optimal set of inputs is found. Genetic Algorithms are generic optimization algorithms based on the principles of genetics and natural selection, and are well suited for models with discontinuous objective functions. This paper discusses an implementation of a Genetic Algorithm in Kepler, building on the Nimrod/OK framework. The resulting tool is generic and flexible enough to support a variety of experimental domains. The paper reports a number of experiments that demonstrate the performance with a set of benchmarking functions

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom