Skip to main navigation Skip to search Skip to main content

Load sequencing for a parallel processing utility

  • Stony Brook University

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

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 languageEnglish
Pages (from-to)29-35
Number of pages7
JournalJournal of Parallel and Distributed Computing
Volume64
Issue number1
DOIs
StatePublished - 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