You are here

USING A SUPERPROCESS TO ACCELERATE CONVERSATIONS FOR FAULT-TOLERANT CONCURRENT SOFTWARE

Download pdf | Full Screen View

Date Issued:
1987
Summary:
Since computer systems are applied to many critical areas, fault-tolerance is a necessary requirement for their operation. Many techniques for dealing with hardware faults have been developed. Fault-tolerant software has had a much slower progress. Concurrent software adds an additional dimension to the problem of fault-tolerant software. This thesis uses an intermediate structure between two major schemes, conversation and programmer transparent coordination. The scheme proposed here accelerates conversations by using a special process or superprocess, which is executed on the same system level as the run-time system, and that by having access to the history of all interprocess communications can allow a process that passes its acceptance test to proceed conditionally. If the process does not pass its acceptance test all processes recover immediately without waiting to get to their acceptance tests. This work presents a set of algorithms to implement these ideas.
Title: USING A SUPERPROCESS TO ACCELERATE CONVERSATIONS FOR FAULT-TOLERANT CONCURRENT SOFTWARE.
55 views
17 downloads
Name(s): GAO, LIXIN.
Florida Atlantic University, Degree grantor
Fernandez, Eduardo B., Thesis advisor
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Issuance: monographic
Date Issued: 1987
Publisher: Florida Atlantic University
Place of Publication: Boca Raton, Fla.
Physical Form: application/pdf
Extent: 64 p.
Language(s): English
Summary: Since computer systems are applied to many critical areas, fault-tolerance is a necessary requirement for their operation. Many techniques for dealing with hardware faults have been developed. Fault-tolerant software has had a much slower progress. Concurrent software adds an additional dimension to the problem of fault-tolerant software. This thesis uses an intermediate structure between two major schemes, conversation and programmer transparent coordination. The scheme proposed here accelerates conversations by using a special process or superprocess, which is executed on the same system level as the run-time system, and that by having access to the history of all interprocess communications can allow a process that passes its acceptance test to proceed conditionally. If the process does not pass its acceptance test all processes recover immediately without waiting to get to their acceptance tests. This work presents a set of algorithms to implement these ideas.
Identifier: 14398 (digitool), FADT14398 (IID), fau:11199 (fedora)
Collection: FAU Electronic Theses and Dissertations Collection
Note(s): College of Engineering and Computer Science
Thesis (M.S.)--Florida Atlantic University, 1987.
Subject(s): Fault-tolerant computing
Held by: Florida Atlantic University Libraries
Persistent Link to This Record: http://purl.flvc.org/fcla/dt/14398
Sublocation: Digital Library
Use and Reproduction: Copyright © is held by the author, with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Host Institution: FAU
Is Part of Series: Florida Atlantic University Digital Library Collections.