Title
A Simulation Study Of Data Partitioning Algorithms For Multiple Clusters
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. © 2007 IEEE.
Publication Date
9-4-2007
Publication Title
Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007
Number of Pages
259-266
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
DOI Link
https://doi.org/10.1109/CCGRID.2007.13
Copyright Status
Unknown
Socpus ID
34548359172 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/34548359172
STARS Citation
Yu, Chen; Marinescu, Dan C.; Siegel, Howard Jay; and Morrison, John P., "A Simulation Study Of Data Partitioning Algorithms For Multiple Clusters" (2007). Scopus Export 2000s. 6686.
https://stars.library.ucf.edu/scopus2000/6686