Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 29-35 |
| Number of pages | 7 |
| Journal | Journal of Parallel and Distributed Computing |
| Volume | 64 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2004 |
Keywords
- Computer utility
- Divisible load
- Economics
- Heuristic algorithm
- Single-level tree network
- Software leasing
- Star network
Fingerprint
Dive into the research topics of 'Load sequencing for a parallel processing utility'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver