382 search results - page 48 / 77 » A Game-Theoretic Model and Algorithm for Load Balancing in D... |
WWW
2003
ACM
14 years 8 months ago
2003
ACM
In traditional peer-to-peer search networks, operations focus on properly labeled files such as music or video, and the actual search is often limited to text tags. The explosive ...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
SPAA
1994
ACM
13 years 11 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
PARLE
1993
13 years 11 months ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
IPPS
1996
IEEE
13 years 11 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...