ICDCN
2009
Springer
14 years 9 months ago
2009
Springer
ICDCN
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
ICDCN
2009
Springer
14 years 9 months ago
2009
Springer
ICDCN
2009
Springer
14 years 9 months ago
2009
Springer
ICDCN
2009
Springer
14 years 9 months ago
2009
Springer
Chandy et al. proposed the methodology of “self-similar algorithms” for distributed computation in dynamic environments. We further characterize the class of functions computab...
SC
2009
ACM
14 years 9 months ago
2009
ACM
The availability of large quantities of processors is a crucial enabler of many-task computing. Voluntary computing systems have proven that it is possible to build computing plat...
ICDCN
2010
Springer
14 years 9 months ago
2010
Springer
ICDCN
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we report our parallel implementations of the Lanczos sparse linear system solving algorithm over large prime fields, on a multi-core platform. We employ several lo...
ICDCN
2010
Springer
14 years 9 months ago
2010
Springer
Abstract— Motivated by the widespread proliferation of wireless networks employing directional antennas, we study the problem of provisioning bandwidth in such networks. Given a ...
ICDCN
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Since the demise of the Overnet network, the Kad network has become not only the most popular but also the only widely used peer-to-peer system based on a distributed has...