This thesis is a study of communication protocols (token ring, FDDI, and ISDN), microcontrollers (68HC 1EVB), and fault tolerance schemes. One of the major weaknesses of the token ring network is that if a single station fails, the entire system fails. A scheme involving a combination of hardware and timer interrupts in the software has been designed and implemented which deals with this risk. Software and protocols have been designed and applied to the network to reduce the chance of bit faults in communications. ISDN frame format proved to be exceptional in its capacity to carry echoed data and a large variety of tokens which could be used by the stations to test the data. By its very nature, the token ring supplied another major fault detection device by allowing the data to be returned and tested at its source. The resulting network was successful.

Thesis (Ph. D.)--Washington State University, December 2007. / Includes bibliographical references (p. 74-80).

Graduation date: 1993

This thesis studies and compares existing Numerical Result checking algorithms for FFT computations under faults. In order to simulate faulty conditions, a fault injection tool is implemented. The fault injection tool is designed so as to be as non-intrusive to the application as possible. Faults are injected into memory in the form of bit flips in the data elements of the application. The performance of the three result checking algorithms under these conditions is studied and compared. Faults are injected at all the stages of the FFT computation by flipping each of the 64-bits in the double-precision representation. Experiments also include introducing random bit flips in the data array, emulating a more real-life like scenario. Finally the performance of these algorithms under a set of worst-case is also studied

Zugl.: @Chemnitz, Techn. Univ., Diss.

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 131-144). Available also in a digital version from Dissertation Abstracts.

Thesis (M.S. in Information Technology Management and M.S. in Computer Science)--Naval Postgraduate School, September 2003. / Thesis advisor(s): Geoffrey Xie, Alex Bordetsky. Includes bibliographical references (p. 47-48). Also available online.

Thesis (M.S.)--Mississippi State University. Department of Computer Science. / Title from title screen. Includes bibliographical references.

Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Includes vita. Includes bibliographical references.

This thesis discusses techniques for improving the fault tolerance of multithreaded applications. We consider the impact on fault tolerance methods of sharing address space and resources. We develop techniques in two broad categories: conservative multithreaded fault-tolerance (C-MTFT), which recovers an entire application on the failure of a single thread, and optimistic multithreaded fault-tolerance (OMTFT), which recovers threads independently as necessary. In the latter category, we provide a novel approach to recover hung threads while improving recovery time by managing access to shared resources so that hung threads can be restarted while other threads continue execution. / text