1502 search results - page 61 / 301 » Node weighted scheduling |
ICDCS
1997
IEEE
14 years 2 months ago
1997
IEEE
The virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. In applications that use a large number of groups, ...
ENTCS
2006
13 years 10 months ago
2006
Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. In a dynamic environment—in terms of node mobility as well as in ter...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract-- This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weig...
ORL
2006
13 years 10 months ago
2006
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machin...