Evaluation of LH*LH for a Multicomputer Architecture

Authors:
Andy D. Pimentel;Louis O. Hertzberger
Affiliations:
-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 7
Cited 1

Computer architecture: a quantitative approach

Computer architecture: a quantitative approach
LH*—a scalable, distributed data structure

ACM Transactions on Database Systems (TODS)
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
LH*LH: A scalable High Performance Data Structure for Switched Multicomputers

EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
An Architecture Workbench for Multicomputers

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Evaluation of a Mesh of Clos Wormhole Network

HIPC '96 Proceedings of the Third International Conference on High-Performance Computing (HiPC '96)
Linear hashing: a new tool for file and table addressing

VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6

Performance evaluation of the LH*lh scalable, distributed data structure for a cluster of workstations

Proceedings of the 2001 ACM symposium on Applied computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scalable, distributed data structures can provide fast access to large volumes of data. In this paper, we present a simulation study in which the performance behaviour of one of these data structures, called LH*LH, is evaluated for a multicomputer architecture. Our experimental results demonstrate that the access-time to LH*LH can be very small and does not deteriorate for increasing data structure sizes. Furthermore, we also show that parallel access to the LH*LH data structure may speed up client applications. This speed-up is, however, shown to be constrained by a number of effects.