Fault tolerance of Mobius cubes under two forbidden fault set models

An n-dimensional Mobius cube, 0MQ(n) or 1MQ(n), is a variation of n-dimensional cube Q(n) which possesses many attractive properties such as significantly smaller communication delay and stronger graph-embedding capabilities. In some practical situations, the fault tolerance of a distributed memory multiprocessor system can be measured more precisely by the connectivity of the underlying graph under forbidden fault set models. This article addresses the connectivity of 0MQ(n)/1MQ(n), under two typical forbidden fault set models. We first prove that the connectivity of 0MQ(n)/1MQ(n) is 2n - 2 when the fault set does not contain the neighborhood of any vertex as a subset. We then prove that the connectivity of 0MQ(n)/1MQ(n) is 3n - 5 provided that the neighborhood of any vertex as well as that of any edge cannot fail simultaneously These results demonstrate that 0MQ(n)/1MQ(n) has the same connectivity as Q(n) under either of the previous assumptions.

Implementing intelligent cores using processor virtualization for fault tolerance

Processor virtualization for process migration in distributed parallel computing systems has formed a significant component of research on load balancing. In contrast, the potential of processor virtualization for fault tolerance has been addressed minimally. The work reported in this paper is motivated towards extending concepts of processor virtualization towards ‘intelligent cores’ as a means to achieve fault tolerance in distributed parallel computing systems. Intelligent cores are an abstraction of the hardware processing cores, with the incorporation of cognitive capabilities, on which parallel tasks can be executed and migrated. When a processing core executing a task is predicted to fail the task being executed is proactively transferred onto another core. A parallel reduction algorithm incorporating concepts of intelligent cores is implemented on a computer cluster using Adaptive MPI and Charm ++. Preliminary results confirm the feasibility of the approach.

Intelligent agents for fault tolerance: from multi-agent simulation to cluster-based implementation

Recent research in multi-agent systems incorporate fault tolerance concepts, but does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely 'Intelligent Agents'. A task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator, and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.

A cluster-based implementation of a fault-tolerant parallel reduction algorithm using swarm-array computing

Recent research in multi-agent systems incorporate fault tolerance concepts. However, the research does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely ‘Intelligent Agents’. In the approach considered a task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The agents hence contribute towards fault tolerance and towards building reliable systems. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.

Scalable and fault tolerant failure detection and consensus

Future extreme-scale high-performance computing systems will be required to work under frequent component failures. The MPI Forum's User Level Failure Mitigation proposal has introduced an operation, MPI_Comm_shrink, to synchronize the alive processes on the list of failed processes, so that applications can continue to execute even in the presence of failures by adopting algorithm-based fault tolerance techniques. This MPI_Comm_shrink operation requires a fault tolerant failure detection and consensus algorithm. This paper presents and compares two novel failure detection and consensus algorithms. The proposed algorithms are based on Gossip protocols and are inherently fault-tolerant and scalable. The proposed algorithms were implemented and tested using the Extreme-scale Simulator. The results show that in both algorithms the number of Gossip cycles to achieve global consensus scales logarithmically with system size. The second algorithm also shows better scalability in terms of memory and network bandwidth usage and a perfect synchronization in achieving global consensus.

On the maximal connected component of hypercube with faulty vertices (II)

evaluating the fault tolerance of an interconnection network, it is essential to estimate the size of a maximal connected component of the network at the presence of faulty processors. Hypercube is one of the most popular interconnection networks. In this paper, we prove that for ngreater than or equal to6, an n-dimensional cube with a set F of at most (4n-10) failing processors has a component of size greater than or equal to2"-\F-3. This result demonstrates the superiority of hypercube in terms of the fault tolerance.

A lower bound on the size of k-neighborhood in generalized cubes

The determination of the minimum size of a k-neighborhood (i.e., a neighborhood of a set of k nodes) in a given graph is essential in the analysis of diagnosability and fault tolerance of multicomputer systems. The generalized cubes include the hypercube and most hypercube variants as special cases. In this paper, we present a lower bound on the size of a k-neighborhood in n-dimensional generalized cubes, where 2n + 1 <= k <= 3n - 2. This lower bound is tight in that it is met by the n-dimensional hypercube. Our result is an extension of two previously known results. (c) 2005 Elsevier Inc. All rights reserved.

An MPI-based implementation of intelligent agents on clusters

Recent research in multi-agent systems incorporate fault tolerance concepts, but does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely 'Intelligent Agents'. A task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The feasibility of the approach is validated by implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.

Real-time identification and modelling in pervasive mining

This paper introduces an architecture for identifying and modelling in real-time at a copper mine using new technologies as M2M and cloud computing with a server in the cloud and an Android client inside the mine. The proposed design brings up pervasive mining, a system with wider coverage, higher communication efficiency, better fault-tolerance, and anytime anywhere availability. This solution was designed for a plant inside the mine which cannot tolerate interruption and for which their identification in situ, in real time, is an essential part of the system to control aspects such as instability by adjusting their corresponding parameters without stopping the process.

Phylogenetic variation in the tolerance and uptake of organic contaminants

An investigation into the phylogenetic variation of plant tolerance and the root and shoot uptake of organic contaminants was undertaken. The aim was to determine if particular families or genera were tolerant of, or accumulated organic pollutants. Data were collected from sixty-nine studies. The variation between experiments was accounted for using a residual maximum likelihood analysis to approximate means for individual taxa. A nested ANOVA was subsequently used to determine differences at a number of differing phylogenetic levels. Significant differences were observed at a number of phylogenetic levels for the tolerance to TPH, the root concentration factor and the shoot concentration factor. There was no correlation between the uptake of organic pollutants and that of heavy metals. The data indicate that plant phylogeny is an important influence on both the plant tolerance and uptake of organic pollutants. If this study can be expanded, such information can be used when designing plantings for phytoremediation or risk reduction during the restoration of contaminated sites.

Zinc tolerance in wheat cultivars as affected by varying levels of phosphorus

The effect of zinc-phosphorus (Zn-P) interaction on Zn efficiency of six wheat cultivars was studied. The higher dry matter yields were observed when Zn was applied at 5 mu g g(-1) soil than with no Zn application. Phosphorus applications also increased dry matter yield up to the application of 25 mu g P g(-1) soil. The dry matter yield was significantly lower at the P rate of 250 mu g g(-1) soil. At the Zn-deficient level, the Zn-efficient cultivars had higher Zn concentrations in the shoots. Zinc concentrations in all cultivars increased when the P level in the soil was increased from 0 to 25 mu g P g(-1) soil except for the cv. Durati, in which Zn concentrations decreased with increases in P levels. However, when ZnxP interactions were investigated, it was observed that at a Zn-deficient level, Zn concentrations in the plant shoot decreased with each higher level of P, and more severe Zn deficiency was observed at P level of 250 mu g g(-1) soil.

Tolerance of ruminant animals to high dose in-feed administration of a selenium-enriched yeast

The objective of the study was to determine if there were adverse effects on animal health and performance when a range of ruminant animals species were fed at least 10 times the maximum permitted European Union (EU) selenium (Se) dietary inclusion rate (0.568 mg Se/kg DM) in the form of selenium enriched yeast (SY) derived from a specific strain of Saccharomyces cerevisiae CNCM I-3060. In a series of studies, dairy cows, beef cattle, calves and lambs were offered either a control diet which contained no Se supplement or a treatment diet which contained the same basal feed ingredients plus a SY supplement which increased total dietary Se from 0.15 to 6.25, 0.20 to 6.74, 0.15 to 5.86 and 0.14 to 6.63 mg Se/kg DM, respectively. The inclusion of the SY supplement (P < 0.001) increased whole blood Se concentrations, reaching maximum mean values of 716, 1,505, 1,377, and 724 ng Se/mL for dairy cattle, beef cattle, calves and lambs, respectively. Selenomethionine accounted for 10% of total whole blood Se in control animals whereas the proportion in SY animals ranged between 40 and 75%. Glutathione peroxidase (EC 1.11.1.9) activity was higher (P < 0.05) in SY animals when compared with controls. A range of other biochemical and hematological parameters were assessed, but few differences of biological significance were established between treatments groups. There were no differences between treatment groups within each species with regard to animal physical performance or overall animal health. It was concluded that there were no adverse effects on animal health, performance and voluntary feed intake to the administration of at least ten times the EU maximum, or approximately twenty times the US FDA permitted concentration of dietary Se in the form of SY derived from a specific strain of Saccharomyces cerevisiae CNCM I-3060.