Optimized scheduling of scientific workflows based on iterated local search

نویسندگان

چکیده

<span>Recent years have witnessed a great interest in scientific applications with large data and processing-intensive, so cloud computing is used which provides the resources needed to implement run these applications. One of challenges management workflow scheduling them solve many combinatorial optimization problems, including reducing execution time, cost, resource utilization, energy <span>consumption. Due fact that iterated local search algorithm (ILS) has been successfully applied this paper investigates performance ILS solving problem highly constrained problem. The main components are different from one others parameters, search, perturbation, must be</span> <span>carefully designed. standard examined compared latest technology. experimental results show proposed obtained good best-known literature. This due being an adaptable metaheuristic, can be simply adapted different situations instances.</span></span>

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Controller Placement in Software Defined Network using Iterated Local Search

Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...

متن کامل

Iterated local search for the multiple depot vehicle scheduling problem

The multiple depot vehicle scheduling problem (MDVSP) is a well-known and important problem arising in public transport. Although many solution approaches have been published in the literature, algorithms using metaheuristics appeared only very recently (Large Neighborhood Search and Tabu Search). In this paper, we introduce an Iterated Local Search algorithm for the MDVSP, incorporating a neig...

متن کامل

Iterated greedy local search methods for unrelated parallel machine scheduling

This work deals with the parallel machines scheduling problem which consists in the assignment of n jobs on m parallel machines. The most general variant of this problem is when the processing time depends on the machine to which each job is assigned to. This case is known as the unrelated parallel machines problem. Similarly to most of the literature, this paper deals with the minimization of ...

متن کامل

Iterated Local Search for the Generator Maintenance Scheduling Problem

We consider the task of devising an effective metaheuristic for a variant of the preventive maintenance scheduling problem (PMSP) — the (power) generator maintenance scheduling problem (GMSP). Recent research on metaheuristics for this problem has made progress on it, but the potential economic benefits of effective methods is significant in this area, and warrants further focused work. We prop...

متن کامل

Similarity Search for Scientific Workflows

With the increasing popularity of scientific workflows, public repositories are gaining importance as a means to share, find, and reuse such workflows. As the sizes of these repositories grow, methods to compare the scientific workflows stored in them become a necessity, for instance, to allow duplicate detection or similarity search. Scientific workflows are complex objects, and their comparis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science

سال: 2022

ISSN: ['2502-4752', '2502-4760']

DOI: https://doi.org/10.11591/ijeecs.v25.i3.pp1615-1624