A Distributed Query Structure to Explore Random Mappings in Parallel

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Jan Heichler Articles by Jorg Keller

14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)

Montb?liard-Sochaux, France

February 15-February 17

ISBN: 0-7695-2513-X

	ASCII Text	x
	Jan Heichler, Jorg Keller, "A Distributed Query Structure to Explore Random Mappings in Parallel," Parallel, Distributed, and Network-Based Processing, Euromicro Conference on, pp. 173-177, 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06), 2006.

	BibTex	x
	@article{ 10.1109/PDP.2006.10, author = {Jan Heichler and Jorg Keller}, title = {A Distributed Query Structure to Explore Random Mappings in Parallel}, journal ={Parallel, Distributed, and Network-Based Processing, Euromicro Conference on}, volume = {0}, year = {2006}, issn = {1066-6192}, pages = {173-177}, doi = {http://doi.ieeecomputersociety.org/10.1109/PDP.2006.10}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on TI - A Distributed Query Structure to Explore Random Mappings in Parallel SN - 1066-6192 SP173 EP177 A1 - Jan Heichler, A1 - Jorg Keller, PY - 2006 KW - null VL - 0 JA - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on ER -

Jan Heichler, Martin-Luther-Universitat Halle-Wittenberg, Germany

Jorg Keller, FernUniversitat in Hagen LG Parallelit?at und VLSI

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDP.2006.10

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.

Citation:

Jan Heichler, Jorg Keller, "A Distributed Query Structure to Explore Random Mappings in Parallel," pdp, pp.173-177, 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06), 2006

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.