This thesis essentially presents the experimental investigation of the fundamental phenomena of electric fuse element disintegration and its causation and influence on the subsequent fragmentation of the fuse elements when subjected to excessive fault currents. The basis of the study involved experimental observation of disintegration of fuse elements and the analysis of the dynamic responses of current-carrying conductors, which precipitate disintegration. The experimental techniques employed utilised commercially available video cameras to capture images of element disruptions during disintegration of fuse elements subjected to low short-circuit and high overload currents. Specialist experimental image capturing techniques and hardware implementations were developed to enable investigation of element disintegration caused by high short-circuit fault currents. Disintegration phenomena of fuse elements for all fault cases were compared within different time domains, which included specialist techniques to investigate disintegration of elements in sand and against glass substrates. Disintegration phenomena of elements in unconfined media such as air and water also constituted the studies. The studies diverged, finally, into experimental observations of the temporal development of arc initiation and extinction phenomena of fault current limiting of HBC fuses using spectroscopic analysis of the arc light radiation. The range of studies covered have led to new understandings of fundamental current limiting behaviour of HBC and open type fuses which contribute, in a small way, to the knowledge base of the subject and hopefully will be an aid to improved designs and development of new types of electric fuse.

The contribution of this dissertation is the development of a completely new and accurate algorithm SFSSE for synchronous fault simulation of sequential circuits. The distinctive difference between SFSSE (Synchronous Fault Simulation by Surrogate with Exceptions) and similar approaches for fault simulation in combinational logic circuits is that SFSSE is capable of handling faults stored in more than one memory elements and the reconvergence over time of the stored fault effect with the original fault. The experimental result shows a significant improvement for SFSSE by comparing its execution time to that of parallel fault simulation. After a stored fault list is established during one clock period, all paths from the output of that memory element to the primary outputs might be blocked in subsequent clock periods. A fault is usually propagated through many paths in various subnetworks over several clock periods, and it is detected when only one of these paths reaches a primary output. A new idea for efficiency is suggested in the last chapter to avoid the unproductive simulation activity. In that approach the waste of simulation time is avoided by overlapping the simulation of multiple clock periods.

As people are becoming increasingly dependent on computerized systems, the need for these systems to be dependable is also increasing. However, programming dependable systems is difficult, especially when parallelism is involved. This is due in part to the fact that very few high-level programming languages support both fault-tolerance and parallel programming. This dissertation addresses this problem by presenting FT-Linda, a high-level language for programming fault-tolerant parallel programs. FT-Linda is based on Linda, a language for programming parallel applications whose most notable feature is a distributed shared memory called tuple space. FT-Linda extends Linda by providing support to allow a program to tolerate failures in the underlying computing platform. The distinguishing features of FT-Linda are stable tuple spaces and atomic execution of multiple tuple space operations. The former is a type of stable storage in which tuple values are guaranteed to persist across failures, while the latter allows collections of tuple operations to be executed in an all-or-nothing fashion despite failures and concurrency. Example FT-Linda programs are given for both dependable systems and parallel applications. The design and implementation of FT-Linda are presented in detail. The key technique used is the replicated state machine approach to constructing fault-tolerant distributed programs. Here, tuple space is replicated to provide failure resilience, and the replicas are sent a message describing the atomic sequence of tuple space operations to perform. This strategy allows an efficient implementation in which only a single multicast message is needed for each atomic sequence of tuple space operations. An implementation of FT-Linda for a network of workstations is also described. FT-Linda is being implemented using Consul, a communication substrate that supports fault-tolerant distributed programming. Consul is built in turn with the x-kernel, an operating system kernel that provides support for composing network protocols. Each of the components of the implementation has been built and tested.

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.