A simulation study of data partitioning algorithms for multiple clusters

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

Abstract

Recently we proposed algorithms for concurrent execution on multiple clusters [11]. In this case, data partitioning is done at two levels; first, the data is distributed to a collection of heterogeneous parallel systems with different resources and startup time, then, on each system the data is evenly partitioned to the available nodes. In this paper, we report on a simulation study of the algorithms.

Original languageEnglish
Title of host publicationProceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007
Pages259-266
Number of pages8
DOIs
Publication statusPublished - 2007
Event7th IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007 - Rio de Janeiro, Brazil
Duration: 14 May 200717 May 2007

Publication series

NameProceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007

Conference

Conference7th IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007
Country/TerritoryBrazil
CityRio de Janeiro
Period14/05/0717/05/07

Fingerprint

Dive into the research topics of 'A simulation study of data partitioning algorithms for multiple clusters'. Together they form a unique fingerprint.

Cite this