We report on the analysis of gen_server, a popular Erlang library to build client-server applications. Our analysis uses a tool based on choreographic models. We discuss how, once the library has been modelled in term...
详细信息
ISBN:
(纸本)9781467387767
We report on the analysis of gen_server, a popular Erlang library to build client-server applications. Our analysis uses a tool based on choreographic models. We discuss how, once the library has been modelled in terms of communicating finite state machines, an automated analysis can be used to detect potential communication errors. the results of our analysis suggest how to properly use gen_server in order to guarantee the absence of communication errors.
In this paper we present the implementation of a framework for accelerating training and classification of arbitrary Convolutional Neural networks (CNNs) on the GPU. CNNs are a derivative of standard Multilayer Percep...
详细信息
ISBN:
(纸本)9780769539393
In this paper we present the implementation of a framework for accelerating training and classification of arbitrary Convolutional Neural networks (CNNs) on the GPU. CNNs are a derivative of standard Multilayer Perceptron (MLP) neural networks optimized for two-dimensional pattern recognition problems such as Optical Character Recognition (OCR) or face detection. We describe the basic parts of a CNN and demonstrate the performance and scalability improvement that can be achieved by shifting the computation-intensive tasks of a CNN to the GPU. Depending on the network topology training and classification on the GPU performs 2 to 24 times faster than on the CPU. Furthermore, the GPU version scales much better than the CPU implementation with respect to the network size.
In consequence of an increasing demand for high-performance system, multiprocessor architectures became trend and used in a variety of fields (e.g. PC, laptops, mobile devices and so on). Multi-core processor can get ...
详细信息
ISBN:
(纸本)9781467387767
In consequence of an increasing demand for high-performance system, multiprocessor architectures became trend and used in a variety of fields (e.g. PC, laptops, mobile devices and so on). Multi-core processor can get outstanding throughput with relatively lower operating frequency and power consumption. In order to obtain the maximum throughput in a multi-core structure, it is necessary to schedule assigning tasks to multiple cores. In this paper, we propose a hardware scheduler that is tailored for multicore block cipher and verify the feasibility of the scheduler using AES algorithm.
We studied routing protocols for Delay Tolerant networks devised to improve the message delivery performance in natural disaster scenarios. In this paper we propose the MinVisited protocol which during the transitive ...
详细信息
ISBN:
(纸本)9781538649756
We studied routing protocols for Delay Tolerant networks devised to improve the message delivery performance in natural disaster scenarios. In this paper we propose the MinVisited protocol which during the transitive path to the message destination, selects the next node based on two features: (1) the most distant neighbor, and (2) the largest number of encounters withthe destination node of the message. We compare our protocol with well-known protocols of the technical literature. the results show that the proposed protocol presents a low workload overhead with a number of hops lower than 2, and in average 95% of the messages are successfully delivered.
this paper presents a framework to easily build and execute parallel applications in container-baseddistributed computing platforms in a user transparent way. the proposed framework is a combination of the COMP Super...
详细信息
ISBN:
(纸本)9781509060580
this paper presents a framework to easily build and execute parallel applications in container-baseddistributed computing platforms in a user transparent way. the proposed framework is a combination of the COMP Superscalar and Docker. We have built a prototype in order to evaluate how it performs by evaluating the overhead in the building, deployment and execution phases. We have observed an important gain compared with cloud environments during the building and deployment phases. In contrast, we have detected an extra overhead during the execution, which is mainly due to the multi-host Docker networking.
A self adaptive communication protocol is proposed for peer to peer distributed computing. this protocol can configure itself automatically in function of application requirements and topology changes by choosing the ...
详细信息
ISBN:
(纸本)9780769539393
A self adaptive communication protocol is proposed for peer to peer distributed computing. this protocol can configure itself automatically in function of application requirements and topology changes by choosing the most appropriate communication mode between peers. the protocol was designed in order to be used in conjunction with a decentralized environment for high performance distributed computing. A first set of computational experiments is also presented and analyzed for an optimization application, i.e. nonlinear network flow problems.
Cloud Computing have highlighted the importance of container orchestration to manage distributed implication's life-cycle. Withthe advent of Edge Computing, DevOs expect to find die features of containers in the ...
详细信息
ISBN:
(纸本)9781665414555
Cloud Computing have highlighted the importance of container orchestration to manage distributed implication's life-cycle. Withthe advent of Edge Computing, DevOs expect to find die features of containers in the cloud, also at the edge. However, orchestration systems have MA been designed to deal with geo-distribution aspects such as latency, intermittent networks, etc. In other words, it is unclear whether they could he directly used on top of massively distributed edge infrastructures without revision. In this paper, we provide an evaluation of Kubernetes in a WANWide context. Precisely, we present and discuss results we obtained during an experimental campaign to analyze the impact of WAN links on its behaviour. While there exist initiatives investigating Kubernetes revisions to deal with distribution aspects, there is, to the best of our knowledge. no rigorous performance evaluations to disqualify the vanilla code.
We present here a novel algorithm based on a MapReduce approach to facilitate the discovery of novel therapeutic targets. the proposed algorithm has been enabled to scan a set biological pathways in order to discover ...
详细信息
ISBN:
(纸本)9781728116440
We present here a novel algorithm based on a MapReduce approach to facilitate the discovery of novel therapeutic targets. the proposed algorithm has been enabled to scan a set biological pathways in order to discover non-trivial ( less common) routes. Such routes represent a chain of biochemical interactions among different biological actors. these actors can be represented by quite distant nodes along the devised pathway. Our approach detects nodes that are far from the initial target nodes, also showing the number of times that a given route has been found inside the selected set of biological pathways.
Software applications for biological networks analysis rely on graphs to model the structure interactions. A great part of them requires searching for subgraphs in a target graph or in collections of graphs. Even thou...
详细信息
ISBN:
(纸本)9781728116440
Software applications for biological networks analysis rely on graphs to model the structure interactions. A great part of them requires searching for subgraphs in a target graph or in collections of graphs. Even though very efficient algorithms have been defined to solve such a subgraph isomorphisms problem, the complexity of current real biological networks make their sequential execution time prohibitive. On the other hand, parallel architectures, from multi-core to many-core, have become pervasive to deal withthe problem of the data size. Nevertheless, the sequential nature of the graph searching algorithms makes their implementation for parallel architectures very challenging. this paper presents three different parallel solutions for the graph searching problem. the first two target the exact search for multi-core CPUs and many-core GPUs, respectively. the third one targets the approximate search for GPUs, which handles node, edge, and node label mismatches. the paper shows how different techniques have been developed in all the solutions to reduce the search space complexity. the paper shows the performance of the proposed solutions on representative biological networks containing antiviral chemical compounds and protein interactions networks.
We focus on agent-based simulations where a large number of agents move in the space, obeying to some simple rules. Since such kind of simulations are computational intensive, it is challenging, for such a contest, to...
详细信息
ISBN:
(纸本)9780769543284
We focus on agent-based simulations where a large number of agents move in the space, obeying to some simple rules. Since such kind of simulations are computational intensive, it is challenging, for such a contest, to let the number of agents to grow and to increase the quality of the simulation. A fascinating way to answer to this need is by exploiting parallel architectures. In this paper, we present a novel distributed load balancing schema for a parallel implementation of such simulations. the purpose of such schema is to achieve an high scalability. Our approach to load balancing is designed to be lightweight and totally distributed: the calculations for the balancing take place at each computational step, and influences the successive step. To the best of our knowledge, our approach is the first distributed load balancing schema in this context. We present boththe design and the implementation that allowed us to perform a number of experiments, with up-to 1, 000, 000 agents. Tests show that, in spite of the fact that the load balancing algorithm is local, the workload distribution is balanced while the communication overhead is negligible.
暂无评论