In view of the issue concerns multiple Directed acyclic graphs (DAGs) scheduling in multi-tenant cloud computing environment, a scheduling strategy that integrate security and availability is proposed to satisfy the tenants’ requirements for resource security and availability, as thus it can not only protect the users’ privacy and data security but also advance the success rate. The proposal assesses resource reputation to ensure jobs can be scheduled onto relatively security nodes; during task scheduling, it classifies the DAGs to achieve fairness; in the process of resources allocation, the objective function would maximize the user's security satisfaction and minimize the deviation of availability; meanwhile, it takes advantage of “time chips” flexibly to promote resource utilization rate; afterwards, we present a Greedy algorithm integrating with security and availability (GISA) to implement the strategy. The experimental results show the correctness and superior of the novel strategy.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2015) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: