Optimizations of data distribution localities in cluster grid environments

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The advent of widely interconnected computing resources introduces the technologies of ubiquitous computing, peer to peer computing and grid computing. In this paper, we present an efficient data distribution scheme for optimizing data localities of SPMD data parallel programs on cluster grid, a typical computational grid environment consists of several clusters located in multiple campuses that distributed globally over the Internet. Because of the Internet infrastructure of cluster grid, the communication overhead becomes as key factor to the performance of parallel applications. Effectiveness of the proposed distribution mechanism is to reduce inter-cluster communication overheads and to speed the execution of data parallel programs in the underlying distributed cluster grid. The theoretical analysis and experimental results show improvement of communication costs and scalable of the proposed techniques on different hierarchical cluster grids. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Hsu, C. H., Chen, S. C., Yang, C. T., & Li, K. C. (2005). Optimizations of data distribution localities in cluster grid environments. In Lecture Notes in Computer Science (Vol. 3483, pp. 1017–1027). Springer Verlag. https://doi.org/10.1007/11424925_106

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free