Finding the maximum subsequence sum on interconnection networks

Abstract

We develop parallel algorithms for the maximum subsequence sum (or maximum sum for short) problem on several interconnection networks. For the 1-D version of the problem, we find an algorithm that computes the maximum sum of N elements on these networks of size p, where p ≤ N, with a running time of , which is optimal in view of the lower bound. When , our algorithm computes the maximum sum in O(log N) time, resulting in an optimal cost of O(N). This result also matches the performance of two previous algorithms that are designed to run on the more powerful PRAM model. Our 1-D maximum sum algorithm can be used to solve the problem of maximum subarray, the 2-D version of the problem. In particular, for the same interconnection networks studied here, our parallel algorithm finds the maximum subarray of an N × N array in time O(log N) with processors, once again, matching the performance of a previous PRAM algorithm.

Keywords:

• Interconnection networks
• Max subsequence sum problem
• Prefix sums
• PRAM

Notes

^¶ [email protected]

Additional information

Notes on contributors

S. G. Akl

¶ ¶ [email protected]