Files
Abstract
The goal of this dissertation was to further study the MultiRing network which was first introduced by Arabnia [8]. Novel communication models have been developed that can be used at the high-level to develop programs specifically for use on the MultiRing or at the low-level for routing messages. These models include the pipeline, cube and tree communication models. Existing algorithms developed for various well-known static interconnection networks can be mapped onto the MultiRing using these models. New algorithms for routing operations, namely ring broadcasting, group broadcasting and distributing have be created for use on the MultiRing. These algorithms are based on enabling multiprogramming where multiple programs running together on the same network use disjoint subsets of the MultiRing processors. A novel switch design is introduced which makes it possible for to expand the MultiRing to allow additional processors with minimal cost . It allows existing ring formations to remain intact when expanding the network. This new scaleable digital layout features grouping processors in pairs and building larger switches for modular switching elements. A MultiRing simulator has been created on which programmers can create and test parallel algorithms. All of the MultiRing routines are stored in a header file which must be included in C program. Programmers have access to over 50 functions to use on the MultiRing. The motivation behind this research work was to study various properties of the
MultiRing and incorporate concepts of multiprogramming in all aspects of the design-- from the construction of the switch to the communication strategies used between processors.