Using imperialist competition algorithm for independent task scheduling in grid computing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86097038" target="_blank" >RIV/61989100:27240/14:86097038 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.3233/IFS-130988" target="_blank" >http://dx.doi.org/10.3233/IFS-130988</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3233/IFS-130988" target="_blank" >10.3233/IFS-130988</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Using imperialist competition algorithm for independent task scheduling in grid computing

Popis výsledku v původním jazyce

A grid computing environment provides a type of distributed computation that is unique because it is not centrally managed and it has the capability to connect heterogeneous resources. A grid system provides location-independent access to the resources and services of geographically distributed machines. An essential ingredient for supporting location-independent computations is the ability to discover resources that have been requested by the users. Because the number of grid users can increase and thegrid environment is continuously changing, a scheduler that can discover decentralized resources is needed. Grid resource scheduling is considered to be a complicated, NP-hard problem because of the distribution of resources, the changing conditions ofresources, and the unreliability of infrastructure communication. Various artificial intelligence algorithms have been proposed for scheduling tasks in a computational grid. This paper uses the imperialist competition algorithm (ICA) to a

Název v anglickém jazyce

Using imperialist competition algorithm for independent task scheduling in grid computing

Popis výsledku anglicky

A grid computing environment provides a type of distributed computation that is unique because it is not centrally managed and it has the capability to connect heterogeneous resources. A grid system provides location-independent access to the resources and services of geographically distributed machines. An essential ingredient for supporting location-independent computations is the ability to discover resources that have been requested by the users. Because the number of grid users can increase and thegrid environment is continuously changing, a scheduler that can discover decentralized resources is needed. Grid resource scheduling is considered to be a complicated, NP-hard problem because of the distribution of resources, the changing conditions ofresources, and the unreliability of infrastructure communication. Various artificial intelligence algorithms have been proposed for scheduling tasks in a computational grid. This paper uses the imperialist competition algorithm (ICA) to a

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Intelligent and Fuzzy Systems

ISSN

1064-1246

e-ISSN

—

Svazek periodika

27

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

13

Strana od-do

187-199

Kód UT WoS článku

000340435700016

EID výsledku v databázi Scopus

2-s2.0-84925365319