Abstract
Given a positive integer M, and a set S = {x1, x2, ..., xn} of positive integers, the maximum subset sum problem is to find a subset S' of S such that Σxes'x is maximized under the constraint that the summation is no larger than M. In addition, the cardinality of S' is also a maximum among all subsets of S which achieve the maximum subset sum. This problem is known to be NP-hard. We analyze the average-case performance of a simple on-line approximation algorithm assuming that all integers in S are independent and have the same probabilty distribution. We develop a general methodology, i.e., using recurrence relations, to evaluate the expected values of the content and the cardinality of S' for any distribution. The maximum subset sum problem has important applications, especially in static job scheduling in multiprogrammed parallel systems. The algorithm studied can also be easily adapted for dynamic job scheduling in such systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.