380 search results - page 44 / 76 » Dynamic load balancing for distributed search |
105
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Current peer-to-peer (P2P) streaming systems often assume that nodes are cooperative to upload and download data. However, in the open environment of the Internet, this is not ...
220
click to vote
CP
2009
Springer
16 years 4 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
125
click to vote
CF
2006
ACM
15 years 9 months ago
2006
ACM
Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed mat...
116
Voted
ICPP
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
147
click to vote
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we study the dynamic RWA problem in WDM networks with sparse wavelength conversion and propose a novel hybrid algorithm for it based on the combination of mobile ag...