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

Thumbnail image of item number 1 in: 'Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System'.
Thumbnail image of item number 2 in: 'Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System'.
Thumbnail image of item number 3 in: 'Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System'.
Thumbnail image of item number 4 in: 'Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System'.
Showing 1-4 of 78 pages in this thesis.

PDF Version Also Available for Download.

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 … continued below

Physical Description

vii, 70 leaves : ill.

Creation Information

Pothuru, Surendra August 1994.

Context

This thesis is part of the collection entitled: UNT Theses and Dissertations and was provided by the UNT Libraries to the UNT Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 106 times. More information about this thesis can be viewed below.

Who

People and organizations associated with either the creation of this thesis or its content.

Author

Chair

Committee Members

Publisher

Rights Holder

For guidance see Citations, Rights, Re-Use.

  • Pothuru, Surendra

Provided By

UNT Libraries

The UNT Libraries serve the university and community by providing access to physical and online collections, fostering information literacy, supporting academic research, and much, much more.

About | Browse this Partner

Contact Us

Corrections Questions

What

Descriptive information to help identify this thesis. Follow the links below to find similar items on the Digital Library.

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.

Physical Description

vii, 70 leaves : ill.

Language

Item Type

Identifier

Unique identifying numbers for this thesis in the Digital Library or other systems.

Collections

This thesis is part of the following collection of related materials.

UNT Theses and Dissertations

Theses and dissertations represent a wealth of scholarly and artistic content created by masters and doctoral students in the degree-seeking process. Some ETDs in this collection are restricted to use by the UNT community.

About | Browse this Collection

What responsibilities do I have when using this thesis?

Digital Files

When

Dates and time periods associated with this thesis.

Creation Date

  • August 1994

Added to The UNT Digital Library

  • March 26, 2014, 9:30 a.m.

Description Last Updated

  • May 13, 2015, 8:20 a.m.

Usage Statistics

When was this thesis last used?

Yesterday: 0
Past 30 days: 2
Total Uses: 106
More Statistics

Interact With This Thesis

Here are some suggestions for what to do next.

Start Reading

Thumbnail image of item number 1 in: 'Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System'.
Thumbnail image of item number 2 in: 'Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System'.
Thumbnail image of item number 3 in: 'Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System'.
Thumbnail image of item number 4 in: 'Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System'.

PDF Version Also Available for Download.

Citations, Rights, Re-Use

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Links for Robots

Helpful links in machine-readable formats.

Archival Resource Key (ARK)

International Image Interoperability Framework (IIIF)

Metadata Formats

Images

URLs

Stats

Pothuru, Surendra. Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System, thesis, August 1994; Denton, Texas. (https://digital.library.unt.edu/ark:/67531/metadc278833/: accessed April 19, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; .

Back to Top of Screen