Sciweavers

620 search results - page 90 / 124
» Optimizing the BSD routing system for parallel processing
Sort
View
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 7 months ago
Relational joins on graphics processors
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...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...
SCHOLARPEDIA
2011
12 years 10 months ago
N-body simulations
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...
IPPS
2007
IEEE
14 years 1 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
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...
Samee Ullah Khan, Ishfaq Ahmad
PVM
2005
Springer
14 years 1 months ago
Implementing Byte-Range Locks Using MPI One-Sided Communication
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 ...
Rajeev Thakur, Robert B. Ross, Robert Latham
IJCIS
1998
116views more  IJCIS 1998»
13 years 7 months ago
Distributed Query Scheduling Service: An Architecture and Its Implementation
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 ...
Ling Liu, Calton Pu, Kirill Richine