网格环境下计算的最优节点数

L. Muttoni, G. Casale, F. Granata, S. Zanero
{"title":"网格环境下计算的最优节点数","authors":"L. Muttoni, G. Casale, F. Granata, S. Zanero","doi":"10.1109/EMPDP.2004.1271457","DOIUrl":null,"url":null,"abstract":"We show that there exists an optimal number of nodes to be assigned to jobs for execution in grid systems, which depends on the distributions of computation and communication service times. We also show that the analytical models proposed for parallel computers are not accurate for grid systems. We therefore extend to grid environment the definitions of speedup, efficiency and efficacy that are usually given for parallel systems. We also adopt a queueing network model with three different types of workload to prove that in every case an optimal number of nodes exists and that the mean value of CPU and communication service times is just a scale factor for this optimum.","PeriodicalId":105726,"journal":{"name":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Optimal number of nodes for computation in grid environments\",\"authors\":\"L. Muttoni, G. Casale, F. Granata, S. Zanero\",\"doi\":\"10.1109/EMPDP.2004.1271457\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that there exists an optimal number of nodes to be assigned to jobs for execution in grid systems, which depends on the distributions of computation and communication service times. We also show that the analytical models proposed for parallel computers are not accurate for grid systems. We therefore extend to grid environment the definitions of speedup, efficiency and efficacy that are usually given for parallel systems. We also adopt a queueing network model with three different types of workload to prove that in every case an optimal number of nodes exists and that the mean value of CPU and communication service times is just a scale factor for this optimum.\",\"PeriodicalId\":105726,\"journal\":{\"name\":\"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMPDP.2004.1271457\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMPDP.2004.1271457","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

我们证明在网格系统中存在分配给任务执行的最优节点数量,这取决于计算和通信服务时间的分布。我们还表明,为并行计算机提出的分析模型对于网格系统是不准确的。因此,我们将通常用于并行系统的加速、效率和功效的定义扩展到网格环境。我们还采用了具有三种不同工作负载类型的排队网络模型,以证明在每种情况下都存在最优节点数,并且CPU和通信服务时间的平均值只是该最优的一个比例因子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal number of nodes for computation in grid environments
We show that there exists an optimal number of nodes to be assigned to jobs for execution in grid systems, which depends on the distributions of computation and communication service times. We also show that the analytical models proposed for parallel computers are not accurate for grid systems. We therefore extend to grid environment the definitions of speedup, efficiency and efficacy that are usually given for parallel systems. We also adopt a queueing network model with three different types of workload to prove that in every case an optimal number of nodes exists and that the mean value of CPU and communication service times is just a scale factor for this optimum.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast dependence analysis in a multimedia vectorizing compiler Empirical characterization of the latency of long asynchronous pipelines with data-dependent module delays Parallelization and comparison of 3D iterative reconstruction algorithms Efficient monitoring to detect wireless channel failures for MPI programs Exporting processing power of home embedded devices to global computing applications
×
引用
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