In scientific cloud workflows, large amounts of application data need to be stored in distributed data centres. To effectively store these data, a data manager must intelligently select data centres in which these data will reside. This is, however, not the case for data which must have a fixed location. When one task needs several datasets located in different data centres, the movement of large volumes of data becomes a challenge. In this paper, we propose a matrix based k-means clustering strategy for data placement in scientific cloud workflows. The strategy contains two algorithms that group the existing datasets in k data centres during the workflow build-time stage, and dynamically clusters newly generated datasets to the most appropriate data centres -based on dependencies -during the runtime stage. Simulations show that our algorithm can effectively reduce data movement during the workflow's execution.
al. proposed a matrix based k-means clustering strategy for data placement in scientific cloud work flows REF .
A data placement strategy in scientific cloud workflows
Future Gener. Comput. Syst.
Future Gener. Comput. Syst.
Computer Science