Some Properties of the g-Good-Neighbor (g-Extra) Diagnosability of a Multiprocessor System

Diagnosability of a multiprocessor system is one important study topic. In 2012, Peng et al. proposed a measure for fault tolerance of the system, which is called the g-good-neighbor diagnosability that restrains every fault-free node containing at least g fault-free neighbors. In 2015, Zhang et al. proposed a measure for fault diagnosis of the system, namely, g-extra diagnosability, which restrains that every fault-free component has at least g+1 fault-free nodes. In this paper, we obtain some properties of the g-good-neighbor (g-extra) diagnosability of the system and give the g-good-neighbor (g-extra) diagnosability of some graphs under the PMC model and MM* model.

A Scalable Interconnection Scheme in Many-Core Systems

Recent architectures of multi-core systems may have a relatively large number of cores that typically ranges from tens to hundreds;therefore called many-core systems.Such systems require an efficient interconnection network that tries to address two major problems.First,the overhead of power and area cost and its effect on scalability.Second,high access latency is caused by multiple cores’simultaneous accesses of the same shared module.This paper presents an interconnection scheme called N-conjugate Shuffle Clusters(NCSC)based on multi-core multicluster architecture to reduce the overhead of the just mentioned problems.NCSC eliminated the need for router devices and their complexity and hence reduced the power and area costs.It also resigned and distributed the shared caches across the interconnection network to increase the ability for simultaneous access and hence reduce the access latency.For intra-cluster communication,Multi-port Content Addressable Memory(MPCAM)is used.The experimental results using four clusters and four cores each indicated that the average access latency for a write process is 1.14785±0.04532 ns which is nearly equal to the latency of a write operation in MPCAM.Moreover,it was demonstrated that the average read latency within a cluster is 1.26226±0.090591 ns and around 1.92738±0.139588 ns for read access between cores from different clusters.

An ARM-based debugging system for multipole array acoustic logging tools

This paper presents a debugging system for multi-pole array acoustic logging （MPAL） tools. The debugging system proposed in this study can debug the MPAL tool system, sub-system and local electronics. In the test equipment, we have used principal and subordinate structures, and interconnected the host computer and the front-end machine via Ethernet. The front-end machine is based on the ARM7 （advanced reduced instruction set computing （RISC） machine） technique, the processor of which runs an embedded operating system, namely, uClinux OS. We have analyzed the system telecommunication, human-machine interface circuit, transmitter mandrel interface circuit, receiver mandrel interface circuit, and board-level test interface circuit. The software used in the system consists of the embedded front-computer software and the host application software. We have explained in detail the flow chart of the boot loader in the embedded front-computer software. The host application software is composed of four application subroutines, which match with the functional modules of the system hardware. A net communication program based on the server^client mode is implemented by means of socket programming and multi-thread programming. Test results indicate that the data transmission rate of the system is higher than 1 MB/s, which completely meets the current requirements of the data transmission rate between the tool system and the wireline telemetry device. Application of the debugging system, which includes multiple level test methods, shows that the proposed system can fully meet the test requirements of MPAL at various levels.

Reliability Assessment of a New General Matching Composed Network

The reliability of a network is an important indicator for maintaining communication and ensuring its stable operation. Therefore, the assessment of reliability in underlying interconnection networks has become an increasingly important research issue. However, at present, the reliability assessment of many interconnected networks is not yet accurate,which inevitably weakens their fault tolerance and diagnostic capabilities. To improve network reliability,researchers have proposed various methods and strategies for precise assessment. This paper introduces a novel family of interconnection networks called general matching composed networks(gMCNs), which is based on the common characteristics of network topology structure. After analyzing the topological properties of gMCNs, we establish a relationship between super connectivity and conditional diagnosability of gMCNs. Furthermore, we assess the reliability of g MCNs, and determine the conditional diagnosability of many interconnection networks.

Reliability Analysis of Varietal Hypercube

Connectivity is a vital metric to explore fault tolerance and reliability of network structure based on a graph model. Let be a connected graph. A connected graph G is called supper-κ (resp. supper-λ) if every minimum vertex cut (edge cut) of G is the set of neighbors of some vertex in G. The g-component connectivity of a graph G, denoted by , is the minimum number of vertices whose removal from G results in a disconnected graph with at least g components or a graph with fewer than g vertices. The g-component edge connectivity can be defined similarly. In this paper, we determine the g-component (edge) connectivity of varietal hypercube for small g.

Dynamic load balancing based on restricted multicast tree in triplet-based hierarchical interconnection network

To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve the efficiency of interchanging load information, is presented. To support the algorithm, a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed. The load migration request messages from the heavily loaded node （HLN）are spread along an MT whose root is the HLN. And the lightly loaded nodes（LLNs） covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT. So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA, and its load state can be improved as quickly as possible. To avoid wrongly transmitted or redundant DLB messages due to MT overlapping, the MT construction is restricted in the design of the THINDLBA. Through experiments, the effectiveness of four DLB algorithms are compared, and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale computeintensive tasks more than others.

Development of Network Interconnection in China

This paper introduces the current situation of China power industry and interconnection, the necessity to develop interconnection, the principle of nationwide interconnection and the key technologies to be studiedinclude HVDC and FACTS. The paper also discusses thefeasibility of 750 kV to be used in the northwest.regionand to speed up research and development of nighervoltage level in other regions of China, as well as scl-ence and technical innovation for transmission and dis-tribution projects.

Diagnosabilities of exchanged hypercube networks under the pessimistic one-step diagnosis strategy

The exchanged hypercube EH（s, t） （where s ≥ 1 and t ≥ 1） is obtained by systematically reducing links from a regular hypercube Q,＋t＋l. One-step diagnosis of exchanged hypercubes which involves only one testing phase during which processors test each other is discussed. The diagnosabilities of exchanged hypercubes are studied by using the pessimistic one-step diagno- sis strategy under two kinds of diagnosis models： the PMC model and the MM model. The main results presented here are the two proofs that the degree of diagnosability of the EH（s, t） under pessimistic one-step tl/tl fault diagnosis strategy is 2s where I ≤ s ≤ t （respectively, 2t, where 1 ≤ t ≤ s） based on the PMC model and that it is also 2s where 1 ≤ s ≤ t （respectively, 2t, where 1 ≤ t ≤ s） based on the MM＊ model.

A New Approach for the Health Assessment of River Systems Based on Interconnected Water System Networks

Interconnected river system networks is a national water conservancy strategy in China and focus of research. Here we discuss the classification system, material and energy exchange between rivers and lakes, various dynamic flows and ecological functions of river-lake interconnected relationships. We then propose a novel method for the health assessment of river systems based on interconnected water system networks. In a healthy river system there is ＂material and energy exchange＂ and it is the first and foremost relationship of material and energy exchange between rivers and lakes. There are unobstructed various ＂flows＂ between rivers and lakes including material flows （water, dissolved substances, sediments, organisms and contaminants）, energy flows （water levels, flow and flow velocity）, information flows （information generated with water flows, organisms and human activities） and value flows （shipping, power generation, drinking and irrigation）. Under the influences of na- ture and human activity, various flows are connected by river-lake interconnection to carry material and energy exchange between rivers and lakes to achieve river-lake interactions. The material and energy exchange between rivers and lakes become one of the approaches and the direct driving forces of changes in river-lake interconnected relationships. The benignant changes in river-lake interconnected relationship tend to be in relatively steady state and in ideal dynamic balance.

Research on reliability index of a large communication network with domain partition and interconnection

In order to indicate the performances of a large-scale communication network with domain partition and interconnection today, a kind of reliability index weighed by normalized capacity is defined. Based on the route rules of network with domain partition and interconnection, the interconnection indexes among the nodes within the domain and among the domains are given from several aspects. It is expatiated on that the index can thoroughly represent the effect on the reliability index of the objective factor and the subjective measures of the designer, which obeys the route rules of a network with domain partition and interconnection. It is discussed that the defined index is rational and compatible with the traditional index.

Bounds on the absorbant number of generalized Kautz digraphs

The generalized Kautz digraphs have many good properties as interconnection network topologies. In this note, the bounds of the absorbant number for the generalized Kautz digraph are given, and some sufficient conditions for the absorbant number of the generalized Kautz digraph attaining the bounds are presented.

An Improved Interconnection Network Based on NIN

The Novel Interconnection Network (NIN) based on inverted-graph topology and crossbar switch is a kind of lower latency and higher throughput interconnection network. But it has a vital disadvantage, high hardware complexity. In order to reduce system hardware cost, an improved NIN (ININ) structure is proposed. As same as NIN, ININ has constant network diameter. Besides of keeping advantages of NIN, hardware cost of ININ is lower than NIN. Furthermore, we design a new deadlock-free routing algorithm for the improved NIN. Key words NIN - ININ - inverted-graph interconnection network - hardware complexity - network band-width - network throughput CLC number TP 302 Foundation item: Supported by the National Natural Science Foundation of China (69873016)Biography: Li Fei (1974-), male, Ph. D candidate, research direction: architecture of interconnection network.

An Analytical Model for Torus Networks in the Presence of Batch Message Arrivals with Hot-spot Destinations

Interconnection networks are hardware fabrics supporting communications between individual processors in multi- computers. The low-dimensional k-ary n-cubes （or torus） with adaptive wormhole switching have attracted significant research efforts to construct high-performance interconnection networks in contemporary multi-computers. The arrival process and destination distribution of messages have great effects on network performance. With the aim of capturing the characteristics of the realistic traffic pattern and obtaining a deep understanding of the performance behaviour of interconneetion networks, this paper presents an analytical model to investigate the message latency in adaptive-routed wormhole-switched torus networks where there exists hot-spot nodes and the message arrivals follow a batch arrival process. Each generated message has a given probability to be directed to the hot-spot node. The average degree of virtual channel multiplexing is computed by the GE/G/1/V queueing system with finite buffer capacity. We compare analytical results of message latency with those obtained through the simulation experiments in order to validate the accuracy of the derived model.

Twin domination in generalized Kautz digraphs

Let G = （V,A） be a digraph.A set T of vertices of G is a twin dominating set of G if for every vertex v ∈ V ／ T.There exist u,w ∈ T （possibly u = w） such that （u,v）,（v,w） ∈ A.The twin domination number γ＊（G） of G is the cardinality of a minimum twin dominating set of G.In this paper we consider the twin domination number in generalized Kautz digraphs GK（n,d）.In these digraphs,we establish bounds on the twin domination number and give a sufficient condition for the twin domination number attaining the lower bound.We give the exact values of the twin domination numbers by constructing minimum twin dominating sets for some special generalized Kautz digraphs.

An new representation for interconnection network structures

An important theoretic interest is to study the relations between different interconnection networks, and to compare the capability and performance of the network structures. The most popular way to do the investigation is network emulation. Based on the classical voltage graph theory, the authors develop a new representation scheme for interconnection network structures. The new approach is a combination of algebraic methods and combinatorial methods. The results demonstrate that the voltage graph theory is a powerful tool for representing well known interconnection networks and in implementing optimal network emulation algorithms, and in particular, show that all popular interconnection networks have very simple and intuitive representations under the new scheme. The new representation scheme also offers powerful tools for the study of network routings and emulations. For example, we present very simple constructions for optimal network emulations from the cube connected cycles networks to the butterfly networks, and from the butterfly networks to the hypercube networks. Compared with the most popular way of network emulation, this new scheme is intuitive and easy to realize, and easy to apply to other network structures.

Virtual and physical address translation mechanism of interconnect network

Most of users are accustomed to utilizing virtual address in their parallel programs running at the scalable high-performance parallel computing systems.Therefore a virtual and physical address translation mechanism is necessary and crucial to bridge the hardware interface and software application.In this paper,a new virtual and physical translation mechanism is proposed,which includes an address validity checker,an address translation cache（ATC）,a complete refresh scheme and many reliability designs.The ATC employs a large capacity embedded dynamic random access memory（eDRAM）to meet the high hit ratio requirement.It also can switch the cache and buffer mode to avoid the high latency of accessing the main memory outside.Many tests have been conducted on the real chip,which implements the address translation mechanism.The results show that the ATC has a high hit ratio while running the well-known benchmarks,and additionally demonstrates that the new high-performance mechanism is well designed.

Comparative Evaluation of Data Mining Algorithms in Breast Cancer

Unchecked breast cell growth is one of the leading causes of death in women globally and is the cause of breast cancer.The only method to avoid breast cancer-related deaths is through early detection and treatment.The proper classification of malignancies is one of the most significant challenges in the medical industry.Due to their high precision and accuracy,machine learning techniques are extensively employed for identifying and classifying various forms of cancer.Several data mining algorithms were studied and implemented by the author of this review and compared them to the present parameters and accuracy of various algorithms for breast cancer diagnosis such that clinicians might use them to accurately detect cancer cells early on.This article introduces several techniques,including support vector machine(SVM),K star(K∗)classifier,Additive Regression(AR),Back Propagation Neural Network(BP),and Bagging.These algorithms are trained using a set of data that contains tumor parameters from breast cancer patients.Comparing the results,the author found that Support Vector Machine and Bagging had the highest precision and accuracy,respectively.Also,assess the number of studies that provide machine learning techniques for breast cancer detection.

Some LCP Decompositions of Multistage Interconnection Networks

Some useful layered cross product decompositons are derived both for general bit permutation networks and for(2n-1)-stage multistage interconnection networks.Several issues in related works are clarified and the rearrangeability of some interesting networks are considered.In particular, the rearrangeability of one class of networks is formulated as a new type of combinatorial design problmes.

BALANCE ROUTING TRAFFIC IN GENERALIZED SHUFFLE-EXCHANGE NETWORK

A methodology is proposed to handle problem that under equiproble address of packet traffic at the input port, Generalized Shuffle-Exchange Network (GSEN) routes traffic unevenly because of the unbalanced routing tags. The idea is to use routing tag according to probability, which can be evaluated by using Moore-Penrose inverse in matrix analysis. An instance is used to illustrate the idea, and the simulation is done to show the improvement in performance issues.