13752 search results - page 2374 / 2751 » Parallel and Distributed Haskells |
126
click to vote
SPAA
2009
ACM
16 years 5 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...
194
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
153
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
138
click to vote
HPCA
2009
IEEE
16 years 5 months ago
2009
IEEE
As the last-level on-chip caches in chip-multiprocessors increase in size, the physical locality of on-chip data becomes important for delivering high performance. The non-uniform...
137
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...