.png){kind=icon}
返回
Optimizing computing costs using divisible load analysis
.png){kind=icon}
OA
AI
DOI：10.1109/71.674315.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found which involves assigning load to processors in nondecreasing order of the cost per load characteristic of each processor. More generally, one can trade cost against solution time. Algorithms are presented to minimize computing cost with an upper bound on solution time acid to minimize solution time with an upper bound on cost. As an example of the use of this type of analysis, the effect of replacing one fast but expensive processor with a number of cheap but slow processors is also discussed. The type of questions investigated here are important for future computer utilities that perform distributed computation for some charge.
Keyword:
bus network
computer utility
cost
divisible load
load sharing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
分享收藏分享收藏Upregulation of Gp96 Correlates with the Radiosensitivity and Five-Year Survival Rate of Nasopharyngeal Carcinoma.png)
ORL
ORLIF0
PREAI
分享收藏
分享收藏
查看更多内容