首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Scheduling for Workflows with Security-Sensitive Intermediate Data by Selective Tasks Duplication in Clouds
【24h】

Scheduling for Workflows with Security-Sensitive Intermediate Data by Selective Tasks Duplication in Clouds

机译:通过云中的选择性任务复制,使用安全敏感的中间数据调度工作流

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

摘要

With the wide deployment of cloud computing in many business enterprises as well as science and engineering domains, high quality security services are increasingly critical for processing workflow applications with sensitive intermediate data. Unfortunately, most existing worklfow scheduling approaches disregard the security requirements of the intermediate data produced by workflows, and overlook the performance impact of encryption time of intermediate data on the start of subsequent workflow tasks. Furthermore, the idle time slots on resources, resulting from data dependencies among workflow tasks, have not been adequately exploited to mitigate the impact of data encryption time on workflows’ makespans and monetary cost. To address these issues, this paper presents a novel task-scheduling framework for security sensitive workflows with three novel features. First, we provide comprehensive theoretical analyses on how selectively duplicating a task’s predecessor tasks is helpful for preventing both the data transmission time and encryption time from delaying task’s start time. Then, we define workflow tasks’ latest finish time, and prove that tasks can be completed before tasks’ latest finish time by using cheapest resources to reduce monetary cost without delaying tasks’ successors’ start time and workflows’ makespans. Based on these analyses, we devise a novel scheduling appro ach with selective tasks duplication, named SOLID, incorporating two important phases: 1) task scheduling with selectively duplicating predecessor tasks to idle time slots on resources; and 2) intermediate data encrypting by effectively exploiting tasks’ laxity time. We evaluate our solution approach through rigorous performance evaluation study using both randomly generated workflows and some real-world workflow traces. Our results show that the proposed SOLID approach prevails over existing algorithms in terms of makespan, monetary costs and resource efficiency.
机译:随着云计算在许多企业以及科学和工程领域中的广泛部署,高质量的安全服务对于处理具有敏感中间数据的工作流应用程序越来越重要。不幸的是,大多数现有的工作流调度方法都忽略了工作流产生的中间数据的安全性要求,并且忽略了中间数据加密时间对后续工作流任务开始的性能影响。此外,由于工作流任务之间的数据依赖性而导致的资源空闲时隙尚未得到充分利用,以减轻数据加密时间对工作流的制造时间和金钱成本的影响。为了解决这些问题,本文提出了一种针对具有安全性的工作流的新颖的任务调度框架,具有三个新颖的功能。首先,我们提供全面的理论分析,以了解选择性地复制任务的前任任务如何有助于防止数据传输时间和加密时间延迟任务的开始时间。然后,我们定义工作流程任务的最新完成时间,并证明可以使用最便宜的资源减少金钱成本,而不会延迟任务的后继启动时间和工作流程的完成时间,从而可以在任务的最新完成时间之前完成任务。基于这些分析,我们设计了一种具有选择性任务复制功能的新型调度方法,称为SOLID,其中包括两个重要阶段:1)任务调度,选择性地将前任任务复制到资源上的空闲时隙;和2)通过有效利用任务的松弛时间来对中间数据进行加密。我们使用随机生成的工作流和一些实际的工作流跟踪,通过严格的性能评估研究来评估我们的解决方案方法。我们的结果表明,在制造时间,资金成本和资源效率方面,所提出的SOLID方法优于现有算法。

著录项

  • 来源
  • 作者单位

    College of Information System and Management, National University of Defense Technology, Changsha, Hunan, P. R. China;

    College of Information System and Management, National University of Defense Technology, Changsha, Hunan, P. R. China;

    College of Information System and Management, National University of Defense Technology, Changsha, Hunan, P. R. China;

    College of Computing, Georgia Institute of Technology, 266 Ferst Drive, Atlanta, GA;

    Department of Computer Science and Technology, Tsinghua University, Beijing, China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Cloud computing; Encryption; Scheduling algorithms; Solids;

    机译:云计算;加密;调度算法;实体;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号