711 search results - page 51 / 143 » Yield-aware placement optimization |
93
Voted
EUROPAR
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Traditional code optimization techniques treat loops as nonpredictable structures and do not consider expressions containing array accesses for optimization. We show that...
109
Voted
DAC
2001
ACM
16 years 3 months ago
2001
ACM
Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
107
Voted
WEA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
113
Voted
ICCAD
2008
IEEE
15 years 11 months ago
2008
IEEE
—When manufacturing nano-devices, defects are a certainty and reliability becomes a critical issue. Until now, the most pervasive methods used to address reliability, involve inj...
133
click to vote
PLDI
2005
ACM
15 years 8 months ago
2005
ACM
Code placement techniques have traditionally improved instruction fetch bandwidth by increasing instruction locality and decreasing the number of taken branches. However, traditio...