23589 search results - page 139 / 4718 » Uncheatable Distributed Computations |
123
click to vote
EUROPAR
2005
Springer
15 years 7 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
105
click to vote
HPCC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
124
click to vote
WDAG
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
117
click to vote
EUROMICRO
1999
IEEE
15 years 6 months ago
1999
IEEE
Network-centric computing aims to solve the problems associated with traditional client/server systems, namely the high performance requirements, and costly maintenance of, the co...
FTCS
1993
15 years 3 months ago
1993
Interval availability is a dependability measure defined by the fraction of time during which a system is in operation over a finite observation period. The computation of its d...