116 search results - page 2 / 24 » Loop-Carried Code Placement |
84
Voted
IPPS
1996
IEEE
15 years 4 months ago
1996
IEEE
This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost / performance tradeoffs in a torus p...
103
Voted
INTEGRATION
2006
15 years 18 days ago
2006
In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible ...
78
Voted
SIGMETRICS
2002
ACM
15 years 8 days ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
116
Voted
DSN
2008
IEEE
15 years 2 months ago
2008
IEEE
XOR-based erasure codes are a computationallyefficient means of generating redundancy in storage systems. Some such erasure codes provide irregular fault tolerance: some subsets o...
120
Voted
ASPLOS
1998
ACM
15 years 4 months ago
1998
ACM
As the gap between memory and processor speeds continues to widen, cache efficiency is an increasingly important component of processor performance. Compiler techniques have been...