Exhaustive List-Scheduling Heuristic for Dense Task Graphs
The Yugoslav Journal of Operations Research (2000)
- Volume: 10, Issue: 19, page 123-136
- ISSN: 0354-0243
Access Full Article
top
How to cite
topTatjana Davidović. "Exhaustive List-Scheduling Heuristic for Dense Task Graphs." The Yugoslav Journal of Operations Research 10.19 (2000): 123-136. <http://eudml.org/doc/261410>.
@article{TatjanaDavidović2000,
author = {Tatjana Davidović},
journal = {The Yugoslav Journal of Operations Research},
keywords = {scheduling; multiprocessors; precedence graphs},
language = {eng},
number = {19},
pages = {123-136},
publisher = {Faculty of Organizational Sciences},
title = {Exhaustive List-Scheduling Heuristic for Dense Task Graphs},
url = {http://eudml.org/doc/261410},
volume = {10},
year = {2000},
}
TY - JOUR
AU - Tatjana Davidović
TI - Exhaustive List-Scheduling Heuristic for Dense Task Graphs
JO - The Yugoslav Journal of Operations Research
PY - 2000
PB - Faculty of Organizational Sciences
VL - 10
IS - 19
SP - 123
EP - 136
LA - eng
KW - scheduling; multiprocessors; precedence graphs
UR - http://eudml.org/doc/261410
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.