Improving the Allocation of Communication-Intensive Applications in Clouds Using Time-Related Information

A. Stefano, G. Morana, D. Zito
{"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}
引用次数: 9

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.
利用时间相关信息改进云中通信密集型应用的分配
在云中,通信密集型应用程序的最佳分配是一个众所周知的复杂问题。这类应用程序由于通信对其性能的强烈影响,不仅要求将其任务分配在能够满足其计算需求的资源上,而且要求这些资源之间的距离(就通信延迟或延迟而言)最小。当前使用的分配策略基于资源状态的静态视图,不适合有效地管理这些应用程序的特性。在这项工作中,我们提出了一种创新的分配策略,该策略利用有关其内部交互顺序的信息,改进了通信密集型应用程序在可用资源上的部署。特别是,此策略允许减少执行每个应用程序所需的资源数量,而且非常重要的是,它允许减少每个应用程序对在同一云上运行的其他应用程序的性能的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信