6355 search results - page 1212 / 1271 » From Logic to Games |
148
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
148
click to vote
HPCA
2009
IEEE
16 years 6 months ago
2009
IEEE
Realizing scalable cache coherence in the many-core era comes with a whole new set of constraints and opportunities. It is widely believed that multi-hop, unordered on-chip networ...
179
click to vote
PERCOM
2009
ACM
16 years 6 months ago
2009
ACM
In this paper, a DHT-based routing protocol which integrates at the network layer both traditional direct routing, i.e. MANET routing, and indirect key-based routing, i.e. P2P rout...
142
click to vote
HPCA
2006
IEEE
16 years 6 months ago
2006
IEEE
We propose dynamic scheduler designs to improve the scheduler scalability and reduce its complexity in the SMT processors. Our first design is an adaptation of the recently propos...
170
click to vote
HPCA
2005
IEEE
16 years 6 months ago
2005
IEEE
The use of large instruction windows coupled with aggressive out-oforder and prefetching capabilities has provided significant improvements in processor performance. In this paper...