Efficient Algorithms for the Maximum Sum Problems
Algorithm Research Institute, Christchurch 8053, New Zealand
Computer Science and Software Engineering, University of Canterbury, Christchurch 8140, New Zealand
Author to whom correspondence should be addressed.
Academic Editors: Bruno Carpentieri and Spyros Kontogiannis
Received: 9 August 2016 / Revised: 2 December 2016 / Accepted: 26 December 2016 / Published: 4 January 2017
We present efficient sequential and parallel algorithms for the maximum sum (MS) problem, which is to maximize the sum of some shape in the data array. We deal with two MS problems; the maximum subarray (MSA) problem and the maximum convex sum (MCS) problem. In the MSA problem, we find a rectangular part within the given data array that maximizes the sum in it. The MCS problem is to find a convex shape rather than a rectangular shape that maximizes the sum. Thus, MCS is a generalization of MSA. For the MSA problem,
time parallel algorithms are already known on an
2D array of processors. We improve the communication steps from
, which is optimal. For the MCS problem, we achieve the asymptotic time bound of
2D array of processors. We provide rigorous proofs for the correctness of our parallel algorithm based on Hoare logic and also provide some experimental results of our algorithm that are gathered from the Blue Gene/P super computer. Furthermore, we briefly describe how to compute the actual shape of the maximum convex sum.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
Scifeed alert for new publications
Never miss any articles
matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
Define your Scifeed now
Share & Cite This Article
MDPI and ACS Style
Bae, S.E.; Shinn, T.-W.; Takaoka, T. Efficient Algorithms for the Maximum Sum Problems. Algorithms 2017, 10, 5.
Bae SE, Shinn T-W, Takaoka T. Efficient Algorithms for the Maximum Sum Problems. Algorithms. 2017; 10(1):5.
Bae, Sung E.; Shinn, Tong-Wook; Takaoka, Tadao. 2017. "Efficient Algorithms for the Maximum Sum Problems." Algorithms 10, no. 1: 5.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.