620 search results - page 90 / 124 » Optimizing the BSD routing system for parallel processing |
222
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
150
click to vote
SCHOLARPEDIA
2011
14 years 7 months ago
2011
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
126
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
131
click to vote
PVM
2005
Springer
15 years 10 months ago
2005
Springer
We present an algorithm for implementing byte-range locks using MPI passive-target one-sided communication. This algorithm is useful in any scenario in which multiple processes of ...
165
click to vote
IJCIS
1998
15 years 4 months ago
1998
We present the systematic design and development of a distributed query scheduling service DQS in the context of DIOM, a distributed and interoperable query mediation system 26 ...