Sciweavers

2519 search results - page 7 / 504
» Martingales and Locality in Distributed Computing
Sort
View
ALT
2008
Springer
14 years 4 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
14 years 8 hour ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
IPPS
2007
IEEE
14 years 1 months ago
A global address space framework for locality aware scheduling of block-sparse computations
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
Sriram Krishnamoorthy, Ümit V. Çataly&...
NETWORKING
2008
13 years 9 months ago
Distributed PLR-Based Backup Path Computation in MPLS Networks
In this article, we provide mechanisms enabling the backup path computation to be performed on-line and locally by the Points of Local Repair (PLRs), in the context of the MPLS-TE ...
Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le ...