380 search results - page 47 / 76 » Dynamic load balancing for distributed search |
152
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
237
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
182
click to vote
COMPSAC
2002
IEEE
15 years 11 months ago
2002
IEEE
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
156
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
We present PIO-HMMER, an enhanced version of MPI-HMMER. PIO-HMMER improves on MPIHMMER’s scalability through the use of parallel I/O and a parallel file system. In addition, we...
187
Voted
CLUSTER
2004
IEEE
15 years 10 months ago
2004
IEEE
Single system image(SSI) systems have been the mainstay of high-performance computing for many years. SSI requires the integration and aggregation of all types of resources in a c...