1074 search results - page 41 / 215 » Parallelizing post-placement timing optimization |
HICSS
1995
IEEE
14 years 11 days ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
PPL
2000
13 years 8 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
WSC
2004
13 years 10 months ago
2004
We investigate factors that impact the effectiveness of caching to speed up discrete event simulation. Walsh and Sirer have shown that a variant of function caching (staged simula...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a multi-core tree-based...
JCO
1998
13 years 8 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...