Advertisement
Published in:
2010 | OriginalPaper | Chapter
Parallel Longest Increasing Subsequences in Scalable Time and Memory
Authors : Peter Krusche, Alexander Tiskin
Published in: Parallel Processing and Applied Mathematics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The longest increasing subsequence (LIS) problem is a classical problem in theoretical computer science and mathematics. Most existing parallel algorithms for this problem have very restrictive slackness conditions which prevent scalability to large numbers of processors. Other algorithms are scalable, but not work-optimal w.r.t. the fastest sequential algorithm for the LIS problem, which runs in time
O
(
n
log
n
) for
n
numbers in the comparison-based model. In this paper, we propose a new parallel algorithm for the LIS problem. Our algorithm solves the more general problem of semi-local comparison of permutation strings of length
n
in time
O
(
n
1.5
/
p
) on
p
processors, has scalable communication cost of
$O(n/\sqrt{p})$
and is synchronisation-efficient. Furthermore, we achieve scalable memory cost, requiring
$O(n/\sqrt{p})$
of storage on each processor. When applied to LIS computation, this algorithm is superior to previous approaches since computation, communication, and memory costs are all scalable.