25167 search results - page 104 / 5034 » Parallel and Distributed Algorithms |
169
click to vote
ICDCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
205
click to vote
CF
2007
ACM
15 years 10 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
142
click to vote
CLUSTER
2006
IEEE
16 years 13 days ago
2006
IEEE
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
153
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
Although there have been several attempts to create grid systems, there is no clear definition for grids. In this paper, a formal approach is presented for defining elementary func...
163
click to vote
EUROPAR
2004
Springer
15 years 11 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...