Sciweavers

711 search results - page 46 / 143
» Yield-aware placement optimization
Sort
View
PLDI
1995
ACM
15 years 6 months ago
Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
Partial Redundancy Elimination PRE is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redun...
Gagan Agrawal, Joel H. Saltz, Raja Das
134
Voted
CONCURRENCY
2000
103views more  CONCURRENCY 2000»
15 years 2 months ago
Cooperating distributed garbage collectors for clusters and beyond
The contribution of this paper is twofold. First a distributed garbage collector (DGC) is presented that is optimized for remote method invocation in reliable networks, such as cu...
Michael Philippsen
109
Voted
DAC
2009
ACM
16 years 3 months ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu
127
Voted
DAC
2007
ACM
16 years 3 months ago
IPR: An Integrated Placement and Routing Algorithm
Abstract-- In nanometer-scale VLSI technologies, several interconnect issues like routing congestion and interconnect delay have become the main concerns in placement. However, all...
Min Pan, Chris C. N. Chu