Efficient Grid Scheduling through the Incremental Schedule-based Approach

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00049598" target="_blank" >RIV/00216224:14330/11:00049598 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1111/j.1467-8640.2010.00369.x" target="_blank" >http://dx.doi.org/10.1111/j.1467-8640.2010.00369.x</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1111/j.1467-8640.2010.00369.x" target="_blank" >10.1111/j.1467-8640.2010.00369.x</a>

Result language

angličtina

Original language name

Efficient Grid Scheduling through the Incremental Schedule-based Approach

Original language description

This paper concentrates on the application of schedule-based methods that improve on both the service delivered to the user and the traditional objective of machine usage. Importantly, the interaction between the incremental application of these methodsand the dynamic character of the problem allows reasonable runtimes to be achieved. Two new schedule-based methods that are designed to schedule dynamically arriving jobs on machines in a computational Grid are formally described and experimentally evaluated in the paper.

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/GA201%2F07%2F0205" target="_blank" >GA201/07/0205: Dynamic aspects of scheduling</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2011

Confidentiality

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

Name of the periodical

Computational Intelligence

ISSN

0824-7935

e-ISSN

—

Volume of the periodical

27

Issue of the periodical within the volume

1

Country of publishing house

US - UNITED STATES

Number of pages

19

Pages from-to

4-22

UT code for WoS article

000287401200002

EID of the result in the Scopus database

—