3020 search results - page 435 / 604 » Optimal partition trees |
223
Voted
PLDI
2005
ACM
16 years 18 days ago
2005
ACM
Speculative parallelization can provide significant sources of additional thread-level parallelism, especially for irregular applications that are hard to parallelize by conventio...
195
click to vote
PDCAT
2005
Springer
16 years 16 days ago
2005
Springer
View-Oriented Parallel Programming is based on Distributed Shared Memory which is friendly and easy for programmers to use. It requires the programmer to divide shared data into v...
160
Voted
ICCSA
2004
Springer
16 years 12 days ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
193
click to vote
DAC
2003
ACM
16 years 9 days ago
2003
ACM
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
164
click to vote
ISPD
2003
ACM
16 years 9 days ago
2003
ACM
Previous works on buffer planning are mainly based on fixed die placement. It is necessary to reduce the complexity of computing the feasible buffer insertion sites to integrate t...