Towards architecture-adaptable parallel programming Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/s1784q07n

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • There is a software gap in parallel processing. The short lifespan and small installation base of parallel architectures have made it economically infeasible to develop platform-specific parallel programming environments that deliver performance and programmability. One obvious solution is to build architecture-independent programming environments. But the architecture independence usually comes at the expense of performance, since the most efficient parallel algorithm for solving a problem often depends on the target platform. Thus, unless a parallel programming system has the ability to adapt the algorithm to the architecture, it will not be effectively machine-independent. This research develops a new methodology for architecture-adaptable parallel programming. The methodology is built on three key ideas: (1) the use of a database of parameterized algorithmic templates to represent computable functions; (2) frame-based representation of processing environments; and (3) the use of an analytical performance prediction tool for automatic algorithm design. This methodology pursues a problem-oriented approach to parallel processing as opposed to the traditional algorithm-oriented approach. This enables the development of software environments with a high level of abstraction. The users state the problem to be solved using a high-level notation; they are freed from the esoteric tasks of parallel algorithm design and implementation. This methodology has been validated in the format of a prototype of a system capable of automatically generating an efficient parallel program when presented with a well-defined problem and the description of a target platform. The use of object technology has made the system easily extensible. The templates are designed using a parallel adaptation of the well-known divide-and-conquer paradigm. The prototype system has been used to solve several numerical problems efficiently on a wide spectrum of architectures. The target platforms include multicomputers (Thinking Machines CM-5 and Meiko CS-2), networks of workstations (IBM RS/6000s connected by FDDI), multiprocessors (Sequent Symmetry, SGI Power Challenge, and Sun SPARCServer), and a hierarchical system consisting of a cluster of multiprocessors on Myrinet.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome, 8-bit Grayscale) using ScandAll PRO 1.8.1 on a Fi-6670 in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-10-12T16:41:06Z (GMT) No. of bitstreams: 1 KumaranSanthosh1997.pdf: 9709916 bytes, checksum: 3747ecce2380782ed88e04de66573eef (MD5)
  • description.provenance : Made available in DSpace on 2012-10-12T18:37:59Z (GMT). No. of bitstreams: 1 KumaranSanthosh1997.pdf: 9709916 bytes, checksum: 3747ecce2380782ed88e04de66573eef (MD5) Previous issue date: 1996-07-26
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-10-12T18:37:59Z (GMT) No. of bitstreams: 1 KumaranSanthosh1997.pdf: 9709916 bytes, checksum: 3747ecce2380782ed88e04de66573eef (MD5)
  • description.provenance : Submitted by John Valentino (valentjo@onid.orst.edu) on 2012-10-11T17:50:21Z No. of bitstreams: 1 KumaranSanthosh1997.pdf: 9709916 bytes, checksum: 3747ecce2380782ed88e04de66573eef (MD5)

Relationships

In Administrative Set:
Last modified: 08/20/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items