辽宁工程技术大学学报（自然科学版）2017，Vol.36Issue(7)：773-779,7.DOI:10.11956/j.issn.1008-0562.2017.07.019
基于完工时间最小化的任务映射和路由方案
Research on task mapping and routing scheme based on makespan minimization in cloud services
摘要
Abstract
The traditional task mapping methods rarely consider the effect of task completion time for the task of routing transmission in cloud services,which leads to the longer makespan of tasks.To solve this problem,this paper studied how to minimize the maximum makespan of all tasks in a duty period by joint optimization of both tasks mapping and routing.It is formulated as an integer programming with quadratic constraints (IPQC) problem and proved as NP-hard problem.To tackle the computational complexity of solving IPQC,a heuristic algorithm with polynomial time is proposed.Simulation experiment results show that the performance of the proposed algorithm is close to the optimal solution and is better than that of current other algorithms significantly.关键词
服务供应/任务映射/完工时间/整数规划/启发式算法/最优解Key words
service provisioning/task mapping/makespan/integer programming/heuristic algorithm/optimal solution分类
信息技术与安全科学引用本文复制引用
葛文庚,张莉华..基于完工时间最小化的任务映射和路由方案[J].辽宁工程技术大学学报（自然科学版）,2017,36(7):773-779,7.基金项目
河南省科技厅发展计划(142102110088) （142102110088）
