Welcome to the InfoSci Platform
Combination of Scheduling and Dynamic Data Replication for Cloud Computing Workflows

Combination of Scheduling and Dynamic Data Replication for Cloud Computing Workflows

Kouidri Siham, Yagoubi Belabbas
Copyright: © 2019 |Volume: 9 |Issue: 4 |Pages: 13
ISSN: 2155-6377|EISSN: 2155-6385|EISBN13: 9781522567172|DOI: 10.4018/IJIRR.2019100103
Cite Article Cite Article

MLA

Siham, Kouidri, and Yagoubi Belabbas. "Combination of Scheduling and Dynamic Data Replication for Cloud Computing Workflows." IJIRR vol.9, no.4 2019: pp.23-35. http://doi.org/10.4018/IJIRR.2019100103

APA

Siham, K. & Belabbas, Y. (2019). Combination of Scheduling and Dynamic Data Replication for Cloud Computing Workflows. International Journal of Information Retrieval Research (IJIRR), 9(4), 23-35. http://doi.org/10.4018/IJIRR.2019100103

Chicago

Siham, Kouidri, and Yagoubi Belabbas. "Combination of Scheduling and Dynamic Data Replication for Cloud Computing Workflows," International Journal of Information Retrieval Research (IJIRR) 9, no.4: 23-35. http://doi.org/10.4018/IJIRR.2019100103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Cloud computing is a powerful and high-capacity system, because it can satisfy various demands and share resources for users. It also to benefits from a capacity for treatment and unlimited storage. However, it is burdensome for the providers of internet services that the user demands are increasing as computer capacity is growing stronger and stronger. Therefore, the techniques of workflow scheduling and data replication are used to decrease the costs of the data intensive application. Unfortunately, these two approaches, which are very complementary, are used separately. In this article, a combination of workflow scheduling based on the clustering of data and dynamic data replication strategies has been introduced together. A Cloud simulator, Cloudsim, is used to evaluate the performance of the proposed algorithm. Simulation results show the effectiveness of the proposed algorithm in comparison with well-known algorithms such as random data placement and the Build Time algorithm.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.