An efficient and scalable checkpointing and recovery algorithm for distributed systems

In this paper, we describe an efficient coordinated-checkpointing and recovery algorithm which can work even when the channels are assumed to be non-FIFO, and messages may be lost. Nodes are assumed to be autonomous, and they do not block while taking checkpoints. Based on the local conditions, any process can request the previous coordinator for the 'permission' to initiate a new checkpoint. Allowing multiple initiators of checkpoints avoids the bottleneck associated with a single initiator, but the algorithm permits only a single instance of checkpointing process at any given time, thus reducing much of the overhead associated with multiple initiators of distributed algorithms.

Framework for enabling highly available distributed applications for utility computing

The move towards IT outsourcing is the first step towards an environment where compute infrastructure is treated as a service. In utility computing this IT service has to honor Service Level Agreements (SLA) in order to meet the desired Quality of Service (QoS) guarantees. Such an environment requires reliable services in order to maximize the utilization of the resources and to decrease the Total Cost of Ownership (TCO). Such reliability cannot come at the cost of resource duplication, since it increases the TCO of the data center and hence the cost per compute unit. We, in this paper, look into aspects of projecting impact of hardware failures on the SLAs and techniques required to take proactive recovery steps in case of a predicted failure. By maintaining health vectors of all hardware and system resources, we predict the failure probability of resources based on observed hardware errors/failure events, at runtime. This inturn influences an availability aware middleware to take proactive action (even before the application is affected in case the system and the application have low recoverability). The proposed framework has been prototyped on a system running HP-UX. Our offline analysis of the prediction system on hardware error logs indicate no more than 10% false positives. This work to the best of our knowledge is the first of its kind to perform an end-to-end analysis of the impact of a hardware fault on application SLAs, in a live system.

Adaptive load control of the central processor in a distributed system with a star topology

The author presents adaptive control techniques for controlling the flow of real-time jobs from the peripheral processors (PPs) to the central processor (CP) of a distributed system with a star topology. He considers two classes of flow control mechanisms: (1) proportional control, where a certain proportion of the load offered to each PP is sent to the CP, and (2) threshold control, where there is a maximum rate at which each PP can send jobs to the CP. The problem is to obtain good algorithms for dynamically adjusting the control level at each PP in order to prevent overload of the CP, when the load offered by the PPs is unknown and varying. The author formulates the problem approximately as a standard system control problem in which the system has unknown parameters that are subject to change. Using well-known techniques (e.g., naive-feedback-controller and stochastic approximation techniques), he derives adaptive controls for the system control problem. He demonstrates the efficacy of these controls in the original problem by using the control algorithms in simulations of a queuing model of the CP and the load controls.

Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a recent paper, Wu et al. characterize the tradeoff between the repair bandwidth and the amount of data stored per node. They also prove the existence of regenerating codes that achieve this tradeoff. In this paper, we introduce Exact Regenerating Codes, which are regenerating codes possessing the additional property of being able to duplicate the data stored at a failed node. Such codes require low processing and communication overheads, making the system practical and easy to maintain. Explicit construction of exact regenerating codes is provided for the minimum bandwidth point on the storage-repair bandwidth tradeoff, relevant to distributed-mail-server applications. A sub-space based approach is provided and shown to yield necessary and sufficient conditions on a linear code to possess the exact regeneration property as well as prove the uniqueness of our construction. Also included in the paper, is an explicit construction of regenerating codes for the minimum storage point for parameters relevant to storage in peer-to-peer systems. This construction supports a variable number of nodes and can handle multiple, simultaneous node failures. All constructions given in the paper are of low complexity, requiring low field size in particular.

Distributed Transmission of Functions of Correlated Sources over a Fading Multiple Access Channel

In this paper we address the problem of distributed transmission of functions of correlated sources over a fast fading multiple access channel (MAC). This is a basic building block in a hierarchical sensor network used in estimating a random field where the cluster head is interested only in estimating a function of the observations. The observations are transmitted to the cluster head through a fast fading MAC. We provide sufficient conditions for lossy transmission when the encoders and decoders are provided with partial information about the channel state. Furthermore signal side information maybe available at the encoders and the decoder. Various previous studies are shown as special cases. Efficient joint-source channel coding schemes are discussed for transmission of discrete and continuous alphabet sources to recover function values.

Characterization of strain in Si1-xGex films using multiple angle of incidence ellipsometry

In this letter we characterize strain in Si1-xGex based heterojunction bipolar transistors and modulation doped field effect transistors grown by rapid thermal chemical vapor deposition exploiting the phenomenon of strain-induced birefringence. The technique used is multiple angle of incidence ellipsometry at a wavelength of 670 nm to measure the ordinary and extraordinary refractive indices of the Si1-xGex films. We report measurements on thin fully strained films (with thicknesses less than the critical thickness) with Ge concentration varying from 9% to 40% with an accuracy of the order of 1 part in 10(4) and propose an empirical relation between the difference in the ordinary and extraordinary refractive indices (deltan) and the Ge concentration (x) given by deltan(x)=0.18x-0.12x(2). (C) 2000 American Institute of Physics. [S0003-6951(00)03948-6].

Transfer of saline tolerance from one strain of rice to another by injection of DNA

Direct injection of genomic DNA from salt tolerant cv. Pokkali into developing floral tillers on IR20 produced transgenic seeds similar to Pokkali in husk colour and which germinated well in 0.2 M NaCl and had a 4-6-fold higher proline content.

Intelligent prediction of the stress-strain response of intact and jointed rocks

An application of Artificial Neural Networks for predicting the stress-strain response of jointed rocks under different confining pressures is presented in this paper. Rocks of different compressive strength with different joint properties (frequency, orientation and strength of joints) are considered in this study. The database for training the neural network is formed from the results of triaxial compression tests on different intact and jointed rocks with different joint properties tested at different confining pressures reported by various researchers in the literature. The network was trained using a three-layered network with the feed-forward back propagation algorithm.About 85% of the data was used for training and the remaining 15% was used for testing the network. Results from the analyses demonstrated that the neural network approach is effective in capturing the stress-strain behaviour of intact rocks and the complex stress-strain behaviour of jointed rocks. A single neural network is demonstrated to be capable of predicting the stress-strain response of different jointed rocks, whose intact strength varies from 11.32 MPa to 123 MPa, spacing of joints varies from 10 cm to 100 cm. and confining pressures range from 0 to 13.8 MPa. (C) 2010 Elsevier Ltd. All rights reserved.

Simultaneous Measurement of Strain and Temperature using Type I and Pre-strained Fiber Bragg Gratings

Strain and temperature sensitivities of a type I Bragg grating inscribed in a germania doped silica fiber, fabricated under normal conditions and zero strain, are compared with that of a Bragg grating inscribed under pre-strained condition. The results obtained reveal that the strain and temperature sensitivities of the two gratings are different. Based on these results, we demonstrate a technique which enables discrimination of strain and temperature in a Fiber Bragg Grating (FBG) with a linear response. The present technique allows for an easy implementation of the sensor by providing a direct access to the grating region in the fiber and demands only a simple interrogation system.

Slip line field analysis of a simple plane strain closed‐die forging

A slip line field is proposed for symmetrical single‐cavity closed‐die forging by rough dies. A compatible velocity field is shown to exist. Experiments were conducted using lead workpiece and rough dies. Experimentally observed flow and load were used to validate the proposed slip line field. The slip line field was used to simulate the process in the computer with the objective of studying the influence of flash geometry on cavity filling.

Specification-driven approach for protocol design of distributed computing systems

An important issue in the design of a distributed computing system (DCS) is the development of a suitable protocol. This paper presents an effort to systematize the protocol design procedure for a DCS. Protocol design and development can be divided into six phases: specification of the DCS, specification of protocol requirements, protocol design, specification and validation of the designed protocol, performance evaluation, and hardware/software implementation. This paper describes techniques for the second and third phases, while the first phase has been considered by the authors in their earlier work. Matrix and set theoretic based approaches are used for specification of a DCS and for specification of the protocol requirements. These two formal specification techniques form the basis of the development of a simple and straightforward procedure for the design of the protocol. The applicability of the above design procedure has been illustrated by considering an example of a computing system encountered on board a spacecraft. A Petri-net based approach has been adopted to model the protocol. The methodology developed in this paper can be used in other DCS applications.

Effect of interaction of macrocracks on the stress intensity factor in a beam

Beams with a central edge crack, as well as other noncentral vertical and inclined edge cracks distributed symmetrically, subjected to three-point as well as four-point bending, are analysed using the finite element technique. Values of stress intensity factor K1 at the central crack tip for a crack-to-beam depth ratio Image equal to 0.5, are calculated for various cracked-beam configurations, using the compliance calibration technique as well as method of strain energy release rate. These are compared with the value of K1 for the case of a beam with central edge crack alone. Results of the present parametric study are used to specify the range of values pertaining to basic parameters such as crack-to-beam depth ratios, geometry and position with respect to central edge crack, of other macrocracks for which interaction exists. Accordingly, the macrocracks are classified as either interacting or noninteracting types. Hence for noninteracting types of cracks, analytical expressions available for the determination of K1 in the case of beam with a central edge crack alone, are applicable.

Characterization of a mercury-reducing Bacillus cereus strain isolated from the Pulicat Lake sediments, south east coast of India

Pulicat Lake sediments are often severely polluted with the toxic heavy metal mercury. Several mercury-resistant strains of Bacillus species were isolated from the sediments and all the isolates exhibited broad spectrum resistance (resistance to both organic and inorganic mercuric compounds). Plasmid curing assay showed that all the isolated Bacillus strains carry chromosomally borne mercury resistance. Polymerase chain reaction and southern hybridization analyses using merA and merB3 gene primers/probes showed that five of the isolated Bacillus strains carry sequences similar to known merA and merB3 genes. Results of multiple sequence alignment revealed 99% similarity with merA and merB3 of TnMERI1 (class II transposons). Other mercury resistant Bacillus species lacking homology to these genes were not able to volatilize mercuric chloride, indicating the presence of other modes of resistance to mercuric compounds.

An Accurate Model For Interference From Spatially Distributed Shadowed Users in CDMA Uplinks

A detailed characterization of interference power statistics in CDMA systems is of considerable practical and theoretical interest. Such a characterization for uplink inter-cell interference has been difficult because of transmit power control, randomness in the number of interfering mobile stations, and randomness in their locations. We develop a new method to model the uplink inter-cell interference power as a lognormal distribution, and show that it is an order of magnitude more accurate than the conventional Gaussian approximation even when the average number of mobile stations per cell is relatively large and even outperforms the moment-matched lognormal approximation considered in the literature. The proposed method determines the lognormal parameters by matching its moment generating function with a new approximation of the moment generating function for the inter-cell interference. The method is tractable and exploits the elegant spatial Poisson process theory. Using several numerical examples, the accuracy of the proposed method in modeling the probability distribution of inter-cell interference is verified for both small and large values of interference.