@TECHREPORT{R-95-25,
PSURL = {/publications/cgi-bin/tr-fetch.pl?r-95-25+ps},
NUMBER = {R-95-25},
INSTITUTION = ida,
ADDRESS = idaaddr,
YEAR = {1995},
AUTHOR = {Karlsson, Jonas s and Litwin, Witold and Risch, Tore},
TITLE = {LH*LH : A Scalable High Performance Data Strucuture for Switched Multicomputers},
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-95-25+abstr},
ABSTRACT = {LH*LH is a new data structure for scalable high-performance hash files on the increasingly popular switched multicomputers, i.e., MIMD multiprocessor machines with distributed RAM memory and without shared memory. An LH*LH file scales up gracefully over available processors and the distributed memory, easily reaching Gbytes. Address calculus does not require any centralized component that could lead to a hot- spot. Access times to the file can be under a millisecond and the file can be used in parallel by several client processors. We show the LH*LH design, and report on the performance analysis. This includes experiments on the Parsytec GC/PowerPlus multicomputer with up to 128 Power PCs and 32 MB of distributed RAM per node. We prove the efficiency of the method and justify various algorithmic choices that were made. LH*LH opens a new perspective for high-performance applications, especially for the database management of new types of data and in real-time environments.}