3112 search results - page 378 / 623 » Cluster Computing White Paper |
171
click to vote
GECCO
2007
Springer
16 years 19 days ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
179
click to vote
NBIS
2007
Springer
16 years 18 days ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
159
click to vote
CCGRID
2005
IEEE
16 years 2 days ago
2005
IEEE
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
210
click to vote
GRID
2003
Springer
15 years 11 months ago
2003
Springer
There is a rapidly growing set of applications, referred to as data driven applications, in which analysis of large amounts of data drives the next steps taken by the scientist, e...
141
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we present a novel twist on the Beowulf cluster — the Bladed Beowulf. Designed by RLX Technologies and integrated and configured at Los Alamos National Laborator...