Search results for "Distributed computing"
showing 10 items of 622 documents
Towards human cell simulation
2019
The faithful reproduction and accurate prediction of the phe-notypes and emergent behaviors of complex cellular systems are among the most challenging goals in Systems Biology. Although mathematical models that describe the interactions among all biochemical processes in a cell are theoretically feasible, their simulation is generally hard because of a variety of reasons. For instance, many quantitative data (e.g., kinetic rates) are usually not available, a problem that hinders the execution of simulation algorithms as long as some parameter estimation methods are used. Though, even with a candidate parameterization, the simulation of mechanistic models could be challenging due to the extr…
The Brave New World of development in the internetwork computing architecture (InterNCA): or how distributed computing platforms will change systems …
1998
This essay is a speculation of the impact of the next generation technological platform — the internetwork computing architecture (InterNCA) — on systems development. The impact will be deep and pervasive and more substantial than when computing migrated from closed computer rooms to ubiquitous personal computers and flexible client-server solutions. Initially, by drawing upon the notion of a technological frame, the InterNCA, and how it differs from earlier technological frames, is examined. Thereafter, a number of hypotheses are postulated with regard to how the architecture will affect systems development content, scope, organization and processes. Finally, some suggestions for where the…
A New Platform for Automatic Bottom-Up Electric Load Aggregation
2017
In this paper, a new virtual framework for load aggregation in the context of the liberalized energy market is proposed. Since aggregation is managed automatically through a dedicated platform, the purchase of energy can be carried out without intermediation as it happens in peer-to-peer energy transaction models. Differently from what was done before, in this new framework, individual customers can join a load aggregation program through the proposed aggregation platform. Through the platform, their features are evaluated and they are clustered according to their reliability and to the width of range of regulation allowed. The simulations show the deployment of an effective clustering and …
A comparative study of partitioning methods for crowd simulations
2010
The simulation of large crowds of autonomous agents with realistic behavior is still a challenge for several computer research communities. In order to handle large crowds, some scalable architectures have been proposed. Nevertheless, the effective use of distributed systems requires the use of partitioning methods that can properly distribute the workload generated by agents among the existing distributed resources. In this paper, we analyze the use of irregular shape regions (convex hulls) for solving the partitioning problem. We have compared a partitioning method based on convex hulls with two techniques that use rectangular regions. The performance evaluation results show that the conv…
Decentralized Coordination System for Multiple AGVs in a Structured Environment
2011
Abstract In this paper, we propose a decentralized coordination algorithm for safe and efficient management of a group of mobile robots following predefined paths in a dynamic industrial environment. The proposed algorithm is based on shared resources and proved to guarantee ordered traffic flows avoiding collisions and deadlocks. In consistency with the model of distributed robotic systems (DRS), no centralized mechanism, synchronized clock, shared memory or ground support is needed. A local inter-robot communication is required among a small number of spatially adjacent robotic units.
Set-valued consensus for distributed clock synchronization
2009
This paper addresses the clock synchronization problem in a wireless sensor network (WSN) and proposes a distributed solution that consists of a form of consensus, where agents are able to exchange data representing intervals or sets. The solution is based on a centralized algorithm for clock synchronization, proposed by Marzullo, that determines the smallest interval that is in common with the maximum number of measured intervals. We first show how to convert such an algorithm into a problem involving only operations on sets, and then we convert it into a set–valued consensus. The solution is valid for more general scenarios where agents have uncertain measures of e.g. the position of an o…
Automated Synthesis of Application-layer Connectors from Automata-based Specifications
2019
Abstract Ubiquitous and Pervasive Computing, and the Internet of Things, promote dynamic interaction among heterogeneous systems. To achieve this vision, interoperability among heterogeneous systems represents a key enabler, and mediators are often built to solve protocol mismatches. Many approaches propose the synthesis of mediators. Unfortunately, a rigorous characterization of the concept of interoperability is still lacking, hence making hard to assess their applicability and soundness. In this paper, we provide a framework for the synthesis of mediators that allows us to: (i) characterize the conditions for the mediator existence and correctness; and (ii) establish the applicability bo…
Lambda+, the renewal of the Lambda Architecture: Category Theory to the rescue
2021
Designing software architectures for Big Data is a complex task that has to take into consideration multiple parameters, such as the expected functionalities, the properties that are untradeable, or the suitable technologies. Patterns are abstractions that guide the design of architectures to reach the requirements. One of the famous patterns is the Lambda Architecture, which proposes real-time computations with correctness and fault-tolerance guarantees. But the Lambda has also been highly criticized, mostly because of its complexity and because the real-time and correctness properties are each effective in a different layer but not in the overall architecture. Furthermore, its use cases a…
A GPU-Based Multi-agent System for Real-Time Simulations
2010
The huge number of cores existing in current Graphics Processor Units (GPUs) provides these devices with computing capabilities that can be exploited by distributed applications. In particular, these capabilites have been used in crowd simulations for enhancing the crowd rendering, and even for simulating continuum crowds. However, GPUs have not been used for simulating large crowds of complex agents, since these simulations require distributed architectures that can support huge amounts of agents. In this paper, we propose a GPU-based multi-agent system for crowd simulation. Concretely, we propose the use of an on-board GPU to implement one of the main tasks that a distributed server for c…
Analyzing big datasets of genomic sequences: fast and scalable collection of k-mer statistics
2019
Abstract Background Distributed approaches based on the MapReduce programming paradigm have started to be proposed in the Bioinformatics domain, due to the large amount of data produced by the next-generation sequencing techniques. However, the use of MapReduce and related Big Data technologies and frameworks (e.g., Apache Hadoop and Spark) does not necessarily produce satisfactory results, in terms of both efficiency and effectiveness. We discuss how the development of distributed and Big Data management technologies has affected the analysis of large datasets of biological sequences. Moreover, we show how the choice of different parameter configurations and the careful engineering of the …