284 search results - page 33 / 57 » Distributed Agreement with Optimal Communication Complexity |
144
click to vote
PDP
2010
IEEE
15 years 7 months ago
2010
IEEE
The increasing numbers of cores, shared caches and memory nodes within machines introduces a complex hardware topology. High-performance computing applications now have to carefull...
148
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. The hyperbolic geometry can be used to facilitate maximally ef...
169
click to vote
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
125
click to vote
ICDCS
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
138
click to vote
CF
2009
ACM
15 years 10 months ago
2009
ACM
Hybrid architectures combining the strengths of generalpurpose processors with application-specific hardware accelerators can lead to a significant performance improvement. Our ...