An Iteration Aware Multidimensional Data Distribution Prototype for Computing Clusters

Disk and network latency must be taken into account when applying parallel computing to large multidimensional datasets because they can hinder performance by reducing the rate at which data can be fed to the compute nodes. Existing methods aggregate some number of data requests from cluster nodes to improve overall performance by reducing the number of latency penalties. However, an even more significant reduction can be achieved by taking advantage of prior knowledge of the access pattern expressed as an iteration. Within the context of the Granite Scientific Database system, we created a new iteration aware data distribution system that accelerates data transfer between a data server and the client cluster. This system reduces both disk and network latency by transforming a large number of small requests into a small number of large requests that fill an ndimensional cache block on the cluster head node.1

• Type: Conference
• Year: 2006
• Where: CLUSTER
• Authors: Baoqiang Yan, Philip J. Rhodes
• Keywords: CLUSTER 2006, Cluster Computing, Iteration Aware Data, Large Multidimensional Datasets, Network Latency