An efficient fault tolerant distributed shortest path program in ADA

Simple item page
dc.contributor.advisorLee, Pen-Nan
dc.contributor.committeeMemberHuang, Stephen S. H.
dc.contributor.committeeMemberWu, Tiee-Jian
dc.creatorMalik, Camron
dc.date.accessioned2024-04-22T20:17:39Z
dc.date.available2024-04-22T20:17:39Z
dc.date.issued1987
dc.description.abstractA simple, elegant algorithm upon implementation presents innumerable problems. This paper provides insight into the difficulties of implementing a distributed algorithm. This is followed by an efficient, fault tolerant implementation of the Distributed Shortest Path Algorithm. The provision of fault tolerance has a large overhead in terms of the number of messages required. A modification of the algorithm is proposed to reduce the number of messages, using buffering in conjunction with Ada constructs to achieve this in the implementation. The unrestricted communication in a distributed system produces situations conducive to deadlock. This is particularly true if a synchronous form of message passing is used, as processes will wait indefinitely for each other. To ensure freedom from deadlock a variant of nondeterministic message sending based on Ada timed out entry calls is used. Distributed programs are also, by virtue of their complexity, difficult to verify. Even after extensive testing residual design inadequacies may be present Thus the concept of Communication Closed Layers is used to design the program. The Consensus-Global Tester is used to implement error detection and assist in error recovery. In the event of an error, a Backward error recovery scheme is used which saves the essential information. Thus, computation can be reinitiated using the saved values.
dc.description.departmentComputer Science, Department of
dc.format.digitalOriginreformatted digital
dc.format.mimetypeapplication/pdf
dc.identifier.other18434064
dc.identifier.urihttps://hdl.handle.net/10657/17031
dc.language.isoen
dc.rightsThis item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. Section 107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder.
dc.subjectFault-tolerant computing
dc.subjectAda (Computer program language)
dc.titleAn efficient fault tolerant distributed shortest path program in ADA
dc.type.dcmiText
dc.type.genreThesis
thesis.degree.collegeCollege of Natural Sciences and Mathematics
thesis.degree.departmentComputer Science, Department of
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Houston
thesis.degree.levelMasters
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Malik_1987_18434064.pdf
Size:
2.54 MB
Format:
Adobe Portable Document Format
Download

Collections

Legacy Theses and Dissertations (1940-2009)