Towards Optimal Scheduling for Global Computing under Probabilistic, Interval, and Fuzzy Uncertainty, with Potential Applications to Bioinformatics

R. Araiza, M. Taufer, M. Leung
{"title":"Towards Optimal Scheduling for Global Computing under Probabilistic, Interval, and Fuzzy Uncertainty, with Potential Applications to Bioinformatics","authors":"R. Araiza, M. Taufer, M. Leung","doi":"10.1109/NAFIPS.2007.383894","DOIUrl":null,"url":null,"abstract":"In many practical situations, in particular in many bioinformatics problems, the amount of required computations is so huge that the only way to perform these computations in reasonable time is to distribute them between multiple processors. The more processors we engage, the faster the resulting computations; thus, in addition to processor exclusively dedicated to this job, systems often use idle time on other processors. The use of these otherwise engaged processors adds additional uncertainty to computations. How should we schedule the computational tasks so as to achieve the best utilization of the computational resources? Because of the presence of uncertainty, this scheduling problem is very difficult not only to solve but even to formalize (i.e., to describe in precise terms). In this paper, we provide the first steps towards formalizing and solving this scheduling problem.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAFIPS.2007.383894","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In many practical situations, in particular in many bioinformatics problems, the amount of required computations is so huge that the only way to perform these computations in reasonable time is to distribute them between multiple processors. The more processors we engage, the faster the resulting computations; thus, in addition to processor exclusively dedicated to this job, systems often use idle time on other processors. The use of these otherwise engaged processors adds additional uncertainty to computations. How should we schedule the computational tasks so as to achieve the best utilization of the computational resources? Because of the presence of uncertainty, this scheduling problem is very difficult not only to solve but even to formalize (i.e., to describe in precise terms). In this paper, we provide the first steps towards formalizing and solving this scheduling problem.
概率、区间和模糊不确定性下全局计算的最优调度及其在生物信息学中的潜在应用
在许多实际情况下,特别是在许多生物信息学问题中,所需的计算量是如此巨大,以至于在合理的时间内执行这些计算的唯一方法是将它们分配到多个处理器之间。我们使用的处理器越多,计算速度就越快;因此,除了专门用于此任务的处理器之外,系统还经常在其他处理器上使用空闲时间。这些处理器的使用给计算增加了额外的不确定性。我们应该如何安排计算任务,以实现计算资源的最佳利用?由于不确定性的存在,这个调度问题不仅很难解决,甚至很难形式化(即,用精确的术语描述)。在本文中,我们提供了形式化和解决这个调度问题的第一步。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信