PERFORMANCE COMPARISON OF SIX EFFICIENT PURE HEURISTICS FOR SCHEDULING META-TASKS ON HETEROGENEOUS DISTRIBUTED ENVIRONMENTS

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F09%3A00020941" target="_blank" >RIV/61989100:27240/09:00020941 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

PERFORMANCE COMPARISON OF SIX EFFICIENT PURE HEURISTICS FOR SCHEDULING META-TASKS ON HETEROGENEOUS DISTRIBUTED ENVIRONMENTS

Original language description

Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous, distributed computing systems and represents an NP-complete problem. Therefore, using meta heuristic algorithms is a suitable approach in order to cope with itsdifficulty. In many meta-heuristic. algorithms, generating individuals in the initial stop has an important effect oil the convergence behavior of the algorithm and final solutions. Using some pure heuristics for generating one or more near-optimal individuals in the initial step can improve the final solutions obtained by meta-heuristic algorithms. Pure heuristics may be used solitary for generating schedules in many real-world situations in which using the meta-heuristic methods are too difficult orinappropriate. Different criteria can be used for evaluating the efficiency of scheduling algorithms, the most important of which are makespan and flowtime. In this paper, we propose an efficient pure heuristic method and then we compare

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GA102%2F09%2F1494" target="_blank" >GA102/09/1494: New methods od data transmition based on turbo code</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2009

Confidentiality

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

Name of the periodical

NEURAL NETWORK WORLD

ISSN

1210-0552

e-ISSN

—

Volume of the periodical

6

Issue of the periodical within the volume

19

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

15

Pages from-to

—

UT code for WoS article

000273729800003

EID of the result in the Scopus database

—