.png){kind=icon}
Return
Load sequencing for a parallel processing utility
.png){kind=icon}
PRE
AI
DOI：10.1016/S0743-7315(03)00113-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The monetary cost optimization of a computer utility load distribution problem is examined. The problem is to find the sequence in which to distribute divisible computing load from a root processor to its children processors which achieves the lowest monetary distribution cost. The convergence performance of a heuristic greedy algorithm is studied. This problem is directly relevant to computer utilities which offer computing and software hosting to organizations for a monetary charge. (C) 2003 Elsevier Inc. All rights reserved.
Keywords:
computer utility
divisible load
economics
heuristic algorithm
single-level tree network
software leasing
star network
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
Examining the Dimensions of Travel Behavior: A Case of Chinese Tourists Visiting the United States
PREAI
ShareSaveShareSave
On the Mechanism and Specificity of Soluble, Quinoprotein Glucose Dehydrogenase in the Oxidation of Aldose Sugars.png)
Biochemistry
BiochemistryIF0
PREAI
ShareSave no more
no more