How does mobility help distributed systems compute?
Ontology highlight
ABSTRACT:
SUBMITTER: Vining WF
PROVIDER: S-EPMC6553594 | biostudies-literature | 2019 Jun
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:A distributed biological system can be defined as a system whose components are located in different subpopulations, which communicate and coordinate their actions through interpopulation messages and interactions. We see that distributed systems are pervasive in nature, performing computation across all scales, from microbial communities to a flock of birds. We often observe that information processing within communities exhibits a complexity far greater than any single organism. Synthetic biology is an area of research which aims to design and build synthetic biological machines from biological parts to perform a defined function, in a manner similar to the engineering disciplines. However, the field has reached a bottleneck in the complexity of the genetic networks that we can implement using monocultures, facing constraints from metabolic burden and genetic interference. This makes building distributed biological systems an attractive prospect for synthetic biology that would alleviate these constraints and allow us to expand the applications of our systems into areas including complex biosensing and diagnostic tools, bioprocess control and the monitoring of industrial processes. In this review we will discuss the fundamental limitations we face when engineering functionality with a monoculture, and the key areas where distributed systems can provide an advantage. We cite evidence from natural systems that support arguments in favor of distributed systems to overcome the limitations of monocultures. Following this we conduct a comprehensive overview of the synthetic communities that have been built to date, and the components that have been used. The potential computational capabilities of communities are discussed, along with some of the applications that these will be useful for. We discuss some of the challenges with building co-cultures, including the problem of competitive exclusion and maintenance of desired community composition. Finally, we assess computational frameworks currently available to aide in the design of microbial communities and identify areas where we lack the necessary tools.
| S-EPMC7387671 | biostudies-literature
Project description:Virulent phages can expose their bacterial hosts to devastating epidemics, in principle leading to complete elimination of their hosts. Although experiments indeed confirm a large reduction of susceptible bacteria, there are no reports of complete extinctions. We here address this phenomenon from the perspective of spatial organization of bacteria and how this can influence the final survival of them. By modelling the transient dynamics of bacteria and phages when they are introduced into an environment with finite resources, we quantify how time delayed lysis, the spatial separation of initial bacterial positions, and the self-protection of bacteria growing in spherical colonies favour bacterial survival. Our results suggest that spatial structures on the millimetre and submillimetre scale play an important role in maintaining microbial diversity.
| S-EPMC7035299 | biostudies-literature
Project description:Distributed architectures for efficient processing of streaming data are increasingly critical to modern information processing systems. The goal of this paper is to develop type-based programming abstractions that facilitate correct and efficient deployment of a logical specification of the desired computation on such architectures. In the proposed model, each communication link has an associated type specifying tagged data items along with a dependency relation over tags that captures the logical partial ordering constraints over data items. The semantics of a (distributed) stream processing system is then a function from input data traces to output data traces, where a data trace is an equivalence class of sequences of data items induced by the dependency relation. This data-trace transduction model generalizes both acyclic synchronous data-flow and relational query processors, and can specify computations over data streams with a rich variety of partial ordering and synchronization characteristics. We then describe a set of programming templates for data-trace transductions: abstractions corresponding to common stream processing tasks. Our system automatically maps these high-level programs to a given topology on the distributed implementation platform Apache Storm while preserving the semantics. Our experimental evaluation shows that (1) while automatic parallelization deployed by existing systems may not preserve semantics, particularly when the computation is sensitive to the ordering of data items, our programming abstractions allow a natural specification of the query that contains a mix of ordering constraints while guaranteeing correct deployment, and (2) the throughput of the automatically compiled distributed code is comparable to that of hand-crafted distributed implementations.
| S-EPMC6810609 | biostudies-literature
Project description:Resilience, defined as the ability of a system to adapt in the presence of a disruptive event, has been of great interest with food systems for some time now. The goal of this research was to build understanding about resilient food systems that will withstand and recover from disruptions in a way that ensures a sufficient supply of food for all. In large, developed countries such as the USA and Canada, the food supply chain relies on a complex web of interconnected systems, such as water and energy systems, and food production and distribution are still very labor-intensive. Thanks to economies of scale and effective use of limited resources, potential cost savings support a push towards a more centralized system. However, distributed systems tend to be more resilient. Although distributed production systems may not be economically justifiable than centralized ones, they may provide a more resilient alternative. This study focused on the supply-side aspects of the food system and the food system's water, energy, and workforce disruptions to be considered for the resilience assessment for the USA, with an example for the state of Texas. After the degree of centralization (DoC) was calculated, the resilience of a food system was measured. Next, the relationship between labor intensity and production of six major food groups was formulated. The example for Texas showed that the decentralization of food systems will improve their resilience in responding to energy and water disruptions. A 40 percent reduction in water supply could decrease the food system performance by 28%. A negative correlation was found between the resilience and DoC for energy disruption scenarios. A 40 percent reduction in energy supply could decrease the food system performance by 34%. In contrast, achieving a more resilient food system in responding to labor shortage supports a push towards a more centralized system the decentralization of food systems can in fact, improve their resilience in responding to disruptions in the energy and water inputs. In contrast, achieving a more resilient food system in responding to labor shortage supports a push towards a more centralized system.Supplementary informationThe online version contains supplementary material available at 10.1007/s12571-022-01321-9.
| S-EPMC9514695 | biostudies-literature
Project description:There is increasing international policy and clinical interest in developing learning health systems and delivering precision medicine, which it is hoped will help reduce variation in the quality and safety of care, improve efficiency, and lead to increasing the personalisation of healthcare. Although reliant on similar policies, informatics tools, and data science and implementation research capabilities, these two major initiatives have thus far largely progressed in parallel. In this opinion piece, we argue that they should be considered as complementary, synergistic initiatives whereby the creation of learning health systems infrastructure can support and catalyse the delivery of precision medicine that maximises the benefits and minimises the risks associated with treatments for individual patients. We illustrate this synergy by considering the example of treatments for asthma, which is now recognised as an umbrella term for a heterogeneous group of related conditions.
| S-EPMC5623976 | biostudies-literature
Project description:In big data area a significant challenge about string similarity join is to find all similar pairs more efficiently. In this paper, we propose a parallel processing framework for efficient string similarity join. First, the input is split into some disjoint small subsets according to the joint frequency distribution and the interval distribution of strings. Then the filter-verification strategy is adopted in the computation of string similarity for each subset so that the number of candidate pairs is reduced before an effective pruning strategy is used to improve the performance. Finally, the operation of string join is executed in parallel. Para-Join algorithm based on the multi-threading technique is proposed to implement the framework in a multi-core system while Pada-Join algorithm based on Spark platform is proposed to implement the framework in a cluster system. We prove that Para-Join and Pada-Join cannot only avoid reduplicate computation but also ensure the completeness of the result. Experimental results show that Para-Join can achieve high efficiency and significantly outperform than state-of-the-art approaches, meanwhile, Pada-Join can work on large datasets.
| S-EPMC5344375 | biostudies-other
Project description:SummaryComplex computational experiments in Systems Biology, such as fitting model parameters to experimental data, can be challenging to perform. Not only do they frequently require a high level of computational power, but the software needed to run the experiment needs to be usable by scientists with varying levels of computational expertise, and modellers need to be able to obtain up-to-date experimental data resources easily. We have developed a software suite, the Systems Biology Software Infrastructure (SBSI), to facilitate the parameter-fitting process. SBSI is a modular software suite composed of three major components: SBSINumerics, a high-performance library containing parallelized algorithms for performing parameter fitting; SBSIDispatcher, a middleware application to track experiments and submit jobs to back-end servers; and SBSIVisual, an extensible client application used to configure optimization experiments and view results. Furthermore, we have created a plugin infrastructure to enable project-specific modules to be easily installed. Plugin developers can take advantage of the existing user-interface and application framework to customize SBSI for their own uses, facilitated by SBSI's use of standard data formats.Availability and implementationAll SBSI binaries and source-code are freely available from http://sourceforge.net/projects/sbsi under an Apache 2 open-source license. The server-side SBSINumerics runs on any Unix-based operating system; both SBSIVisual and SBSIDispatcher are written in Java and are platform independent, allowing use on Windows, Linux and Mac OS X. The SBSI project website at http://www.sbsi.ed.ac.uk provides documentation and tutorials.
| S-EPMC3582266 | biostudies-literature
Project description:Distributed Systems architectures are becoming the standard computational model for processing and transportation of information, especially for Cloud Computing environments. The increase in demand for application processing and data management from enterprise and end-user workloads continues to move from a single-node client-server architecture to a distributed multitier design where data processing and transmission are segregated. Software development must considerer the orchestration required to provision its core components in order to deploy the services efficiently in many independent, loosely coupled-physically and virtually interconnected-data centers spread geographically, across the globe. This network routing challenge can be modeled as a variation of the Travelling Salesman Problem (TSP). This paper proposes a new optimization algorithm for optimum route selection using Algorithmic Information Theory. The Kelly criterion for a Shannon-Bernoulli process is used to generate a reliable quantitative algorithm to find a near optimal solution tour. The algorithm is then verified by comparing the results with benchmark heuristic solutions in 3 test cases. A statistical analysis is designed to measure the significance of the results between the algorithms and the entropy function can be derived from the distribution. The tested results shown an improvement in the solution quality by producing routes with smaller length and time requirements. The quality of the results proves the flexibility of the proposed algorithm for problems with different complexities without relying in nature-inspired models such as Genetic Algorithms, Ant Colony, Cross Entropy, Neural Networks, 2opt and Simulated Annealing. The proposed algorithm can be used by applications to deploy services across large cluster of nodes by making better decision in the route design. The findings in this paper unifies critical areas in Computer Science, Mathematics and Statistics that many researchers have not explored and provided a new interpretation that advances the understanding of the role of entropy in decision problems encoded in Turing Machines.
| S-EPMC7781673 | biostudies-literature