3204 search results - page 335 / 641 » The b-chromatic Number of a Graph |
171
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
175
click to vote
GD
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
171
click to vote
ICCAD
1994
IEEE
15 years 11 months ago
1994
IEEE
In high level synthesis each node of a synchronous dataflow graph (DFG) is scheduled to a specific time and allocated to a processor. In this paper we present new integer linear p...
160
click to vote
DAC
1993
ACM
15 years 11 months ago
1993
ACM
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...
168
click to vote
SC
1990
ACM
15 years 10 months ago
1990
ACM
Loop distribution is an integral part of transforming a sequential program into a parallel one. It is used extensively in parallelization,vectorization, and memory management. For...