数据密集型服务提供的多目标蚁群系统

Lijuan Wang, Jun Shen, Junzhou Luo
{"title":"数据密集型服务提供的多目标蚁群系统","authors":"Lijuan Wang, Jun Shen, Junzhou Luo","doi":"10.1109/.14","DOIUrl":null,"url":null,"abstract":"Data-intensive services have become one of the most challenging applications in cloud computing. The classical service composition problem will face new challenges as the services and correspondent data grow. A typical environment is the large scale scientific project AMS, which we are processing huge amount of data streams. In this paper, we will resolve service composition problem by considering the multi-objective data-intensive features. We propose to apply ant colony optimization algorithms and implemented them with simulated workflows in different scenarios. To evaluate the proposed algorithm, we compared it with a multi-objective genetic algorithm with respect to five performance metrics.","PeriodicalId":281075,"journal":{"name":"International Conference on Parallel and Distributed Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Multi-objective Ant Colony System for Data-Intensive Service Provision\",\"authors\":\"Lijuan Wang, Jun Shen, Junzhou Luo\",\"doi\":\"10.1109/.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data-intensive services have become one of the most challenging applications in cloud computing. The classical service composition problem will face new challenges as the services and correspondent data grow. A typical environment is the large scale scientific project AMS, which we are processing huge amount of data streams. In this paper, we will resolve service composition problem by considering the multi-objective data-intensive features. We propose to apply ant colony optimization algorithms and implemented them with simulated workflows in different scenarios. To evaluate the proposed algorithm, we compared it with a multi-objective genetic algorithm with respect to five performance metrics.\",\"PeriodicalId\":281075,\"journal\":{\"name\":\"International Conference on Parallel and Distributed Systems\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Parallel and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

数据密集型服务已经成为云计算中最具挑战性的应用之一。随着服务和对应数据的增长,传统的服务组合问题将面临新的挑战。一个典型的环境是大型科学项目AMS,我们正在处理大量的数据流。在本文中,我们将通过考虑多目标数据密集型特征来解决服务组合问题。我们提出应用蚁群优化算法,并在不同场景的模拟工作流中实现它们。为了评估所提出的算法,我们将其与多目标遗传算法在五个性能指标方面进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-objective Ant Colony System for Data-Intensive Service Provision
Data-intensive services have become one of the most challenging applications in cloud computing. The classical service composition problem will face new challenges as the services and correspondent data grow. A typical environment is the large scale scientific project AMS, which we are processing huge amount of data streams. In this paper, we will resolve service composition problem by considering the multi-objective data-intensive features. We propose to apply ant colony optimization algorithms and implemented them with simulated workflows in different scenarios. To evaluate the proposed algorithm, we compared it with a multi-objective genetic algorithm with respect to five performance metrics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信