A strategy for scheduling tightly coupled parallel applications on clusters

Although various strategies have been developed for scheduling parallel applications with independent tasks, very little work exists for scheduling tightly coupled parallel applications on cluster environments. In this paper, we compare four different strategies based on performance models of tightly coupled parallel applications for scheduling the applications on clusters. In addition to algorithms based on existing popular optimization techniques, we also propose a new algorithm called Box Elimination that searches the space of performance model parameters to determine the best schedule of machines. By means of real and simulation experiments, we evaluated the algorithms on single cluster and multi-cluster setups. We show that our Box Elimination algorithm generates up to 80% more efficient schedule than other algorithms. We also show that the execution times of the schedules produced by our algorithm are more robust against the performance modeling errors.

An analytical model for performance evaluation of multimedia applications over EDCA in an IEEE 802.11e WLAN

We extend the modeling heuristic of (Harsha et al. 2006. In IEEE IWQoS 06, pp 178 - 187) to evaluate the performance of an IEEE 802.11e infrastructure network carrying packet telephone calls, streaming video sessions and TCP controlled file downloads, using Enhanced Distributed Channel Access (EDCA). We identify the time boundaries of activities on the channel (called channel slot boundaries) and derive a Markov Renewal Process of the contending nodes on these epochs. This is achieved by the use of attempt probabilities of the contending nodes as those obtained from the saturation fixed point analysis of (Ramaiyan et al. 2005. In Proceedings ACM Sigmetrics, `05. Journal version accepted for publication in IEEE TON). Regenerative analysis on this MRP yields the desired steady state performance measures. We then use the MRP model to develop an effective bandwidth approach for obtaining a bound on the size of the buffer required at the video queue of the AP, such that the streaming video packet loss probability is kept to less than 1%. The results obtained match well with simulations using the network simulator, ns-2. We find that, with the default IEEE 802.11e EDCA parameters for access categories AC 1, AC 2 and AC 3, the voice call capacity decreases if even one streaming video session and one TCP file download are initiated by some wireless station. Subsequently, reducing the voice calls increases the video downlink stream throughput by 0.38 Mbps and file download capacity by 0.14 Mbps, for every voice call (for the 11 Mbps PHY). We find that a buffer size of 75KB is sufficient to ensure that the video packet loss probability at the QAP is within 1%.

A Slotted Aloha joint MAC-cum-Routing protocol for data gathering sensor network applications

In this paper we have proposed and implemented a joint Medium Access Control (MAC) -cum- Routing scheme for environment data gathering sensor networks. The design principle uses node 'battery lifetime' maximization to be traded against a network that is capable of tolerating: A known percentage of combined packet losses due to packet collisions, network synchronization mismatch and channel impairments Significant end-to-end delay of an order of few seconds We have achieved this with a loosely synchronized network of sensor nodes that implement Slotted-Aloha MAC state machine together with route information. The scheme has given encouraging results in terms of energy savings compared to other popular implementations. The overall packet loss is about 12%. The battery life time increase compared to B-MAC varies from a minimum of 30% to about 90% depending on the duty cycle.

A self-adaptive migration model genetic algorithm for data mining applications

Data mining involves nontrivial process of extracting knowledge or patterns from large databases. Genetic Algorithms are efficient and robust searching and optimization methods that are used in data mining. In this paper we propose a Self-Adaptive Migration Model GA (SAMGA), where parameters of population size, the number of points of crossover and mutation rate for each population are adaptively fixed. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions and a set of actual classification datamining problems. Michigan style of classifier was used to build the classifier and the system was tested with machine learning databases of Pima Indian Diabetes database, Wisconsin Breast Cancer database and few others. The performance of our algorithm is better than others.

Characterization of the Entamoeba histolytica Ornithine Decarboxylase-Like Enzyme

Background: The polyamines putrescine, spermidine, and spermine are organic cations that are required for cell growth and differentiation. Ornithine decarboxylase (ODC), the first and rate-limiting enzyme in the polyamine biosynthetic pathway, is a highly regulated enzyme. Methodology and Results: To use this enzyme as a potential drug target, the gene encoding putative ornithine decarboxylase (ODC)-like sequence was cloned from Entamoeba histolytica, a protozoan parasite causing amoebiasis. DNA sequence analysis revealed an open reading frame (ORF) of similar to 1,242 bp encoding a putative protein of 413 amino acids with a calculated molecular mass of 46 kDa and a predicted isoelectric point of 5.61. The E. histolytica putative ODC-like sequence has 33% sequence identity with human ODC and 36% identity with the Datura stramonium ODC. The ORF is a single-copy gene located on a 1.9-Mb chromosome. The recombinant putative ODC protein (48 kDa) from E. histolytica was heterologously expressed in Escherichia coli. Antiserum against recombinant putative ODC protein detected a band of anticipated size similar to 46 kDa in E. histolytica whole-cell lysate. Difluoromethylornithine (DFMO), an enzyme-activated irreversible inhibitor of ODC, had no effect on the recombinant putative ODC from E. histolytica. Comparative modeling of the three-dimensional structure of E. histolytica putative ODC shows that the putative binding site for DFMO is disrupted by the substitution of three amino acids-aspartate-332, aspartate-361, and tyrosine-323-by histidine-296, phenylalanine-305, and asparagine-334, through which this inhibitor interacts with the protein. Amino acid changes in the pocket of the E. histolytica enzyme resulted in low substrate specificity for ornithine. It is possible that the enzyme has evolved a novel substrate specificity. Conclusion: To our knowledge this is the first report on the molecular characterization of putative ODC-like sequence from E. histolytica. Computer modeling revealed that three of the critical residues required for binding of DFMO to the ODC enzyme are substituted in E. histolytica, resulting in the likely loss of interactions between the enzyme and DFMO.

Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times

We propose certain discrete parameter variants of well known simulation optimization algorithms. Two of these algorithms are based on the smoothed functional (SF) technique while two others are based on the simultaneous perturbation stochastic approximation (SPSA) method. They differ from each other in the way perturbations are obtained and also the manner in which projections and parameter updates are performed. All our algorithms use two simulations and two-timescale stochastic approximation. As an application setting, we consider the important problem of admission control of packets in communication networks under dependent service times. We consider a discrete time slotted queueing model of the system and consider two different scenarios - one where the service times have a dependence on the system state and the other where they depend on the number of arrivals in a time slot. Under our settings, the simulated objective function appears ill-behaved with multiple local minima and a unique global minimum characterized by a sharp dip in the objective function in a small region of the parameter space. We compare the performance of our algorithms on these settings and observe that the two SF algorithms show the best results overall. In fact, in many cases studied, SF algorithms converge to the global minimum.

Analytical models for capacity estimation of IEEE 802.11 WLANs using DCF for internet applications

We provide analytical models for capacity evaluation of an infrastructure IEEE 802.11 based network carrying TCP controlled file downloads or full-duplex packet telephone calls. In each case the analytical models utilize the attempt probabilities from a well known fixed-point based saturation analysis. For TCP controlled file downloads, following Bruno et al. (In Networking '04, LNCS 2042, pp. 626-637), we model the number of wireless stations (STAs) with ACKs as a Markov renewal process embedded at packet success instants. In our work, analysis of the evolution between the embedded instants is done by using saturation analysis to provide state dependent attempt probabilities. We show that in spite of its simplicity, our model works well, by comparing various simulated quantities, such as collision probability, with values predicted from our model. Next we consider N constant bit rate VoIP calls terminating at N STAs. We model the number of STAs that have an up-link voice packet as a Markov renewal process embedded at so called channel slot boundaries. Analysis of the evolution over a channel slot is done using saturation analysis as before. We find that again the AP is the bottleneck, and the system can support (in the sense of a bound on the probability of delay exceeding a given value) a number of calls less than that at which the arrival rate into the AP exceeds the average service rate applied to the AP. Finally, we extend the analytical model for VoIP calls to determine the call capacity of an 802.11b WLAN in a situation where VoIP calls originate from two different types of coders. We consider N-1 calls originating from Type 1 codecs and N-2 calls originating from Type 2 codecs. For G711 and G729 voice coders, we show that the analytical model again provides accurate results in comparison with simulations.

Interrupted creep behaviour of Mg alloys developed for powertrain applications

A conventional magnesium alloy, AZ91D, and two creep resistant magnesium alloys, developed for powertrain applications, MRI 153M and MRI 230D, are prepared by high pressure die casting. These alloys are tested for their creep behaviour in the continuous manner, as is the Current practice, and in the interrupted manner, which represents the real life Situation more closely. It is observed that the interrupted creep tests give rise to a primary creep appearing at the beginning of each cycle resulting in a higher average strain rate than that encountered in the continuous creep tests. Further, the shorter the cycle time, higher is the average strain rate in the interrupted creep tests. A higher average strain rate will give rise to a higher strain over the same period. This is attributed to the recovery taking place during the cooling and heating between two cycles. The effect of additional precipitation during interrupted creep tests depends on the nature of the precipitates. The additional precipitation of beta phase during the cooling and heating between two cycles increases the steady state strain rate in the AZ91D and MRI 153M alloys. whereas the additional precipitation of C36 phase during the cooling and heating between two cycles decreases the steady state strain rate in the MRI 230D alloy. (C) 2009 Elsevier B.V. All rights reserved.

Providing QoS to Real and Data Applications in WiMAX Mesh Networks

We consider the problem of centralized routing and scheduling for IEEE 802.16 mesh networks so as to provide Quality of Service (QoS) to individual real and interactive data applications. We first obtain an optimal and fair routing and scheduling policy for aggregate demands for different source- destination pairs. We then present scheduling algorithms which provide per flow QoS guarantees while utilizing the network resources efficiently. Our algorithms are also scalable: they do not require per flow processing and queueing and the computational requirements are modest. We have verified our algorithms via extensive simulations.

The key enzyme in galactose metabolism, UDP-galactose-4-epimerase, affects cell-wall integrity and morphology in Candida albicans even in the absence of galactose

The enzyme UDP-galactose-4-epimerase (GAL10) catalyzes a key step in galactose metabolism converting UDP-galactose to UDPglucose which then can get metabolized through glycolysis and TCA cycle thus allowing the cell to use galactose as a carbon and energy source. As in many fungi, a functional homolog of GAL10 exists in Candida albicans. The domainal organization of the homologs from Saccharomyces cerevisiae and C albicans show high degree of homology having both mutarotase and an epimerase domain. The former is responsible for the conversion of beta-D-galactose to alpha-D-galactose and the hitter for epimerization of UDP-galactose to UDP-glucose. Absence of C albicans GAL10 (CaGAL10) affects cell-wall organization, oxidative stress response, biofilm formation and filamentation. Cagal10 mutant cells tend to flocculate extensively as compared to the wild-type cells. The excessive filamentation in this mutant is reflected in its irregular and wrinkled colony morphology. Cagal10 strain is more susceptible to oxidative stress when tested in presence of H2O2. While the S. cerevsiae GAL10 (ScGAL10), essential for survival in the presence of galactose, has not been reported to have defects in the absence of galactose, the C albicans homolog shows these phenotypes during growth in the absence of galactose. Thus a functional CaGal10 is required not only for galactose metabolism but also for normal hyphal morphogenesis, colony morphology, maintenance of cell-wall integrity and for resistance to oxidative stress even in the absence of galactose. (c) 2006 Elsevier Inc. All rights reserved.

Structural plasticity and enzyme action: Crystal structures of Mycobacterium tuberculosis peptidyl-tRNA hydrolase

Peptidyl-tRNA hydrolase cleaves the ester bond between tRNA and the attached peptide in peptidyl-tRNA in order to avoid the toxicity resulting from its accumulation and to free the tRNA available for further rounds in protein synthesis. The structure of the enzyme from Mycobacteritan tuberculosis has been determined in three crystal forms. This structure and the structure of the enzyme frorn Escherichia coli in its crystal differ substantially on account of the binding of the C terminus of the E. coli enzyme to the peptide-binding site of a neighboring molecule in the crystal. A detailed examination of this difference led to an elucidation of the plasticity of the binding site of the enzyme. The peptide-binding site of the enzyme is a cleft between the body, of the molecule and a polypepticle Y stretch involving a loop and a helix. This stretch is in the open conformation when the enzyme is in the free state as in the crystals of M. tuberculosis peptidyl-tRNA hydrolase. Furthermore, there is no physical continuity between the tRNA and the peptide-binding sites. The molecule in the E. coli crystal mimics the peptide-bound enzyme molecule. The peptide stretch referred to earlier now closes on the bound peptide. Concurrently, a channel connecting the tRNA and the peptide-binding site opens primarily through the concerted movement of two residues. Thus, the crystal structure of M. tuberculosis peptidyl-tRNA hydrolase when compared with the crystal structure of the E. coli enzyme, leads to a model of structural changes associated with enzyme action on the basis of the plasticity of the molecule. (c) 2007 Elsevier Ltd. All rights reserved.

An agent based adaptive bandwidth allocation scheme for multimedia applications

Bandwidth allocation for multimedia applications in case of network congestion and failure poses technical challenges due to bursty and delay sensitive nature of the applications. The growth of multimedia services on Internet and the development of agent technology have made us to investigate new techniques for resolving the bandwidth issues in multimedia communications. Agent technology is emerging as a flexible promising solution for network resource management and QoS (Quality of Service) control in a distributed environment. In this paper, we propose an adaptive bandwidth allocation scheme for multimedia applications by deploying the static and mobile agents. It is a run-time allocation scheme that functions at the network nodes. This technique adaptively finds an alternate patchup route for every congested/failed link and reallocates the bandwidth for the affected multimedia applications. The designed method has been tested (analytical and simulation)with various network sizes and conditions. The results are presented to assess the performance and effectiveness of the approach. This work also demonstrates some of the benefits of the agent based schemes in providing flexibility, adaptability, software reusability, and maintainability. (C) 2004 Elsevier Inc. All rights reserved.

NSs Encoded by Groundnut Bud Necrosis Virus Is a ifunctional Enzyme

Groundnut bud necrosis virus (GBNV), a member of genus Tospovirus in the family Bunyaviridae, infects a large number of leguminosae and solanaceae plants in India. With a view to elucidate the function of nonstructural protein, NSs encoded by the small RNA genome (S RNA), the NSs protein of GBNV-tomato (Karnataka) [1] was over-expressed in E.coli and purified by Ni-NTA chromatography. The purified rNSs protein exhibited an RNA stimulated NTPase activity. Further, this activity was metal ion dependent and was inhibited by adenosine 5' (beta, gamma imido) triphosphate, an ATP analog. The rNSs could also hydrolyze dATP.Interestingly, in addition to the NTPase and dATPase activities, the rNSs exhibited ATP independent 5' RNA/DNA phosphatase activity that was completely inhibited by AMP. The 5' alpha phosphate could be removed from ssDNA, ssRNA, dsDNA and dsRNA thus confirming that rNSs has a novel 5' alpha phosphatase activity. K189A mutation in the Walker motif A (GxxxxGKT) resulted in complete loss of ATPase activity, but the 5'phosphatase activity was unaffected. On the other hand, D159A mutation in the Walker motif B (DExx) resulted in partial loss of both the activities. These results demonstrate for the first time that NSs is a bifunctional enzyme, which could participate in viral movement, replication or in suppression of the host defense mechanism.

A Model of Anomalous Enzyme-Catalyzed Gel Degradation Kinetics

We show that a model of target location involving n noninteracting particles moving subdiffusively along a line segment (a generalization of a model introduced by Sokolov et al. [Biophys. J. 2005, 89, 895.]) provides a basis for understanding recent experiments by Pelta et al. [Phys. Rev. Lett. 2007, 98, 228302.] on the kinetics of diffusion-limited gel degradation. These experiments find that the time t(c) taken by the enzyme thermolysin to completely hydrolyze a gel varies inversely as roughly the 3/2 power of the initial enzyme concentration [E]. In general, however, this time would be expected to vary either as [E](-1) or as [E](-2), depending on whether the Brownian diffusion of the enzyme to the site of cleavage took place along the network chains (1-d diffusion) or through the pore spaces (3-d diffusion). In our model, the unusual dependence of t(c) on [E] is explained in terms of a reaction-diffusion equation that is formulated in terms of fractional rather than ordinary time derivatives.

Hybrid learning scheme for data mining applications

Classification of large datasets is a challenging task in Data Mining. In the current work, we propose a novel method that compresses the data and classifies the test data directly in its compressed form. The work forms a hybrid learning approach integrating the activities of data abstraction, frequent item generation, compression, classification and use of rough sets.