检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Shuai-Bing Lu Jie Wu Huan-Yang Zheng Zhi-Yi Fang
机构地区:[1]College of Computer Science and Technology,Jilin University,Changchun 13012,China [2]Department of Computer and Information Sciences,Temple University,Philadelphia,PA19122,U.S.A.
出 处:《Journal of Computer Science & Technology》2019年第1期185-206,共22页计算机科学技术学报(英文版)
基 金:the National Science Foundation (NSF)of United States under Grant Nos.CNS 1757533, CNS 1629746,CNS 1564128,CNS 1449860,CNS 1461932,CNS 1460971,IIP 1439672,and CSC 20163100.
摘 要:With the growing popularity of cloud-based data center networks (DCNs),task resource allocation has become more and more important to the efficient use of resource in DCNs.This paper considers provisioning the maximum admissible load (MAL)of virtual machines (VMs)in physical machines (PMs)with underlying tree-structured DCNs using the hose model for communication.The limitation of static load distribution is that it assigns tasks to nodes in a once-and-for-all manner,and thus requires a priori knowledge of program behavior.To avoid load redistribution during runtime when the load grows,we introduce maximum elasticity scheduling,which has the maximum growth potential subject to the node and link capacities.This paper aims to find the schedule with the maximum elasticity across nodes and links.We first propose a distributed linear solution based on message passing,and we discuss several properties and extensions of the model.Based on the assumptions and conclusions,we extend it to the multiple paths case with a fat tree DCN,and discuss the optimal solution for computing the MAL with both computation and communication constraints.After that,we present the provision scheme with the maximum elasticity for the VMs,which comes with provable optimality guarantee for a fixed flow scheduling strategy in a fat tree DCN.We conduct the evaluations on our testbed and present various simulation results by comparing the proposed maximum elastic scheduling schemes with other methods.Extensive simulations validate the effectiveness of the proposed policies,and the results are shown from different perspectives to provide solutions based on our research.
关 键 词:data CENTER network (DCN) CLOUD distributed algorithm ELASTICITY HOSE model optimization
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33