Exploiting the structure of conflict graphs in high level synthesis
Commentationes Mathematicae Universitatis Carolinae, Tome 35 (1994) no. 1, pp. 155-167
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
In this paper we analyze the computational complexity of a processor optimization problem. Given operations with interval times in a branching flow graph, the problem is to find an assignment of the operations to a minimum number of processors. We analyze the complexity of this assignment problem for flow graphs with a constant number of program traces and a constant number of processors.
Classification :
05C15, 05C85, 68Q25, 68R10
Keywords: independent set; chromatic number; high level synthesis
Keywords: independent set; chromatic number; high level synthesis
@article{CMUC_1994__35_1_a14,
author = {Jansen, Klaus},
title = {Exploiting the structure of conflict graphs in high level synthesis},
journal = {Commentationes Mathematicae Universitatis Carolinae},
pages = {155--167},
publisher = {mathdoc},
volume = {35},
number = {1},
year = {1994},
mrnumber = {1292591},
zbl = {0806.68058},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMUC_1994__35_1_a14/}
}
TY - JOUR AU - Jansen, Klaus TI - Exploiting the structure of conflict graphs in high level synthesis JO - Commentationes Mathematicae Universitatis Carolinae PY - 1994 SP - 155 EP - 167 VL - 35 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/CMUC_1994__35_1_a14/ LA - en ID - CMUC_1994__35_1_a14 ER -
Jansen, Klaus. Exploiting the structure of conflict graphs in high level synthesis. Commentationes Mathematicae Universitatis Carolinae, Tome 35 (1994) no. 1, pp. 155-167. http://geodesic.mathdoc.fr/item/CMUC_1994__35_1_a14/