{"title":"利用时间相关信息改进云中通信密集型应用的分配","authors":"A. Stefano, G. Morana, D. Zito","doi":"10.1109/ISPDC.2012.18","DOIUrl":null,"url":null,"abstract":"The optimal allocation of Communication-Intensive Applications is a well-know complex issue in Clouds. This kind of applications, due to the strong impact of communications on their performance, requires not only that their tasks are allocated on resources able to satisfy their computational requirements but also that the distance among these resources, in terms of communication delay or latency, is the smallest. The allocation strategies currently used, based on a static vision of resources' status, are not suitable for managing effectively the peculiarities of these applications. In this work we propose an innovative allocation strategy that, using information about the sequence of their internal interactions, improves the deployment of Communication-Intensive Applications on available resources. In particular, this strategy allows reducing the number of resources needed for executing each application and, very important, it allows reducing the influence of each application over the performance of the other ones running on the same cloud.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Improving the Allocation of Communication-Intensive Applications in Clouds Using Time-Related Information\",\"authors\":\"A. Stefano, G. Morana, D. Zito\",\"doi\":\"10.1109/ISPDC.2012.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The optimal allocation of Communication-Intensive Applications is a well-know complex issue in Clouds. This kind of applications, due to the strong impact of communications on their performance, requires not only that their tasks are allocated on resources able to satisfy their computational requirements but also that the distance among these resources, in terms of communication delay or latency, is the smallest. The allocation strategies currently used, based on a static vision of resources' status, are not suitable for managing effectively the peculiarities of these applications. In this work we propose an innovative allocation strategy that, using information about the sequence of their internal interactions, improves the deployment of Communication-Intensive Applications on available resources. In particular, this strategy allows reducing the number of resources needed for executing each application and, very important, it allows reducing the influence of each application over the performance of the other ones running on the same cloud.\",\"PeriodicalId\":287900,\"journal\":{\"name\":\"2012 11th International Symposium on Parallel and Distributed Computing\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 11th International Symposium on Parallel and Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPDC.2012.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 11th International Symposium on Parallel and Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDC.2012.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improving the Allocation of Communication-Intensive Applications in Clouds Using Time-Related Information
The optimal allocation of Communication-Intensive Applications is a well-know complex issue in Clouds. This kind of applications, due to the strong impact of communications on their performance, requires not only that their tasks are allocated on resources able to satisfy their computational requirements but also that the distance among these resources, in terms of communication delay or latency, is the smallest. The allocation strategies currently used, based on a static vision of resources' status, are not suitable for managing effectively the peculiarities of these applications. In this work we propose an innovative allocation strategy that, using information about the sequence of their internal interactions, improves the deployment of Communication-Intensive Applications on available resources. In particular, this strategy allows reducing the number of resources needed for executing each application and, very important, it allows reducing the influence of each application over the performance of the other ones running on the same cloud.