PERFORMANCE ANALYSIS OF MINIMAL PATH FAULT TOLERANT ROUTING IN NOC

Occurrence of faults in Network on Chip(NoC) is inevitable as the feature size is con-tinuously decreasing and processing elements are increasing in numbers.Faults can be revocable if it is transient.Transient fault may occur inside router,or in the core or in communication wires.Examples of transient faults are overflow of buffers in router,clock skew,cross talk,etc..Revocation of transient faults can be done by retransmission of faulty packets using oblivious or adaptive routing algorithms.Irrevocable faults causes non-functionality of segment and mainly occurs during fabrication process.NoC reliability increases with the efficient routing algorithms,which can handle the maximum faults without deadlock in network.As transient faults are temporary and can be easily revoked using re-transmission of packet,permanent faults require efficient routing to route the packet by bypassing the nonfunctional segments.Thus,our focus is on the analysis of adaptive minimal path fault tolerant routing to handle the permanent faults.Comparative analysis between partial adaptive fault tolerance routing West-First,North-Last,Negative-First,Odd Even,and Minimal path Fault Tolerant routing(MinFT) algorithms with the nodes and links failure is performed using NoC Interconnect RoutinG and Application Modeling simulator(NIRGAM) for the 2D Mesh topology.Result suggests that MinFT ensures data transmission under worst conditions as compared to other adaptive routing algorithms.

Improving landscape Characteristics in Port Said’s El Sallam Garden via Observational and Space Syntax Analysis

This paper provides a comprehensive examination of El Sallam Garden in Port Said City,concentrating on its landscape characteristics and potential for design enhancement.This study looks at how space syntax can be used to assess the impact of a tree planting design’s spatial configuration on an urban park’s visual fields.Trees play an important role in determining the spatial characteristics of an outdoor space.According to space syntax theory,an urban area is a collection of connected spaces that can be represented by a matrix of quantitative properties known as syntactic measures.Computer simulations can be used to measure the quantitative properties of these matrices.This study uses space syntax techniques to assess how tree configurations and garden area which can affect the social structures of small-scale gardens in Port Said.It also looks at how these techniques can be used to predict the social structures of four garden zones in El Sallam Garden.The study includes an observational and space syntax study through comparative analysis of four garden zones in El Sallam garden.The results of the study show that the area and planting configurations of the garden had a significant effect on the syntactic social and visual measures of the urban garden.The conclusions and recommendations can be a useful tool for landscape architects,urban planners,and legislators who want to enhance public areas and encourage social interaction in urban settings.

Application of causality diagram in system safety analysis

Causality Diagram (CD) is a new graphical knowledge representation based on probability theory. The application of this methodology in the safety analysis of the gas explosion in collieries was discussed in this paper, and the Minimal Cut Set, the Minimal Path Set and the Importance were introduced to develop the methodology. These concepts are employed to analyze the influence each event has on the top event ? the gas explosion, so as to find out about the defects of the system and accordingly help to work out the emphasis of the precautionary work and some preventive measures as well. The results of the safety analysis are in accordance with the practical requirements; therefore the preventive measures are certain to work effectively. In brief, according to the research CD is so effective in the safety analysis and the safety assessment that it can be a qualitative and quantitative method to predict the accident as well as offer some effective measures for the investigation, the prevention and the control of the accident.

An improved recursive decomposition algorithm for reliability evaluation of lifeline networks

The seismic reliability evaluation of lifeline networks has received considerable attention and been widely studied. In this paper, on the basis of an original recursive decomposition algorithm, an improved analytical approach to evaluate the seismic reliability of large lifeline systems is presented. The proposed algorithm takes the shortest path from the source to the sink of a network as decomposition policy. Using the Boolean laws of set operation and the probabilistic operation principal, a recursive decomposition process is constructed in which the disjoint minimal path set and the disjoint minimal cut set are simultaneously enumerated. As the result, a probabilistic inequality can be used to provide results that satisfy a prescribed error bound. During the decomposition process, different from the original recursive decomposition algorithm which only removes edges to simplify the network, the proposed algorithm simplifies the network by merging nodes into sources and removing edges. As a result, the proposed algorithm can obtain simpler networks. Moreover, for a network owning s-independent components in its component set, two network reduction techniques are introduced to speed up the proposed algorithm. A series of case studies, including an actual water distribution network and a large urban gas system, are calculated using the proposed algorithm. The results indicate that the proposed algorithm provides a useful probabilistic analysis method for the seismic reliability evaluation of lifeline networks.

On the Tractability of Shortest Path Problems in Weighted Edge-Coloured Graphs

A weighted edge-coloured graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such a graph paths are compared by their total weight in each colour, resulting in a Pareto set of minimal paths from one vertex to another. This paper will give a tight upper bound on the cardinality of a minimal set of paths for any weighted edge-coloured graph. Additionally, a bound is presented on the expected number of minimal paths in weighted edge-bicoloured graphs. These bounds indicate that despite weighted edge-coloured graphs are theoretically intractable, amenability to computation is typically found in practice.

A New Algorithm for the Weighted Reliability of Networks

The weighted reliability of network is defined as the sum of the multiplication of the probability of each network state by its normalized weighting factor.Under a certain state, when the capacity from source s to sink t is larger than the given required capacity C r, then the normalized weighting factor is 1, otherwise, it is the ratio of the capacity to the required capacity C r. This paper proposes a new algorithm for the weighted reliability of networks, puts forward the concept of saturated state of capacity, and suggests a recursive formula for expanding the minimal paths to be the sum of qualifying subsets. In the new algorithm, the expansions of the minimal paths dont create the irrelevant qualifying subsets, thus decreasing the unnecessary expanding calculation. Compared with the current algorithms, this algorithm has the advantage of a small amount of computations for computer implementation.

Stochastic computer network with multiple terminals under total accuracy rate

From the viewpoint of service level agreements,data transmission accuracy is one of the critical performances for assessing Internet by service providers and enterprise customers.The stochastic computer network(SCN),in which each edge has several capacities and the accuracy rate,has multiple terminals.This paper is aimed mainly to evaluate the system reliability for an SCN,where system reliability is the probability that the demand can be fulfilled under the total accuracy rate.A minimal capacity vector allows the system to transmit demand to each terminal under the total accuracy rate.This study proposes an efficient algorithm to find all minimal capacity vectors by minimal paths.The system reliability can then be computed in terms of all minimal capacity vectors by the recursive sum of disjoint products(RSDP) algorithm.

A New Improved Method for Symbolic Reliability Analysis

This paper describes a method for finding the terminal pair reliability expression of communication networks.This method incorporates bit manipulation and Boolean operations for generating the sum of disjointed products(SDP) expression in which each term has 1 to 1 correspondence with respective minimal path(or cut).This method is convenient and efficient. An example illustrates the method.