Sciweavers

1101 search results - page 9 / 221
» Scalable Distributed Data Structures for High-Performance Da...
Sort
View
DEXAW
2006
IEEE
140views Database» more  DEXAW 2006»
15 years 5 months ago
String-Matching and Update through Algebraic Signatures in Scalable Distributed Data Structures
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
Riad Mokadem, Witold Litwin
193
Voted
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
16 years 1 months ago
Algebraic Signatures for Scalable Distributed Data Structures
Signatures detect changes to the data objects. Numerous schemes a known, e.g., the popular hash based SHA-1 standard. We propose a nov scheme we call algebraic signatures. We use ...
Witold Litwin, Thomas J. E. Schwarz
SIGCOMM
2009
ACM
15 years 6 months ago
BCube: a high performance, server-centric network architecture for modular data centers
This paper presents BCube, a new network architecture specifically designed for shipping-container based, modular data centers. At the core of the BCube architecture is its serve...
Chuanxiong Guo, Guohan Lu, Dan Li, Haitao Wu, Xuan...
ISHPC
1997
Springer
15 years 3 months ago
Implementing Iterative Solvers for Irregular Sparse Matrix Problems in High Performance Fortran
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
Eric de Sturler, Damian Loher
92
Voted
EDBT
2000
ACM
15 years 3 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...