Double Euler trails, transmitting Problem, and Projective Torus Networks

博士 === 國立交通大學 === 資訊科學學系 === 84 === There are three problems, the recognition of double Euler trails in series-parallel networks, transmitting on various network topologies and projective torus networks, which are discussed in the thesis. Recognition of d...

Full description

Bibliographic Details
Main Authors: Tung-Yang Ho, 何東洋
Other Authors: Lih-Hsing Hsu
Format: Others
Language:en_US
Published: 1995
Online Access:http://ndltd.ncl.edu.tw/handle/36760404427907907043
Description
Summary:博士 === 國立交通大學 === 資訊科學學系 === 84 === There are three problems, the recognition of double Euler trails in series-parallel networks, transmitting on various network topologies and projective torus networks, which are discussed in the thesis. Recognition of double Euler trails in series-parallel networks is an important problem in CMOS layout. Finding a double Euler trails in a network is essential for optimizing the layout area of a complementary CMOS functional cell. In interconnection networks, there are several different schemes to broadcast a message from the host computer. Transmitting scheme is one of these schemes. We will discuss the transmitting scheme on various network topologies. We also propose a topology for interconnection networks, called projective torus, arising edge fault tolerance concern for tori.