Back to search

University of North Texas

Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System

Abstract

dc:description

The primary purpose of this work is to study, implement and analyze the performance of parallel algorithms related to subsequence problems. The problems include string to string correction problem, to determine the longest common subsequence problem and solving the sum-range-product, 1 —D pattern matching, longest non-decreasing (non-increasing) (LNS) and maximum positive subsequence (MPS) problems. The work also includes studying the techniques and issues involved in developing parallel applications. These algorithms are implemented on the Sequent Multiprocessor System. The subsequence problems have been defined, along with performance metrics that are utilized. The sequential and parallel algorithms have been summarized. The implementation issues which arise in the process of developing parallel applications have been identified and studied.

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
1994

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Pothuru, Surendra
Contributors dc:contributor
  • Das, Sajal K.
  • Shahrokhi, Farhad M.
  • Yang, Chao-Chih

Subjects

dc:subject × 6

Rights

dc:rights
Statement dc:rights
  • Public
  • Copyright
  • Copyright is held by the author, unless otherwise noted. All rights reserved.
  • Pothuru, Surendra
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
call-no: 379 N81 no.7061
untcat: b1826903
local-cont-no: 1002726491-pothuru
ark: ark:/67531/metadc278833

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Pothuru, Surendra. Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System. University of North Texas, 1994. https://digital.library.unt.edu/ark:/67531/metadc278833/