380 search results - page 55 / 76 » Dynamic load balancing for distributed search |
104
click to vote
WINE
2009
Springer
15 years 6 months ago
2009
Springer
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
ICPPW
2006
IEEE
15 years 5 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
ISCA
2005
IEEE
15 years 5 months ago
2005
IEEE
Pipelined forwarding engines are used in core routers to meet speed demands. Tree-based searches are pipelined across a number of stages to achieve high throughput, but this resul...
101
click to vote
IPPS
1996
IEEE
15 years 3 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
119
click to vote
SC
2003
ACM
15 years 5 months ago
2003
ACM
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participa...