科学云工作流中基于协作代理的工作流级分布式数据放置策略

Rihab Derouiche, Zaki Brahmi
{"title":"科学云工作流中基于协作代理的工作流级分布式数据放置策略","authors":"Rihab Derouiche, Zaki Brahmi","doi":"10.1145/3423603.3424009","DOIUrl":null,"url":null,"abstract":"Within the Cloud Computing context, the placement of massive data used by scientific workflows environment appears to be costly in terms of energy consumption and data transfer time. Indeed, due to the large size of consumed and generated datasets of scientific workflows tasks, the data placement problem becomes more challenging task. This problem is considered as NP-Hard problem. Ensuring an optimal mapping of data to Cloud Storage Services at a reasonable time turns out to be necessary. Many task-level approaches have been hence proposed while considering shared datasets within individual workflows to reduce data transfer cost, which is not efficient enough for the situation of multiple workflows. In the same perspective, taking into account the fixed datasets still an important issue. In the present paper, cooperative agents and Formal Analysis Concepts (FCA) based-data placement strategy for workflow-level data-intensive workflows is proposed. The proposed approach deals with three main concerns: i) treating multiple workflows simultaneously, ii) considering all types of data, specifically, fixed datasets, and iii) reducing the execution time of the data placement algorithm based on a set of cooperative intelligent agents. Experimental results show that the distribution of the proposed data placement strategy among a set of cooperative agents and the FCA approach can be more cost-effective than its task-level counterpart. Eventually, the proposed strategy proves to reduce the execution time during the execution of the tasks of multiple workflows.","PeriodicalId":387247,"journal":{"name":"Proceedings of the 2nd International Conference on Digital Tools & Uses Congress","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A cooperative agents-based workflow-level distributed data placement strategy for scientific cloud workflows\",\"authors\":\"Rihab Derouiche, Zaki Brahmi\",\"doi\":\"10.1145/3423603.3424009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Within the Cloud Computing context, the placement of massive data used by scientific workflows environment appears to be costly in terms of energy consumption and data transfer time. Indeed, due to the large size of consumed and generated datasets of scientific workflows tasks, the data placement problem becomes more challenging task. This problem is considered as NP-Hard problem. Ensuring an optimal mapping of data to Cloud Storage Services at a reasonable time turns out to be necessary. Many task-level approaches have been hence proposed while considering shared datasets within individual workflows to reduce data transfer cost, which is not efficient enough for the situation of multiple workflows. In the same perspective, taking into account the fixed datasets still an important issue. In the present paper, cooperative agents and Formal Analysis Concepts (FCA) based-data placement strategy for workflow-level data-intensive workflows is proposed. The proposed approach deals with three main concerns: i) treating multiple workflows simultaneously, ii) considering all types of data, specifically, fixed datasets, and iii) reducing the execution time of the data placement algorithm based on a set of cooperative intelligent agents. Experimental results show that the distribution of the proposed data placement strategy among a set of cooperative agents and the FCA approach can be more cost-effective than its task-level counterpart. Eventually, the proposed strategy proves to reduce the execution time during the execution of the tasks of multiple workflows.\",\"PeriodicalId\":387247,\"journal\":{\"name\":\"Proceedings of the 2nd International Conference on Digital Tools & Uses Congress\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2nd International Conference on Digital Tools & Uses Congress\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3423603.3424009\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2nd International Conference on Digital Tools & Uses Congress","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3423603.3424009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在云计算环境中,科学工作流环境使用的大量数据的放置似乎在能耗和数据传输时间方面代价高昂。事实上,由于科学工作流任务消耗和生成的数据集的规模很大,数据放置问题变得更具挑战性。这个问题被认为是NP-Hard问题。在合理的时间确保数据到云存储服务的最佳映射是必要的。因此,人们提出了许多任务级的方法,在单个工作流中考虑共享数据集,以降低数据传输成本,但对于多个工作流的情况,这种方法的效率不够高。从同样的角度来看,考虑固定数据集仍然是一个重要的问题。本文提出了基于合作代理和形式分析概念(FCA)的工作流级数据密集型工作流数据放置策略。提出的方法主要涉及三个方面:1)同时处理多个工作流;2)考虑所有类型的数据,特别是固定数据集;3)基于一组协作智能代理减少数据放置算法的执行时间。实验结果表明,所提出的数据放置策略在一组合作代理之间的分布和FCA方法比其任务级对应方法更具成本效益。最后,本文提出的策略在多个工作流的任务执行过程中减少了执行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A cooperative agents-based workflow-level distributed data placement strategy for scientific cloud workflows
Within the Cloud Computing context, the placement of massive data used by scientific workflows environment appears to be costly in terms of energy consumption and data transfer time. Indeed, due to the large size of consumed and generated datasets of scientific workflows tasks, the data placement problem becomes more challenging task. This problem is considered as NP-Hard problem. Ensuring an optimal mapping of data to Cloud Storage Services at a reasonable time turns out to be necessary. Many task-level approaches have been hence proposed while considering shared datasets within individual workflows to reduce data transfer cost, which is not efficient enough for the situation of multiple workflows. In the same perspective, taking into account the fixed datasets still an important issue. In the present paper, cooperative agents and Formal Analysis Concepts (FCA) based-data placement strategy for workflow-level data-intensive workflows is proposed. The proposed approach deals with three main concerns: i) treating multiple workflows simultaneously, ii) considering all types of data, specifically, fixed datasets, and iii) reducing the execution time of the data placement algorithm based on a set of cooperative intelligent agents. Experimental results show that the distribution of the proposed data placement strategy among a set of cooperative agents and the FCA approach can be more cost-effective than its task-level counterpart. Eventually, the proposed strategy proves to reduce the execution time during the execution of the tasks of multiple workflows.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Foreword to the 1 st "data and digital humanities" conference Machine learning for optimized buildings morphosis Decisional architectures from business intelligence to big data: challenges and opportunities AdRobot From register to digital: a 100-years study of witchhunts around Ac 29
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1