Analysis of an approximation algorithm for scheduling indepentent parallel tasks.
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (1999)
- Volume: 3, Issue: 4, page 155-166
- ISSN: 1365-8050
Access Full Article
top
How to cite
topLi, Keqin. "Analysis of an approximation algorithm for scheduling indepentent parallel tasks.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 3.4 (1999): 155-166. <http://eudml.org/doc/120594>.
@article{Li1999,
author = {Li, Keqin},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {average-case performance ratio; probabilistic analysis; worst-case performance ratio},
language = {eng},
number = {4},
pages = {155-166},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Analysis of an approximation algorithm for scheduling indepentent parallel tasks.},
url = {http://eudml.org/doc/120594},
volume = {3},
year = {1999},
}
TY - JOUR
AU - Li, Keqin
TI - Analysis of an approximation algorithm for scheduling indepentent parallel tasks.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 1999
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 3
IS - 4
SP - 155
EP - 166
LA - eng
KW - average-case performance ratio; probabilistic analysis; worst-case performance ratio
UR - http://eudml.org/doc/120594
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.