NP-Completeness of the Divisible Load Scheduling Problem on Heterogeneous Star Platforms with Affine Costs

Arnaud Legrand, Yang Yang and Henri Casanova
CS2005-0818
March 10, 2005

In this paper we prove that the Divisible Load Scheduling (DLS) problem is NP-complete when the underlying distributed computing platform is a heterogeneous star network and when the costs for communicating and computing load chunks are affine functions of the chunk size. While the complexity of the DLS problem was known in the case of linear communication and computation costs (polynomial), or in the case of homogeneous platforms (polynomial), to the best of our knowledge it was still open for heterogeneous platforms with affine cost. We prove NP-completeness by reducing the DLS problem from 2-PARTITION, i.e., partition of a set of integer values into two sets whose sums are equal.


How to view this document


The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego, techreports@cs.ucsd.edu.


[ Search ]


NCSTRL
This server operates at UCSD Computer Science and Engineering.
Send email to webmaster@cs.ucsd.edu