EFFICIENT PARALLEL ALGORITHMS FOR THE LIS AND LCS PROBLEMS ON BSR MODEL USING CONSTANT NUMBER OF SELECTIONS
作者:
JEAN-FRÉDÉRIC MYOUPO,
DAVID SEMÉ,
期刊:
Parallel Algorithms and Applications
(Taylor Available online 2000)
卷期:
Volume 14,
issue 3
页码: 187-202
ISSN:1063-7192
年代: 2000
DOI:10.1080/10637199808947386
出版商: Taylor & Francis Group
关键词: Broadcast;Concurrent read;Concurrent write;Interconnection unit;Parallel algorithm;Parallel random access machine;Reduction; Selection;Longest common subsequence;Longest increasing subsequence
数据来源: Taylor
摘要:
Recently Aklet al. introduced a new model of parallel computation, called BSR (broadcasting with selective reduction) and showed that it is more powerful than any CRCW PRAM and yet requires no more resources for implementation than even EREW PRAM. The model allows constant time solutions to sorting, parallel prefix and other problems. In this paper, we describe constant time solution to the longest common subsequence (LCS) and longest increasing subsequence (LIS) problems using the BSR model. The number of processors used to solve the LCS problem isO(N×M) (whereNandMare the length of the two input sequences). Our BSR solution of the LIS problem needsO(N) processors (whereNis the length of the input sequence). These two solutions use BSR instructions with a constant number of selections. It is an improvement of our former BSR algorithm for the LCS in (Journal of Parallel and Distributed Computing, to appear) which uses 3N+ 3 selections.
点击下载:
PDF (357KB)
返 回