Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

PDP
2006
IEEE

favoriteEmaildiscussreport

122views Distributed And Parallel Com...» more PDP 2006»

A Distributed Query Structure to Explore Random Mappings in Parallel

13 years 10 months ago

A Distributed Query Structure to Explore Random Mappings in Parallel

Download pv.fernuni-hagen.de

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 quantiﬁed with parameters. Thus, for concrete cluster systems with concrete parameter values, the best organization can be selected.

Jan Heichler, Jorg Keller

Real-time Traffic

Concrete Cluster Systems | Distributed And Parallel Computing | Hard Disks | PDP 2006 | Query Data Structure |

claim paper

Related Content

» A Model for Distributing and Querying a Data Warehouse on a Computing Grid

» DataParallel Spatial Join Algorithms

» Randomized Optimum Models for Structured Prediction

» A Primer on the Evolution of Equivalence Classes of BayesianNetwork Structures

» Experiments in Parallel Clustering with DBSCAN

» Mapping Algorithms for Multiprocessor Tasks on MultiCore Clusters

» A Molecular QuasiRandom Model of Computations Applied to Evaluate Collective Intelligence

» Efficient and effective link analysis with precomputed salsa maps

» YSmart Yet Another SQLtoMapReduce Translator

Post Info
More Details (n/a)

Added	12 Jun 2010
Updated	12 Jun 2010
Type	Conference
Year	2006
Where	PDP
Authors	Jan Heichler, Jorg Keller

Comments (0)