339 search results - page 56 / 68 » Random Sampling Techniques in Parallel Computation |
140
click to vote
PODC
2011
ACM
14 years 13 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
ICPPW
2007
IEEE
15 years 3 months ago
2007
IEEE
— Peer-to-Peer (P2P) technologies have found much success in applications like file distributions, and its adoption in live video streaming has recently attracted significant a...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
74
Voted
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Resource scheduling in large-scale, volatile desktop grids is challenging because resource state is both dynamic and eclectic. Matching available resources with requests is not al...
102
click to vote
HIPC
2007
Springer
15 years 1 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...