40 search results - page 4 / 8 » A new technique for distributed symmetry breaking |
ANOR
2011
13 years 2 months ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
CLUSTER
2006
IEEE
14 years 1 months ago
2006
IEEE
The MPI-IO standard creates a huge opportunity to break out of the traditional file system I/O methods. As a software layer between the user and the file system, an MPI-IO libra...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Replication is a fundamental technique for increasing throughput and achieving fault tolerance in distributed data services. However, its implementation may induce signif...
DC
2010
13 years 7 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...