By Topic

An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Seme, D. ; Univ. de Picardie Jules Verne, Amiens ; Youlou, S.

In this paper, we give a parallel algorithm for the longest increasing subsequence problem on a LARPBS, one of the recently proposed parallel model based on optical bus. For a sequence of n integers, we solve the longest increasing subsequence problem in O(k) time using n processors where k is the length of the solution. Then, we give an algorithm for the maximal layers problem that runs in O(k+log(n)) time for a set of n points where k is the number of layers on a n-processor array. To our knowledge, this is the fastest algorithm for that problem.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2007. PDCAT '07. Eighth International Conference on

Date of Conference:

3-6 Dec. 2007