23557 search results - page 81 / 4712 » Distributed Computing - Introduction |
EUROPAR
2005
Springer
14 years 2 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...
HPCC
2005
Springer
14 years 2 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...
WDAG
2005
Springer
14 years 2 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 ...
EUROMICRO
1999
IEEE
14 years 1 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
13 years 10 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...