Using imperialist competition algorithm for independent task scheduling in grid computing

Result code in 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>
Result on the web
<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>

Result language
angličtina
Original language name
Using imperialist competition algorithm for independent task scheduling in grid computing
Original language description
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
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

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

Similar results(10)