并行计算执行时间的随机边界

F. L. Presti, M. Colajanni, Salvatore Tucci
{"title":"并行计算执行时间的随机边界","authors":"F. L. Presti, M. Colajanni, Salvatore Tucci","doi":"10.1109/MASCOT.1994.284380","DOIUrl":null,"url":null,"abstract":"We obtain stochastic bounds on execution times of parallel computations assuming ideal conditions for shared resources. A parallel computation is modelled as a task system with precedence constraints expressed as a directed acyclic graph (DAG). The task execution times are assumed independent random variables. The performance measure considered is the overall execution time of the computation. To obtain upper bounds on this measure, we apply stochastic ordering and stochastic comparison techniques.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Stochastic bounds on execution times of parallel computations\",\"authors\":\"F. L. Presti, M. Colajanni, Salvatore Tucci\",\"doi\":\"10.1109/MASCOT.1994.284380\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We obtain stochastic bounds on execution times of parallel computations assuming ideal conditions for shared resources. A parallel computation is modelled as a task system with precedence constraints expressed as a directed acyclic graph (DAG). The task execution times are assumed independent random variables. The performance measure considered is the overall execution time of the computation. To obtain upper bounds on this measure, we apply stochastic ordering and stochastic comparison techniques.<<ETX>>\",\"PeriodicalId\":288344,\"journal\":{\"name\":\"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.1994.284380\",\"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 International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.1994.284380","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在资源共享的理想条件下,我们得到了并行计算执行时间的随机边界。将并行计算建模为优先约束表示为有向无环图(DAG)的任务系统。假设任务执行时间为独立的随机变量。考虑的性能度量是计算的总体执行时间。为了得到这个测度的上界,我们应用了随机排序和随机比较技术。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stochastic bounds on execution times of parallel computations
We obtain stochastic bounds on execution times of parallel computations assuming ideal conditions for shared resources. A parallel computation is modelled as a task system with precedence constraints expressed as a directed acyclic graph (DAG). The task execution times are assumed independent random variables. The performance measure considered is the overall execution time of the computation. To obtain upper bounds on this measure, we apply stochastic ordering and stochastic comparison techniques.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信