A machine assignment mechanism for compile-time list-scheduling heuristics

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F05%3A03138034" target="_blank" >RIV/68407700:21230/05:03138034 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

A machine assignment mechanism for compile-time list-scheduling heuristics

Original language description

Finding an optimal solution for a scheduling problem is NP-complete. Therefore, it is necessary to use heuristics to find a good schedule rather than evaluating all possible schedules. List scheduling is generally accepted as an attractive approach, since it combines low complexity with good results. List scheduling consists of two phases: a task prioritization phase where a certain priority is computed and assigned to each task, and a machine assignment phase where each task (in order of its priority)is assigned a machine that minimizes a suitable cost function. This paper presents a machine assignment mechanism that can be used with any list-scheduling algorithm. The mechanism is called Reverse Duplicator Mechanism and outperforms the current mechanisms.

Czech name

Rozvrhovací mechanismus pro statické seznamové heuristiky

Czech description

Není k dispozici

Type

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

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2005

Confidentiality

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

Name of the periodical

Computing and Informatics

ISSN

1335-9150

e-ISSN

—

Volume of the periodical

24

Issue of the periodical within the volume

4

Country of publishing house

SK - SLOVAKIA

Number of pages

10

Pages from-to

341-350

UT code for WoS article

—

EID of the result in the Scopus database

—