...
首页> 外文期刊>Cloud Computing, IEEE Transactions on >QoS-Aware Data Replication for Data-Intensive Applications in Cloud Computing Systems
【24h】

QoS-Aware Data Replication for Data-Intensive Applications in Cloud Computing Systems

机译:用于云计算系统中数据密集型应用程序的QoS感知数据复制

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Cloud computing provides scalable computing and storage resources. More and more data-intensive applications are developed in this computing environment. Different applications have different quality-of-service (QoS) requirements. To continuously support the QoS requirement of an application after data corruption, we propose two QoS-aware data replication (QADR) algorithms in cloud computing systems. The first algorithm adopts the intuitive idea of high-QoS first-replication (HQFR) to perform data replication. However, this greedy algorithm cannot minimize the data replication cost and the number of QoS-violated data replicas. To achieve these two minimum objectives, the second algorithm transforms the QADR problem into the well-known minimum-cost maximum-flow (MCMF) problem. By applying the existing MCMF algorithm to solve the QADR problem, the second algorithm can produce the optimal solution to the QADR problem in polynomial time, but it takes more computational time than the first algorithm. Moreover, it is known that a cloud computing system usually has a large number of nodes. We also propose node combination techniques to reduce the possibly large data replication time. Finally, simulation experiments are performed to demonstrate the effectiveness of the proposed algorithms in the data replication and recovery.
机译:云计算提供可扩展的计算和存储资源。在这种计算环境中开发了越来越多的数据密集型应用程序。不同的应用程序具有不同的服务质量(QoS)要求。为了在数据损坏后不断满足应用程序的QoS要求,我们在云计算系统中提出了两种QoS感知数据复制(QADR)算法。第一种算法采用高QoS优先复制(HQFR)的直观思想来执行数据复制。但是,这种贪婪的算法无法使数据复制成本和违反QoS的数据副本的数量最小化。为了实现这两个最低目标,第二种算法将QADR问题转换为众所周知的最小成本最大流量(MCMF)问题。通过应用现有的MCMF算法来解决QADR问题,第二种算法可以在多项式时间内生成QADR问题的最佳解决方案,但是比第一种算法要花更多的计算时间。而且,已知云计算系统通常具有大量节点。我们还提出了节点组合技术,以减少可能的大数据复制时间。最后,进行仿真实验以证明所提出算法在数据复制和恢复中的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号