Co-Scheduling Computational and Networking Resources in E-Science Optical Grids

Mohamed Abouelela, M. El-Darieby
{"title":"Co-Scheduling Computational and Networking Resources in E-Science Optical Grids","authors":"Mohamed Abouelela, M. El-Darieby","doi":"10.1109/GLOCOM.2010.5683835","DOIUrl":null,"url":null,"abstract":"With e-science applications becoming more and more data-intensive, data is generally generated and stored at different locations and can be divided into independent subsets to be analyzed distributed at many compute locations across an optical grid. It is required to achieve an optimal utilization of optical grid resources. This is generally achieved by minimizing application completion time, which is calculated as the sum of times spent for data transmission and analysis. We propose a Genetic Algorithm (GA) based approach that co-schedules computing and networking resources to achieve this objective. The proposed approach defines a schedule of when to transfer what data subsets to which sites at what times in order to minimize data processing time as well as defining the routes to be used for transferring data subsets to minimize data transfer times. Simulation results show the advantages of the proposed approach in both minimizing the maximum application completion time and reducing the overall genetic algorithm execution time.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"73 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2010.5683835","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

With e-science applications becoming more and more data-intensive, data is generally generated and stored at different locations and can be divided into independent subsets to be analyzed distributed at many compute locations across an optical grid. It is required to achieve an optimal utilization of optical grid resources. This is generally achieved by minimizing application completion time, which is calculated as the sum of times spent for data transmission and analysis. We propose a Genetic Algorithm (GA) based approach that co-schedules computing and networking resources to achieve this objective. The proposed approach defines a schedule of when to transfer what data subsets to which sites at what times in order to minimize data processing time as well as defining the routes to be used for transferring data subsets to minimize data transfer times. Simulation results show the advantages of the proposed approach in both minimizing the maximum application completion time and reducing the overall genetic algorithm execution time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
E-Science光网格计算资源和网络资源协同调度
随着电子科学应用变得越来越数据密集,数据通常在不同的位置生成和存储,并且可以划分为独立的子集进行分析,这些子集分布在跨光网格的许多计算位置。需要实现光网格资源的最优利用。这通常是通过最小化应用程序完成时间来实现的,这是通过计算用于数据传输和分析的时间总和来实现的。我们提出了一种基于遗传算法(GA)的方法来共同调度计算和网络资源来实现这一目标。所建议的方法定义了何时在什么时间将什么数据子集传输到哪个站点的时间表,以最小化数据处理时间,并定义了用于传输数据子集的路由,以最小化数据传输时间。仿真结果表明,该方法在最小化应用程序最大完成时间和缩短遗传算法总体执行时间方面具有优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Channel Code Aided Decision-Directed Channel Estimation for MIMO OFDM/SDMA Systems Based on the "Expectation-Conditional Maximization Either" Algorithm Large File Transfers from Space Using Multiple Ground Terminals and Delay-Tolerant Networking Platforms and Software Systems for an Autonomic Internet Multiple-Description Speech Coding Using Speech-Polarity Decomposition On Fairness and Locality in P2P-TV through Large-Scale Measurement Experiment
×
引用
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