• DocumentCode
    3303707
  • Title

    Cost Performance Analysis in Multi-level Tree Networks

  • Author

    Choi, Kijeung ; Robertazzi, Thomas G.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Stony Brook Univ., Stony Brook, NY, USA
  • fYear
    2010
  • fDate
    7-9 July 2010
  • Firstpage
    41
  • Lastpage
    48
  • Abstract
    A monetary network cost problem involving a homogeneous multi-level tree of processors and links is discussed. The monetary network cost of processing a divisible load, which is linearly dependent on the amount of divisible workload, is basically composed of a communication cost and a computing cost. A monetary network analysis is performed by aggregating the network speed parameters and network cost parameters. This allows one to obtain a closed form solution for the total monetary network cost with maintaining a minimum total parallel processing finish time. Through a mathematical derivation of the ratio of total computing time variation to total network cost variation against changes in network size, insights on trends of network performance against network cost are achieved.
  • Keywords
    Closed-form solution; Computer networks; Cost function; Distributed computing; Mathematical analysis; Parallel processing; Performance analysis; Processor scheduling; cost efficiency; divisible load theory; multi-level tree; network cost;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Computing (ISPDC), 2010 Ninth International Symposium on
  • Conference_Location
    Istanbul, Turkey
  • Print_ISBN
    978-1-4244-7602-2
  • Type

    conf

  • DOI
    10.1109/ISPDC.2010.34
  • Filename
    5532484