SPSRG: a prediction approach for correlated failures in distributed computing systems

Failure instances in distributed computing systems (DCSs) have exhibited temporal and spatial correlations, where a single failure instance can trigger a set of failure instances simultaneously or successively within a short time interval. In this work, we propose a correlated failure prediction approach (CFPA) to predict correlated failures of computing elements in DCSs. The approach models correlated-failure patterns using the concept of probabilistic shared risk groups and makes a prediction for correlated failures by exploiting an association rule mining approach in a parallel way. We conduct extensive experiments to evaluate the feasibility and effectiveness of CFPA using both failure traces from Los Alamos National Lab and simulated datasets. The experimental results show that the proposed approach outperforms other approaches in both the failure prediction performance and the execution time, and can potentially provide better prediction performance in a larger system.     

生物信息学中的分布式计算

生物信息学的发展给计算机技术带来了挑战,通过介绍当前在生物信息学研究领域已经得到广泛使用或正在研发的各种分布式计算平台、工具或研究项目,以此来概观生物信息学领域中分布式计算应用的现状。     

DSEARCH: sensitive database searching using distributed computing

SUMMARY: We present a distributed and fully cross-platform database search program that allows the user to utilize the idle clock cycles of machines to perform large searches using the most sensitive algorithms. For those in an academic or corporate environment with hundreds of idle desktop machines, DSEARCH can deliver a 'free' database search supercomputer. AVAILABILITY: The software is publicly available under the GNU general public licence from http://www.cs.may.ie/distributed CONTACT: tom.naughton@may.ie SUPPLEMENTARY INFORMATION: Full documentation and a user manual is available from http://www.cs.may.ie/distributed.     

Distributed computing in bioinformatics

This paper provides an overview of methods and current applications of distributed computing in bioinformatics. Distributed computing is a strategy of dividing a large workload among multiple computers to reduce processing time, or to make use of resources such as programs and databases that are not available on all computers. Participating computers may be connected either through a local high-speed network or through the Internet.     

ClustalW-MPI: ClustalW analysis using distributed and parallel computing

ClustalW is a tool for aligning multiple protein or nucleotide sequences. The alignment is achieved via three steps: pairwise alignment, guide-tree generation and progressive alignment. ClustalW-MPI is a distributed and parallel implementation of ClustalW. All three steps have been parallelized to reduce the execution time. The software uses a message-passing library called MPI (Message Passing Interface) and runs on distributed workstation clusters as well as on traditional parallel computers.     

Global computing for bioinformatics

Global computing, the collaboration of idle PCs via the Internet in a SETI@home style, emerges as a new way of massive parallel multiprocessing with potentially enormous CPU power. Its relations to the broader, fast-moving field of Grid computing are discussed without attempting a review of the latter. This review (i) includes a short table of milestones in global computing history, (ii) lists opportunities global computing offers for bioinformatics, (iii) describes the structure of problems well suited for such an approach, (iv) analyses the anatomy of successful projects and (v) points to existing software frameworks. Finally, an evaluation of the various costs shows that global computing indeed has merit, if the problem to be solved is already coded appropriately and a suitable global computing framework can be found. Then, either significant amounts of computing power can be recruited from the general public, or--if employed in an enterprise-wide Intranet for security reasons--idle desktop PCs can substitute for an expensive dedicated cluster.     

FRASystem: fault tolerant system using agents in distributed computing systems

In this paper, we present a fault tolerant and recovery system called FRASystem (Fault Tolerant & Recovery Agent System) using multi-agent in distributed computing systems. Previous rollback-recovery protocols were dependent on an inherent communication and an underlying operating system, which caused a decline of computing performance. We propose a rollback-recovery protocol that works independently on an operating system and leads to an increasing portability and extensibility. We define four types of agents: (1) a recovery agent performs a rollback-recovery protocol after a failure, (2) an information agent constructs domain knowledge as a rule of fault tolerance and information during a failure-free operation, (3) a facilitator agent controls the communication between agents, (4) a garbage collection agent performs garbage collection of the useless fault tolerance information. Since agent failures may lead to inconsistent states of a system and a domino effect, we propose an agent recovery algorithm. A garbage collection protocol addresses the performance degradation caused by the increment of saved fault tolerance information in a stable storage. We implemented a prototype of FRASystem using Java and CORBA and experimented the proposed rollback-recovery protocol. The simulations results indicate that the performance of our protocol is better than previous rollback-recovery protocols which use independent checkpointing and pessimistic message logging without using agents. Our contributions are as follows: (1) this is the first rollback-recovery protocol using agents, (2) FRASystem is not dependent on an operating system, and (3) FRASystem provides a portability and extensibility.     

Protein complex prediction using an integrative bioinformatics approach

Since protein complexes play a crucial role in biological cells, one of the major goals in bioinformatics is the elucidation of protein complexes. A general approach is to build a prediction rule based on multiple data sources, e.g. gene expression data and protein interaction data, to assess the likelihood of two proteins having complex association. We critically revisit the step of predictor construction, i.e. the determination of a proper training set, an optimal classifier, and, most importantly, an optimal feature set. We use an exhaustive set of features, which includes the 2hop-feature as introduced by Wong et al. for predicting synthetic sick or lethal interactions. Post-processing of the likelihoods of protein interaction is then required to extract protein complexes. We propose a new protocol for combining these likelihood estimates. The protocol interprets the probabilities of complex association as output by the prediction rule as distances and employs hierarchical clustering to find groups of interacting proteins. In contrast to the computationally expensive search-and-score approach of Sharan et al., this protocol is very fast and can be applied to fully connected graphs. The protocol identifies trusted protein complexes with high confidence. We show that the 2hop-feature is relevant for predicting protein complexes. Furthermore, several interesting hypotheses about new protein complexes have been generated. For example, our approach linked the protein FYV4 to the mitochondrial ribosomal subunit. Interestingly, it is known that this protein is located in the mitochondrion, but its biological role is unknown. Vid22 and YGR071C were also linked, which corresponds to the new TAP data of Krogan et al.     

A self-scalable distributed network simulation environment based on cloud computing

While parameter sweep simulations can help undergraduate students and researchers to understand computer networks, their usage in the academia is hindered by the significant computational load they convey. This paper proposes DNSE3, a service oriented computer network simulator that, deployed in a cloud computing infrastructure, leverages its elasticity and pay-per-use features to compute parameter sweeps. The performance and cost of using this application is evaluated in several experiments applying different scalability policies, with results that meet the demands of users in educational institutions. Additionally, the usability of the application has been measured following industry standards with real students, yielding a very satisfactory user experience.     

Preeclampsia: a bioinformatics approach through protein-protein interaction networks analysis

ABSTRACT: BACKGROUND: In this study we explored preeclampsia through a bioinformatics approach. We create a comprehensive genes/proteins dataset by the analysis of both public proteomic data and text mining of public scientific literature. From this dataset the associated protein-protein interaction network has been obtained. Several indexes of centrality have been explored for hubs detection as well as the enrichment statistical analysis of metabolic pathway and disease. RESULTS: We confirmed the well known relationship between preeclampsia and cardiovascular diseases but also identified statistically significant relationships with respect to cancer and aging. Moreover, significant metabolic pathways such as apoptosis, cancer and cytokine-cytokine receptor interaction have also been identified by enrichment analysis. We obtained FLT1, VEGFA, FN1, F2 and PGF genes with the highest scores by hubs analysis; however, we also found other genes as PDIA3, LYN, SH2B2 and NDRG1 with high scores. CONCLUSIONS: The applied methodology not only led to the identification of well known genes related to preeclampsia but also to propose new candidates poorly explored or completely unknown in the pathogenesis of preeclampsia, which eventually need to be validated experimentally. Moreover, new possible connections were detected between preeclampsia and other diseases that could open new areas of research. More must be done in this area to resolve the identification of unknown interactions of proteins/genes and also for a better integration of metabolic pathways and diseases.     

An innovative approach for testing bioinformatics programs using metamorphic testing

Background  

Recent advances in experimental and computational technologies have fueled the development of many sophisticated bioinformatics programs. The correctness of such programs is crucial as incorrectly computed results may lead to wrong biological conclusion or misguide downstream experimentation. Common software testing procedures involve executing the target program with a set of test inputs and then verifying the correctness of the test outputs. However, due to the complexity of many bioinformatics programs, it is often difficult to verify the correctness of the test outputs. Therefore our ability to perform systematic software testing is greatly hindered.     

An integrated approach towards aggressive state-tracking migration for maximizing performance benefit in distributed computing

This paper presents a new state-tracking migration scheme that is integrated with aggressive reservation strategies such as immediate restart, greedy backfilling and selective preemption. The main contribution of this paper is an analysis of the effects of three techniques that can be used beyond the conventional migration schemes. Our simulation results suggest that state-tracking migration with selective preemption entirely outperforms the others. We also observe that the overall performance of immediate restart strategy combining to migration can be stably maintained under various job lifetime distributions. Moreover, it is found that performance would be improved by fitting jobs ruled by the immediate restart strategy rather than queued jobs into the void-intervals under the state-tracking migration scheme.     

GRIMD: distributed computing for chemists and biologists

Motivation: Biologists and chemists are facing problems of high computational complexity that require the use of several computers organized in clusters or in specialized grids. Examples of such problems can be found in molecular dynamics (MD), in silico screening, and genome analysis. Grid Computing and Cloud Computing are becoming prevalent mainly because of their competitive performance/cost ratio. Regrettably, the diffusion of Grid Computing is strongly limited because two main limitations: it is confined to scientists with strong Computer Science background and the analyses of the large amount of data produced can be cumbersome it. We have developed a package named GRIMD to provide an easy and flexible implementation of distributed computing for the Bioinformatics community. GRIMD is very easy to install and maintain, and it does not require any specific Computer Science skill. Moreover, permits preliminary analysis on the distributed machines to reduce the amount of data to transfer. GRIMD is very flexible because it shields the typical computational biologist from the need to write specific code for tasks such as molecular dynamics or docking calculations. Furthermore, it permits an efficient use of GPU cards whenever is possible. GRIMD calculations scale almost linearly and, therefore, permits to exploit efficiently each machine in the network. Here, we provide few examples of grid computing in computational biology (MD and docking) and bioinformatics (proteome analysis).

Availability

GRIMD is available for free for noncommercial research at www.yadamp.unisa.it/grimd

Supplementary information

www.yadamp.unisa.it/grimd/howto.aspx     

birgHPC: creating instant computing clusters for bioinformatics and molecular dynamics

birgHPC, a bootable Linux Live CD has been developed to create high-performance clusters for bioinformatics and molecular dynamics studies using any Local Area Network (LAN)-networked computers. birgHPC features automated hardware and slots detection as well as provides a simple job submission interface. The latest versions of GROMACS, NAMD, mpiBLAST and ClustalW-MPI can be run in parallel by simply booting the birgHPC CD or flash drive from the head node, which immediately positions the rest of the PCs on the network as computing nodes. Thus, a temporary, affordable, scalable and high-performance computing environment can be built by non-computing-based researchers using low-cost commodity hardware. AVAILABILITY: The birgHPC Live CD and relevant user guide are available for free at http://birg1.fbb.utm.my/birghpc.     

The ubiquity of the insulin superfamily across the eukaryotes detected using a bioinformatics approach

The insulin superfamily is composed of a diverse group of proteins that share a common structural design whose most notable feature is a set of disulfide bonds. There is now sufficient experimental and bioinformatics evidence that it is represented in at least a number of well-investigated invertebrates, where they have been found to intervene mainly in complex processes such as mitosis, cell growth, castes differentiation, and fertility. In this article we automated a methodology first proposed elsewhere-that combines sequence similarity with assessing membership to the superfamily by conservation of structuraly key residues-to identify putative insulin-like peptides (ILPs) in completely sequenced genomes, and applied it as a pipeline to a group of 46 organisms both vertebrates and invertebrates. As a result, we were able to identify 1,653 putative members of the insulin superfamily, from 17 putative members in C. savigny to 58 in X. tropicalis. Moreover, we found that structural distinctions-such as peptides length-between functionally diverse members of the superfamily found in vertebrates, that is, insulins, IGFs, and relaxins, are not equally represented in invertebrates genomes, suggesting that such divergence has occurred only recently in the evolutionary history of vertebrates.     

New insights into the allergenicity of tropomyosin: a bioinformatics approach

The invertebrate panallergen tropomyosin is a protein with an extremely simple folding. This makes it a perfect target for investigating structural differences between invertebrate and vertebrate tropomyosins, which are not considered allergenic. Phylogenetic and sequence analyses were conducted in order to explore the differences in primary structure between several tropomyosins and to promote an experimental development in the field of food allergy, based on the study of tropomyosin. The phylogenetic analyses showed that tropomyosin is a useful evolutionary marker. The phylogenetic trees obtained with tropomyosin were not always phylogenetically correct, but they might be useful for allergen avoidance by tropomyosin allergic individuals. Sequence analyses revealed that the probability of alpha helix folding in invertebrate tropomyosins was lower than in all the studied vertebrate ones, except for the Atlantic bluefin tuna Thunnus thynnus tropomyosin. This suggested that the lack of alpha helix folding may be involved in the immunogenicity of tropomyosins. More specifically, the regions adjacent to the positions 133–135 and 201 of the invertebrate tropomyosins, presented lower probability of alpha helix folding than those of vertebrates and are candidates to be responsible for their allergenicity.     

Multi-objective Task Scheduling in cloud-fog computing using goal programming approach

Cluster Computing - Fog Computing continues to extend its usage by solving cloud computing challenges about Internet of Things (IoT). Fog nodes as a processing resource, can perform tasks generated...