5180 search results - page 784 / 1036 » Concurrency, Time, and Constraints |
205
click to vote
ISPD
1999
ACM
15 years 11 months ago
1999
ACM
In this paper, we consider delay optimization in multilayer detailed routing. Given a detailed routing by some detailed router, we iteratively improve the delays of critical nets ...
144
click to vote
MICRO
1999
IEEE
15 years 11 months ago
1999
IEEE
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
175
click to vote
RTCSA
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
164
click to vote
AMAST
1998
Springer
15 years 11 months ago
1998
Springer
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...
192
click to vote
DAC
1997
ACM
15 years 11 months ago
1997
ACM
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...