A Simulation Study of Data Partitioning Algorithms for Multiple Clusters

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.

[1]  Yongchang Ji,et al.  A model-based parallel origin and orientation refinement algorithm for cryoTEM and its application to the study of virus structures. , 2006, Journal of structural biology.

[2]  Helen D. Karatza.  A simulation-based performance analysis of gang scheduling in a distributed system , 1999, Proceedings 32nd Annual Simulation Symposium.

[3]  Dror G. Feitelson,et al.  Improved Utilization and Responsiveness with Gang Scheduling , 1997, JSSPP.

[4]  Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2007), 14-17 May 2007, Rio de Janeiro, Brazil , 2007, CCGRID.

[5]  Kenichi Hagihara,et al.  Near-optimal dynamic task scheduling of independent coarse-grained tasks onto a computational grid , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..

[6]  Ladislau Bölöni,et al.  Coordination in Intelligent Grid Environments , 2005, Proceedings of the IEEE.

[7]  Jarek Nabrzyski,et al.  Dynamic grid scheduling with job migration and rescheduling in the GridLab resource management system , 2004, Sci. Program..

[8]  Patrick Sobalvarro,et al.  Demand-Based Coscheduling of Parallel Jobs on Multiprogrammed Multiprocessors , 1995, JSSPP.

[9]  Sung-Chun Kim,et al.  Task Scheduling Algorithm in GRID Considering Heterogeneous Environment , 2004, PDPTA.

[10]  Dan C. Marinescu,et al.  Models and Algorithms for Coscheduling Compute-Intensive Tasks on a Network of Workstations , 1992, J. Parallel Distributed Comput..