Logo image
Software Development for Graph Representation and Fault Tolerant Message Routing Simulations
Thesis

Software Development for Graph Representation and Fault Tolerant Message Routing Simulations

Ray-Far Huang
University of Iowa
Master of Science (MS), University of Iowa
Spring 1984
pdf
t1984_huang_project-oDownloadView
Open Access Free to read and download

Abstract

The purpose of the project is to develop a software tool which provides several ways for a user to construct or modify a multiprocessor network graph and to evaluate the robustness of its interconnection scheme and routing protocol by performing fault tolerant message routing simulations upon the established graph. The user may choose to run the simulations with or without randomly generated faulty nodes or links. The parameters measured in the dynamic simulations are: average routing distance, worst-case routing distance, and worst-case message density.

The C language implemented on a M68000-based microcomputer with the UNIX operating system was used to develop the software system. The maximum capacity of a graph is 512 nodes and 4608 links.

Details

Metrics

1 Record Views
Logo image