Optimizing computing costs using divisible load analysis

  • Sohn J
  • Robertazzi T
  • Luryi S
  • 10

    Readers

    Mendeley users who have this article in their library.
  • 72

    Citations

    Citations of this article.

Abstract

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 and 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

Author-supplied keywords

  • Bus network
  • Computer utility
  • Cost
  • Divisible load
  • Load sharing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Jeeho Sohn

  • Thomas G. Robertazzi

  • Serge Luryi

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free