Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Parameter Sweep

Handbook of Research on Computational Intelligence for Engineering, Science, and Business
a parameter sweep is a type of experiment in which multiple datapoints are examined by executing an algorithm numerous times with different parameter configurations.
Published in Chapter:
Schedulers Based on Ant Colony Optimization for Parameter Sweep Experiments in Distributed Environments
Elina Pacini (Institute for Information and Communication Technologies, Universidad Nacional de Cuyo, Argentina), Cristian Mateos (Instituto Superior de Ingenieria de Software, Consejo Nacional de Investigaciones Cientificas y Tecnicas, Argentina), and Carlos García Garino (Institute for Information and Communication Technologies, Universidad Nacional de Cuyo, Argentina)
DOI: 10.4018/978-1-4666-2518-1.ch016
Abstract
Scientists and engineers are more and more faced to the need of computational power to satisfy the ever-increasing resource intensive nature of their experiments. An example of these experiments is Parameter Sweep Experiments (PSE). PSEs involve many independent jobs, since the experiments are executed under multiple initial configurations (input parameter values) several times. In recent years, technologies such as Grid Computing and Cloud Computing have been used for running such experiments. However, for PSEs to be executed efficiently, it is necessary to develop effective scheduling strategies to allocate jobs to machines and reduce the associated processing times. Broadly, the job scheduling problem is known to be NP-complete, and thus many variants based on approximation techniques have been developed. In this work, the authors conducted a survey of different scheduling algorithms based on Swarm Intelligence (SI), and more precisely Ant Colony Optimization (ACO), which is the most popular SI technique, to solve the problem of job scheduling with PSEs on different distributed computing environments.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR