1912 search results - page 227 / 383 » Optimizing interconnection policies |
131
click to vote
PODC
2003
ACM
15 years 9 months ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
114
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered ...
134
click to vote
EUROPAR
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. In this paper, we address two key trends in the synthesis of implementations for embedded multiprocessors — (1) the increasing importance of managing interprocessor com...
120
click to vote
DAC
1999
ACM
15 years 8 months ago
1999
ACM
In this paper, we present a new method to the built-in selftestable data path synthesis based on integer linear programming (ILP). Our method performs system register assignment, ...
119
click to vote
ISPD
1999
ACM
15 years 8 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...