{"title":"互联网数据中心的资源优化分配","authors":"Xiaoyun Zhu, S. Singhal","doi":"10.1109/MASCOT.2001.948854","DOIUrl":null,"url":null,"abstract":"This paper presents a resource model that describes the computing and networking components in a resource sharing environment in an Internet Data Center (IDC), a model for multi-tier applications that need to be deployed in this environment, and an optimization problem for resource assignment aimed at minimizing the communication delay between the servers. A number of techniques are introduced to search for the optimal/suboptimal solutions. These include projection of the solution set, partition of the network and pruning of the search space, and local clustering for large problems. Results are given for two examples to demonstrate the effectiveness of the algorithms.","PeriodicalId":375127,"journal":{"name":"MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Optimal resource assignment in Internet data centers\",\"authors\":\"Xiaoyun Zhu, S. Singhal\",\"doi\":\"10.1109/MASCOT.2001.948854\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a resource model that describes the computing and networking components in a resource sharing environment in an Internet Data Center (IDC), a model for multi-tier applications that need to be deployed in this environment, and an optimization problem for resource assignment aimed at minimizing the communication delay between the servers. A number of techniques are introduced to search for the optimal/suboptimal solutions. These include projection of the solution set, partition of the network and pruning of the search space, and local clustering for large problems. Results are given for two examples to demonstrate the effectiveness of the algorithms.\",\"PeriodicalId\":375127,\"journal\":{\"name\":\"MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.2001.948854\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2001.948854","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal resource assignment in Internet data centers
This paper presents a resource model that describes the computing and networking components in a resource sharing environment in an Internet Data Center (IDC), a model for multi-tier applications that need to be deployed in this environment, and an optimization problem for resource assignment aimed at minimizing the communication delay between the servers. A number of techniques are introduced to search for the optimal/suboptimal solutions. These include projection of the solution set, partition of the network and pruning of the search space, and local clustering for large problems. Results are given for two examples to demonstrate the effectiveness of the algorithms.