ELISA: An Estimated Load Information Scheduling Algorithm for Distributed Computing Systems

In this paper, we present a decentralized dynamic load scheduling/balancing algorithm called ELISA (Estimated Load Information Scheduling Algorithm) for general purpose distributed computing systems. ELISA uses estimated state information based upon periodic exchange of exact state information between neighbouring nodes to perform load scheduling. The primary objective of the algorithm is to cut down on the communication and load transfer overheads by minimizing the frequency of status exchange and by restricting the load transfer and status exchange within the buddy set of a processor. It is shown that the resulting algorithm performs almost as well as a perfect information algorithm and is superior to other load balancing schemes based on the random sharing and Ni-Hwang algorithms. A sensitivity analysis to study the effect of various design parameters on the effectiveness of load balancing is also carried out. Finally, the algorithm's performance is tested on large dimensional hypercubes in the presence of time-varying load arrival process and is shown to perform well in comparison to other algorithms. This makes ELISA a viable and implementable load balancing algorithm for use in general purpose distributed computing systems.

An Efficient Load Distribution Strategy for a Distributed Linear Network of Processors with Communication Delays

In this paper, we present an improved load distribution strategy, for arbitrarily divisible processing loads, to minimize the processing time in a distributed linear network of communicating processors by an efficient utilization of their front-ends. Closed-form solutions are derived, with the processing load originating at the boundary and at the interior of the network, under some important conditions on the arrangement of processors and links in the network. Asymptotic analysis is carried out to explore the ultimate performance limits of such networks. Two important theorems are stated regarding the optimal load sequence and the optimal load origination point. Comparative study of this new strategy with an earlier strategy is also presented.

Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

For point to point multiple input multiple output systems, Dayal-Brehler-Varanasi have proved that training codes achieve the same diversity order as that of the underlying coherent space time block code (STBC) if a simple minimum mean squared error estimate of the channel formed using the training part is employed for coherent detection of the underlying STBC. In this letter, a similar strategy involving a combination of training, channel estimation and detection in conjunction with existing coherent distributed STBCs is proposed for noncoherent communication in Amplify-and-Forward (AF) relay networks. Simulation results show that the proposed simple strategy outperforms distributed differential space-time coding for AF relay networks. Finally, the proposed strategy is extended to asynchronous relay networks using orthogonal frequency division multiplexing.

N-acetyl cysteine enhances imatinib-induced apoptosis of Bcr-Abl(+) cells by endothelial nitric oxide synthase-mediated production of nitric oxide

Imatinib, a small-molecule inhibitor of the Bcr-Abl kinase, is a successful drug for treating chronic myeloid leukemia (CML). Bcr-Abl kinase stimulates the production of H2O2, which in turn activates Abl kinase. We therefore evaluated whether N-acetyl cysteine (NAC), a ROS scavenger improves imatinib efficacy. Effects of imatinib and NAC either alone or in combination were assessed on Bcr-Abl(+) cells to measure apoptosis. Role of nitric oxide (NO) in NAC-induced enhanced cytotoxicity was assessed using pharmacological inhibitors and siRNAs of nitric oxide synthase isoforms. We report that imatinib-induced apoptosis of imatinib-resistant and imatinib-sensitive Bcr-Abl(+) CML cell lines and primary cells from CML patients is significantly enhanced by co-treatment with NAC compared to imatinib treatment alone. In contrast, another ROS scavenger glutathione reversed imatinib-mediated killing. NAC-mediated enhanced killing correlated with cleavage of caspases, PARP and up-regulation and down regulation of pro- and anti-apoptotic family of proteins, respectively. Co-treatment with NAC leads to enhanced production of nitric oxide (NO) by endothelial nitric oxide synthase (eNOS). Involvement of eNOS dependent NO in NAC-mediated enhancement of imatinib-induced cell death was confirmed by nitric oxide synthase (NOS) specific pharmacological inhibitors and siRNAs. Indeed, NO donor sodium nitroprusside (SNP) also enhanced imatinib-mediated apoptosis of Bcr-Abl(+) cells. NAC enhances imatinib-induced apoptosis of Bcr-Abl(+) cells by endothelial nitric oxide synthase-mediated production of nitric oxide.

Immunization of male rabbits with sheep luteal receptor to LH results in production of antibodies exhibiting hormone-agonistic and -antagonistic activities

Antibodies to LH/chorionic gonadotrophin receptor (LH/CG-R; molecular weight 67 000), isolated in a homogenous state (established by SDS-PAGE and ligand blotting) from sheep luteal membrane using human CG (hCG)-Sepharose affinity chromatography, were raised in three adult male rabbits (R-I, R-II and R-III). Each of the rabbits received 20-30 mu g oi the purified receptor in Freund's complete adjuvant at a time. Primary immunization was followed by booster injection at intervals. Production of receptor antibodies was monitored by (1) determining the dilution of the serum (IgG fraction) that could specifically bind 50% of I-125-LH/CG-R added and (2) analysing sera for any chance in testosterone levels. Following primary immunization and the first booster, all three rabbits exhibited a 2.5- to 6.0-fold increase in serum testosterone over basal levels and this effect was spread over a period of time (similar to 40 days) coinciding with the rise and fall of receptor antibodies. The maximal antibody titre (ED(50)) produced at this time ranged from 1:350 to 1:100 to below detectable limits for R-I, R-II and R-III respectively. Subsequent immunizations followed by the second booster resulted in a substantial increase in antibody titre (ED(50) of 1:5000) in R-I, but this was not accompanied by any change in serum testosterone over preimmune levels, suggesting that with the progress of immunization the character of the antibody produced had also changed. Two pools of antisera from R-I collected 10 days following the booster (at day 70 (bleed I) and day 290 (bleed II)) were used in further experiments. IgG isolated from bleed I but not from bleed II antiserum showed a dose-dependent stimulation of testosterone production by mouse Leydig cells in vitro, thus confirming the in vivo hormone-mimicking activity antibodies generated during the early immunization phase. The IgG fractions from both bleeds were, however, capable of inhibiting (1) I-125-hCG binding to crude sheep luteal membrane (EC(50) of 1:70 and 1:350 for bleed I and II antisera respectively) and (2) ovine LH-stimulated testosterone production by mouse Leydig cells in vitro, indicating the presence oi antagonistic antibodies irrespective of the period of time during which the rabbits were immunized. The: fact that bleed I-stimulated testosterone production could be inhibited in a dose-dependent manner by the addition of IgG from bleed II to the mouse Leydig cell in vitro assay system showed that the agonistic activity is intrinsic to the bleed I antibody. The receptor antibody (bleed II) was also capable of blocking LH action in vivo, as rabbits passively (for 24 h with LH/CG-R antiserum) as well as actively (for 130 days) immunized against LH/CG-R failed to respond to a bolus injection of LH (50 mu g). At no time, however, was the serum testosterone reduced below the basal level. This study clearly shows that, unlike with LH antibody, attempts to achieve an LH deficiency effect in vivo by resorting to immunization with hole LH receptor is difficult, as receptor antibodies exhibit both hormone-mimicking (agonistic) as well as hormone-blocking (antagonistic) activities.

Defect production due to quenching through a multicritical point

We study the generation of defects when a quantum spin system is quenched through a multicritical point by changing a parameter of the Hamiltonian as t/tau, where tau is the characteristic timescale of quenching. We argue that when a quantum system is quenched across a multicritical point, the density of defects (n) in the final state is not necessarily given by the Kibble-Zurek scaling form n similar to 1/tau(d nu)/((z nu+1)), where d is the spatial dimension, and. and z are respectively the correlation length and dynamical exponent associated with the quantum critical point. We propose a generalized scaling form of the defect density given by n similar to 1/(tau d/(2z2)), where the exponent z(2) determines the behavior of the off-diagonal term of the 2 x 2 Landau-Zener matrix at the multicritical point. This scaling is valid not only at a multicritical point but also at an ordinary critical point.

Co-ordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks

Distributed space time coding for wireless relay networks when the source, the destination and the relays have multiple antennas have been studied by Jing and Hassibi. In this set-up, the transmit and the receive signals at different antennas of the same relay are processed and designed independently, even though the antennas are colocated. In this paper, a wireless relay network with single antenna at the source and the destination and two antennas at each of the R relays is considered. A new class of distributed space time block codes called Co-ordinate Interleaved Distributed Space-Time Codes (CIDSTC) are introduced where, in the first phase, the source transmits a T-length complex vector to all the relays;and in the second phase, at each relay, the in-phase and quadrature component vectors of the received complex vectors at the two antennas are interleaved and processed before forwarding them to the destination. Compared to the scheme proposed by Jing-Hassibi, for T >= 4R, while providing the same asymptotic diversity order of 2R, CIDSTC scheme is shown to provide asymptotic coding gain with the cost of negligible increase in the processing complexity at the relays. However, for moderate and large values of P, CIDSTC scheme is shown to provide more diversity than that of the scheme proposed by Jing-Hassibi. CIDSTCs are shown to be fully diverse provided the information symbols take value from an appropriate multidimensional signal set.

Byzantine-resilient distributed computing systems

This paper is aimed at reviewing the notion of Byzantine-resilient distributed computing systems, the relevant protocols and their possible applications as reported in the literature. The three agreement problems, namely, the consensus problem, the interactive consistency problem, and the generals problem have been discussed. Various agreement protocols for the Byzantine generals problem have been summarized in terms of their performance and level of fault-tolerance. The three classes of Byzantine agreement protocols discussed are the deterministic, randomized, and approximate agreement protocols. Finally, application of the Byzantine agreement protocols to clock synchronization is highlighted.

Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of all the channels and the relays have only the phase information of the source-to-relay channels. In this paper, first, a new set of necessary and sufficient conditions for a space-time block code (STBC) to be single-symbol decodable (SSD) for colocated multiple antenna communication is obtained. Then, this is extended to a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for. a PCRC. Using this, several SSD DSTBCs for PCRC are identified. It is proved that even if a SSD STBC for a co-located MIMO channel does not satisfy the additional conditions for the code to be SSD for a PCRC, single-symbol decoding of it in a PCRC gives full-diversity and only coding gain is lost. It is shown that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property for PCRC. Finally, it is shown that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from (2)/(N) when the relays do not have CSI to(1)/(2), which is independent of N.

Temperature characteristics of the billet and the dies in a small batch forging production

The work reported herein is part of an on-going programme to develop a computer code which, given the geometrical, process and material parameters of the forging operation, is able to predict the die and the billet cooling/heating characteristics in forging production. The code has been experimentally validated earlier for a single forging cycle and is now validated for a small batch production. To facilitate a step-by-step development of the code, the billet deformation has so far been limited to its surface layers, a situation akin to coining. The code has been used here to study the effects of die preheat-temperature, machine speed and rate of deformation the cooling/heating of the billet and the dies over a small batch of 150 forgings. The study shows: that there is a pre-heat temperature at which the billet temperature changes little from one forging to the next; that beyond a particular number of forgings, the machine speed ceases to have any pronounced influence on the temperature characteristics of the billet; and that increasing the rate of deformation reduces the heat loss from the billet and gives the billet a stable temperature profile with respect to the number of forgings. The code, which is simple to use, is being extended to bulk-deformation problems. Given a practical range of possible machine, billet and process specifics, the code should be able to arrive at a combination of these parameters which will give the best thermal characteristics of the die-billet system. The code is also envisaged as being useful in the design of isothermal dies and processes.

Performance evaluation of a distributed concurrency control algorithm

Concurrency control (CC) algorithms are important in distributed database systems to ensure consistency of the database. A number of such algorithms are available in the literature. The issue of performance evaluation of these algorithms has been recognized to be important. However, only a few studies have been carried out towards this. This paper deals with the performance evaluation of a CC algorithm proposed by Rosenkrantz et al. through a detailed simulation study. In doing so, the algorithm has been modified so that it can, within itself, take care of the redundancy in the database. The influences of various system parameters and the transaction profile on the response time and on the degree of conflict are considered. The entire study has been carried out using the programming language SIMULA on a DEC-1090 system.

An account of chronological developments in control of distributed parameter systems

Control systems arising in many engineering fields are often of distributed parameter type, which are modeled by partial differential equations. Decades of research have lead to a great deal of literature on distributed parameter systems scattered in a wide spectrum.Extensions of popular finite-dimensional techniques to infinite-dimensional systems as well as innovative infinite-dimensional specific control design approaches have been proposed. A comprehensive account of all the developments would probably require several volumes and is perhaps a very difficult task. In this paper, however, an attempt has been made to give a brief yet reasonably representative account of many of these developments in a chronological order. To make it accessible to a wide audience, mathematical descriptions have been completely avoided with the assumption that an interested reader can always find the mathematical details in the relevant references.

Towards formal specification of a distributed computing system

Onboard spacecraft computing system is a case of a functionally distributed system that requires continuous interaction among the nodes to control the operations at different nodes. A simple and reliable protocol is desired for such an application. This paper discusses a formal approach to specify the computing system with respect to some important issues encountered in the design and development of a protocol for the onboard distributed system. The issues considered in this paper are concurrency, exclusiveness and sequencing relationships among the various processes at different nodes. A 6-tuple model is developed for the precise specification of the system. The model also enables us to check the consistency of specification and deadlock caused due to improper specification. An example is given to illustrate the use of the proposed methodology for a typical spacecraft configuration. Although the theory is motivated by a specific application the same may be applied to other distributed computing system such as those encountered in process control industries, power plant control and other similar environments.

Performance Study of a Centralized Concurrency Control Algorithm for Distributed Database Systems using SIMULA

The stimulation technique has gained much importance in the performance studies of Concurrency Control (CC) algorithms for distributed database systems. However, details regarding the simulation methodology and implementation are seldom mentioned in the literature. One objective of this paper is to elaborate the simulation methodology using SIMULA. Detailed studies have been carried out on a centralised CC algorithm and its modified version. The results compare well with a previously reported study on these algorithms. Here, additional results concerning the update intensiveness of transactions and the degree of conflict are obtained. The degree of conflict is quantitatively measured and it is seen to be a useful performance index. Regression analysis has been carried out on the results, and an optimisation study using the regression model has been performed to minimise the response time. Such a study may prove useful for the design of distributed database systems.