Load-Balancing Parallel Relational Algebra
Ontology highlight
ABSTRACT:
SUBMITTER: Sadayappan P
PROVIDER: S-EPMC7295339 | biostudies-literature | 2020 May
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Acorn barnacle adults experience environmental heterogeneity at various spatial scales of their circumboreal habitat, raising the question of how adaptation to high environmental variability is maintained in the face of strong juvenile dispersal and mortality. Here, we show that 4% of genes in the barnacle genome experience balancing selection across the entire range of the species. Many of these genes harbor mutations maintained across 2 My of evolution between the Pacific and Atlantic oceans. These genes are involved in ion regulation, pain reception, and heat tolerance, functions which are essential in highly variable ecosystems. The data also reveal complex population structure within and between basins, driven by the trans-Arctic interchange and the last glaciation. Divergence between Atlantic and Pacific populations is high, foreshadowing the onset of allopatric speciation, and suggesting that balancing selection is strong enough to maintain functional variation for millions of years in the face of complex demography.
| S-EPMC7826171 | biostudies-literature
Project description:BackgroundGenome-scale metabolic models are increasingly employed to predict the phenotype of various biological systems pertaining to healthcare and bioengineering. To characterize the full metabolic spectrum of such systems, Fast Flux Variability Analysis (FFVA) is commonly used in parallel with static load balancing. This approach assigns to each core an equal number of biochemical reactions without consideration of their solution complexity.ResultsHere, we present Very Fast Flux Variability Analysis (VFFVA) as a parallel implementation that dynamically balances the computation load between the cores in runtime which guarantees equal convergence time between them. VFFVA allowed to gain a threefold speedup factor with coupled models and up to 100 with ill-conditioned models along with a 14-fold decrease in memory usage.ConclusionsVFFVA exploits the parallel capabilities of modern machines to enable biological insights through optimizing systems biology modeling. VFFVA is available in C, MATLAB, and Python at https://github.com/marouenbg/VFFVA .
| S-EPMC7523073 | biostudies-literature
Project description:Grid environment consists of millions of dynamic and heterogeneous resources. A grid environment which deals with computing resources is computational grid and is meant for applications that involve larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Allocation of resources is a tedious issue since it has to consider several requirements such as system load, processing cost and time, user's deadline, and resource failure. This work attempts to design a resource allocation algorithm which is budget constrained and also targets load balancing, fault tolerance, and user satisfaction by considering the above requirements. The proposed Multiconstrained Load Balancing Fault Tolerant algorithm (MLFT) reduces the schedule makespan, schedule cost, and task failure rate and improves resource utilization. The proposed MLFT algorithm is evaluated using Gridsim toolkit and the results are compared with the recent algorithms which separately concentrate on all these factors. The comparison results ensure that the proposed algorithm works better than its counterparts.
| S-EPMC4469845 | biostudies-other
Project description:On-demand cloud computing is one of the rapidly evolving technologies that is being widely used in the industries now. With the increase in IoT devices and real-time business analytics requirements, enterprises that ought to scale up and scale down their services have started coming towards on-demand cloud computing service providers. In a cloud data center, a high volume of continuous incoming task requests to physical hosts makes an imbalance in the cloud data center load. Most existing works balance the load by optimizing the algorithm in selecting the optimal host and achieves instantaneous load balancing but with execution inefficiency for tasks when carried out in the long run. Considering the long-term perspective of load balancing, the research paper proposes Stackelberg (leader-follower) game-theoretical model reinforced with the satisfaction factor for selecting the optimal physical host for deploying the tasks arriving at the data center in a balanced way. Stackelberg Game Theoretical Model for Load Balancing (SGMLB) algorithm deploys the tasks on the host in the data center by considering the utilization factor of every individual host, which helps in achieving high resource utilization on an average of 60%. Experimental results show that the Stackelberg equilibrium incorporated with a satisfaction index has been very useful in balancing the loading across the cluster by choosing the optimal hosts. The results show better execution efficiency in terms of the reduced number of task failures by 47%, decreased 'makespan' value by 17%, increased throughput by 6%, and a decreased front-end error rate as compared to the traditional random allocation algorithms and flow-shop scheduling algorithm.
| S-EPMC7170225 | biostudies-literature
Project description:HIV viral load (VL) predicts both transmission potential and rate of disease progression. For reasons that are still not fully understood, the set point viral load (SPVL) established after acute infection varies across individuals and populations. Previous studies have suggested that population mean SPVL (MSPVL) has evolved near an optimum that reflects a trade-off between transmissibility and host survival. Sexual network structures affect rates of potential exposure during different within-host phases of infection marked by different transmission probabilities, and thus affect the number and timing of transmission events. These structures include relational concurrency, which has been argued to explain key differences in HIV burden across populations. We hypothesize that concurrency will alter the fitness landscape for SPVL in ways that differ from other network features whose impacts accrue at other times during infection. To quantitatively test this hypothesis, we developed a dynamic, stochastic, data-driven network model of HIV transmission, and evolution to assess the impact of key sexual network phenomena on MSPVL evolution. Experiments were repeated in sensitivity runs that made different assumptions about transmissibility during acute infection, SPVL heritability, and the functional form of the relationship between VL and transmissibility. For our main transmission model, scenarios yielded MSPVLs ranging from 4.4 to 4.75 log10 copies/ml, covering much of the observed empirical range. MSPVL evolved to be higher in populations with high concurrency and shorter relational durations, with values varying over a clinically significant range. In linear regression analyses on these and other predictors, main effects were significant (P < 0.05), as were interaction terms, indicating that effects are interdependent. We also noted a strong correlation between two key emergent properties measured at the end of the simulations-MSPVL and HIV prevalence-most clearly for phenomena that affect transmission networks early in infection. Controlling for prevalence, high concurrency yielded higher MSPVL than other network phenomena. Interestingly, we observed lower prevalence in runs in which SPVL heritability was zero, indicating the potential for viral evolution to exacerbate disease burden over time. Future efforts to understand empirical variation in MSPVL should consider local HIV burden and basic sexual behavioral and network structure.
| S-EPMC6249390 | biostudies-literature
Project description:The majority of neuroimaging studies focus on brain activity during performance of cognitive tasks; however, some studies focus on brain areas that activate in the absence of a task. Despite the surge of research comparing these contrasted areas of brain function, their interrelation is not well understood. We systematically manipulated cognitive load in a working memory task to examine concurrently the relation between activity elicited by the task versus activity during control conditions. We presented adults with six levels of task demand, and compared those with three conditions without a task. Using whole-brain analysis, we found positive linear relations between cortical activity and task difficulty in areas including middle frontal gyrus and dorsal cingulate; negative linear relations were found in medial frontal gyrus and posterior cingulate. These findings demonstrated balancing of activation patterns between two mental processes, which were both modulated by task difficulty. Frontal areas followed a graded pattern more closely than other regions. These data also showed that working memory has limited capacity in adults: an upper bound of seven items and a lower bound of four items. Overall, working memory and default-mode processes, when studied concurrently, reveal mutually competing activation patterns.
| S-EPMC3683287 | biostudies-literature
Project description:In the educational field, the system performance, as well as the stakeholders' satisfaction, are considered a bottleneck in the e-learning system due to the high number of users who are represented in the educational system's stakeholders including instructors and students. On the other hand, successful resource utilization in cloud systems is one of the key factors for increasing system performance which is strongly related to the ability for the optimal load distribution. In this study, a novel load-balancing algorithm is proposed. The proposed algorithm aims to optimize the educational system's performance and, consequently, the users' satisfaction in the educational field represented by the students. The proposed enhancement in the e-learning system has been evaluated by two methods, first, a simulation experiment for confirming the applicability of the proposed algorithm. Then a real-case experiment has been applied to the e-learning system at Helwan University. The results revealed the advantages of the proposed algorithm over other well-known load balancing algorithms. A questionnaire was also developed to measure the users' satisfaction with the system's performance. A total of 3,670 thousand out of 5,000 students have responded, and the results have revealed a satisfaction percentage of 95.4% in the e-learning field represented by the students.
| S-EPMC8444070 | biostudies-literature
Project description:The ethics of hope has often been understood as a conflict between duties: do not lie versus do not destroy hope. However, such a way of framing the ethics of hope may easily place healthcare professionals at the side of realism and patients at the side of (false) hope. That leaves unexamined relational dimensions of hope. The objective of this study was to describe a relational ethics of hope based on the perspectives of palliative care patients, their family members and their healthcare professionals. A qualitative longitudinal method based on narrative theories was used. Semi-structured interviews on hope were conducted with twenty-nine palliative care patients, nineteen friends or family members, and fifty-two healthcare professionals, which were recorded and transcribed. Data on hope were thematically analyzed. The researchers wrote memos and did member checking with participants. When participants spoke about hope, they referred to power and empowerment, like the powerful bonding of hope between patients and physicians. They also associated hope with the loss of hope and suffering. Several participating healthcare professionals tried to balance both sides, which involved acknowledgment of hope and suffering. Hope and power were reflected in the ethical concept of empowerment, whereas suffering and the loss of hope were reflected in the ethical concept of compassion. Empowerment and compassion can be balanced in solicitude. In conclusion, a relational ethics of hope requires solicitude, in which healthcare professionals are able to weigh empowerment and compassion within particular relationships.
| S-EPMC4805712 | biostudies-other
Project description:MotivationBeyond identifying genetic variants, we introduce a set of Boolean relations, which allows for a comprehensive classification of the relations of every pair of variants by taking all minimal alignments into account. We present an efficient algorithm to compute these relations, including a novel way of efficiently computing all minimal alignments within the best theoretical complexity bounds.ResultsWe show that these relations are common, and many non-trivial, for variants of the CFTR gene in dbSNP. Ultimately, we present an approach for the storing and indexing of variants in the context of a database that enables efficient querying for all these relations.Availability and implementationA Python implementation is available at https://github.com/mutalyzer/algebra/tree/v0.2.0 as well as an interface at https://mutalyzer.nl/algebra.
| S-EPMC9879725 | biostudies-literature
Project description:Superenhancers are crucial structural genomic elements determining cell fate, and they are also involved in the determination of several diseases, such as cancer or neurodegeneration. Although there are pipelines which use independent pieces of software to predict the presence of superenhancers from genome-wide chromatin marks or DNA-interaction protein binding sites, there is not yet an integrated software tool that processes automatically algebra combinations of raw data sequencing into a comprehensive final annotated report of predicted superenhancers.We have developed NaviSE, a user-friendly streamlined tool which performs a fully-automated parallel processing of genome-wide epigenomics data from sequencing files into a final report, built with a comprehensive set of annotated files that are navigated through a graphic user interface dynamically generated by NaviSE. NaviSE also implements an 'epigenomics signal algebra' that allows the combination of multiple activation and repression epigenomics signals. NaviSE provides an interactive chromosomal landscaping of the locations of superenhancers, which can be navigated to obtain annotated information about superenhancer signal profile, associated genes, gene ontology enrichment analysis, motifs of transcription factor binding sites enriched in superenhancers, graphs of the metrics evaluating the superenhancers quality, protein-protein interaction networks and enriched metabolic pathways among other features. We have parallelised the most time-consuming tasks achieving a reduction up to 30% for a 15 CPUs machine. We have optimized the default parameters of NaviSE to facilitate its use. NaviSE allows different entry levels of data processing, from sra-fastq files to bed files; and unifies the processing of multiple replicates. NaviSE outperforms the more time-consuming processes required in a non-integrated pipeline. Alongside its high performance, NaviSE is able to provide biological insights, predicting cell type specific markers, such as SOX2 and ZIC3 in embryonic stem cells, CDK5R1 and REST in neurons and CD86 and TLR2 in monocytes.NaviSE is a user-friendly streamlined solution for superenhancer analysis, annotation and navigation, requiring only basic computer and next generation sequencing knowledge. NaviSE binaries and documentation are available at: https://sourceforge.net/projects/navise-superenhancer/ .
| S-EPMC5461685 | biostudies-literature