DocumentCode
3503512
Title
A distributed query structure to explore random mappings in parallel
Author
Heichler, Jan ; Keller, Jörg
Author_Institution
Inst. fur Informatik, Martin-Luther-Univ. Halle-Wittenberg, Halle, Germany
fYear
2006
fDate
15-17 Feb. 2006
Abstract
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performance of a parallel algorithm for the computation of the structure of a graph induced by a random function. Tradeoffs between different organizations using main memory or hard disks are developed and quantified with parameters. Thus, for concrete cluster systems with concrete parameter values, the best organization can be selected.
Keywords
data structures; graph theory; parallel algorithms; query processing; distributed query structure; parallel algorithm; parallel random mapping; query data structure; random function; Clustering algorithms; Concrete; Concurrent computing; Cryptography; Data structures; Hard disks; Parallel algorithms; Runtime; State-space methods; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel, Distributed, and Network-Based Processing, 2006. PDP 2006. 14th Euromicro International Conference on
ISSN
1066-6192
Print_ISBN
0-7695-2513-X
Type
conf
DOI
10.1109/PDP.2006.10
Filename
1613270
Link To Document