A bridging model for parallel computation
Communications of the ACM
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Towards efficiency and portability: programming with the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers
Journal of Parallel and Distributed Computing
Fully scalable fault-tolerant simulations for BSP and CGM
Journal of Parallel and Distributed Computing
Enumerating longest increasing subsequences and patience sorting
Information Processing Letters
A work-optimal CGM algorithm for the LIS problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
The Science of Programming
An Efficient Parallel Solution for the Longest Increasing Subsequence Problem
ICCI '93 Proceedings of the Fifth International Conference on Computing and Information
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Heaviest Increasing/Common Subsequence Problems
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
A Technique of Algorithm Construction on Sequences
IEEE Transactions on Software Engineering
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
New algorithms for efficient parallel string comparison
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Parallel longest increasing subsequences in scalable time and memory
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
Information Processing Letters
| Hi-index | 0.00 |
In this paper, we consider parallel algorithm for the longest increasing subsequence problem. Although this problem is primitive combinatorial optimization problem, this is not known to be in the class NC or P-complete, that is, no NC algorithm have been proposed for this problem, and there is no proof which shows the problem is P-complete. We present a coarse grained parallel algorithm that solves the Longest Increasing Subsequence Problem shown as a basis for DNA comparison. It can be implemented in the CGM model with P processors in O($N \log_2 {N \over P}$) time and O(P) communication steps for an input sequence of N integers. This algorithm is based on a new optimal and very simple sequential algorithm having a time complexity of O(N log2N).