.png){kind=icon}
Return
Optimizing computing costs using divisible load analysis
.png){kind=icon}
OA
AI
DOI：10.1109/71.674315.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
bus network
computer utility
cost
divisible load
load sharing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveShareSaveUpregulation of Gp96 Correlates with the Radiosensitivity and Five-Year Survival Rate of Nasopharyngeal Carcinoma.png)
ORL
ORLIF0
PREAI
ShareSave
ShareSaveShareSave
View more