2494 search results - page 312 / 499 » Dependable Distributed Computing Using Free Databases |
182
click to vote
PDIS
1993
IEEE
15 years 10 months ago
1993
IEEE
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...
197
click to vote
CCGRID
2005
IEEE
16 years 2 days ago
2005
IEEE
In this article we present the design choices and the evaluation of a batch scheduler for large clusters, named OAR. This batch scheduler is based upon an original design that emp...
192
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Peer-to-peer systems have emerged as a popular way to share huge volumes of data. The usability of these systems depends on effective techniques to find and retrieve data; howeve...
185
click to vote
PPOPP
1999
ACM
15 years 10 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
166
click to vote
CCGRID
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...