A work-optimal CGM algorithm for the LIS problem

Authors:
Garcia Thierry;Myoupo Jean-Frédéric;Semé David
Affiliations:
-;-;-
Venue:
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2001

Citing 0
Cited 2

A CGM algorithm solving the longest increasing subsequence problem

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a work-optimal CGM algorithm that solves the Longest Increasing Subsequence Problem. It can be implemented in the CGM with P processors in O(N2 ÷P) time and O(P) communication steps. It is the first CGM algorithm for this problem and it is work-optimal since the sequential algorithm has a complexity of O(N2).