Programming pearls
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Data structures and algorithm analysis in C++
Data structures and algorithm analysis in C++
On some properties and algorithms for the star and pancake interconnection networks
Journal of Parallel and Distributed Computing
Parallel computing using the prefix problem
Parallel computing using the prefix problem
Fast parallel algorithms for the maximum sum problem
Parallel Computing
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Parallel computation: models and methods
Parallel computation: models and methods
Algorithms for the maximum subarray problem based on matrix multiplication
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Efficient algorithms for k maximum sums
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
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 [image omitted] , which is optimal in view of the [image omitted] lower bound. When [image omitted] , 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 [image omitted] processors, once again, matching the performance of a previous PRAM algorithm.