A simulation study of data partitioning algorithms for multiple clusters
Seventh IEEE International Symposium on Cluster Computing and the …, 2007•ieeexplore.ieee.org
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.
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.
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.
ieeexplore.ieee.org
Showing the best result for this search. See all results