this paper addresses the questions of high-level system modelling using heterogeneous multi-tool modelling environment on parallel multi-core processing systems for simulation acceleration. the modelling technique has...
详细信息
this paper addresses the questions of high-level system modelling using heterogeneous multi-tool modelling environment on parallel multi-core processing systems for simulation acceleration. the modelling technique has been applied for high-level validation of a high-precision Indoor Positioning System for Motion Analysis (IPS-MA) developed in the Central Institute Electronic Systems (ZEA-2) of the Research Center Juelich GmbH. the heterogeneous modelling environment has been built using an implementation-level model designed in Matlab Simulink, a verification model for describing the system environment using Modelica language, and Julia language for automatic generation of binding modelling environment and parallelizing the simulation of the overall model. the approach showed a good flexibility in system description and verification in the multi-instrument modelling environment and a good performance gain due to simulation parallelism.
the research into wireless communication and mobile computing is called to formulate novel smart mobility solutions to improve the quality of a citizen's life in smart cities. In such a context, in this paper we e...
详细信息
the research into wireless communication and mobile computing is called to formulate novel smart mobility solutions to improve the quality of a citizen's life in smart cities. In such a context, in this paper we elaborate on the role of technologies like multi-access edge computing (MEC), Internet of things (IoT) messaging protocols, such as Constrained Application Protocol (CoAP) and Message Queue Telemetry Transport (MQTT), and virtualization (i.e., digital twins) in the design of a framework enabling the collection and processing of data about the mobility of commuters and public transport vehicles. Such data have the purpose to feed mobility monitoring and transport planning solutions. A Proof-of-Concept (PoC) is developed to validate the framework under realistic experimental settings. Results in terms of efficiency and effectiveness of the considered messaging protocols are reported.
Mobile Edge computing (MEC) is a new network paradigm that allows resource management and IT services at the edge of a communication network and, so, closer to the devices guaranteeing low latency and high bandwidth r...
详细信息
Mobile Edge computing (MEC) is a new network paradigm that allows resource management and IT services at the edge of a communication network and, so, closer to the devices guaranteeing low latency and high bandwidth requirements. this characteristic makes MEC paradigm suitable for critical communication services used in collaboration with container-based virtualization and with 5G networks. In this paper, an implementation of a collision avoidance system based on MEC in a VANET environment is proposed. this system makes use of cloud and edge computing and it is able to switch communication from edge to cloud server and vice versa when possible, trying to guarantee the required constraints and balancing the communication among the servers avoiding of overloading edge layer. the simulation results have proved how, in some cases, the MEC-5G combination is the best solution for avoiding collisions in a VANET environment.
Cloud computing has emerged as a foundation of smart environments by encapsulating and virtualizing the underlying design and implementation details. Concerning the inherent latency and deployment issues, Mobile Edge ...
详细信息
Cloud computing has emerged as a foundation of smart environments by encapsulating and virtualizing the underlying design and implementation details. Concerning the inherent latency and deployment issues, Mobile Edge computing seeks to migrate services in the vicinity of mobile users. However, the current migration-based studies lack the consideration of migration cost, transaction cost, and energy consumption on the system-level with discussion on the impact of personalized user mobility. In this paper, we implement an enhanced service migration model to address user proximity issues. We formalize the migration cost, transaction cost, energy consumption related to the migration process. We model the service migration issue as a complex optimization problem and adapt Deep Reinforcement Learning to approximate the optimal policy. We compare the performance of the proposed model withthe recent Q-learning method and other baselines. the results demonstrate that the proposed model can estimate the optimal policy with complicated computation requirements.
In this work, we propose an IoT edge-based energy management system devoted to minimizing the energy cost for the daily-use of in-home appliances. the proposed approach employs a load scheduling based on a load shifti...
详细信息
In this work, we propose an IoT edge-based energy management system devoted to minimizing the energy cost for the daily-use of in-home appliances. the proposed approach employs a load scheduling based on a load shifting technique, and it is designed to operate in an edge-computing environment naturally. the scheduling considers all together time-variable profiles for energy cost, energy production, and energy consumption for each shiftable appliance. Deadlines for load termination can also be expressed. In order to address these goals, the scheduling problem is formulated as a Markov decision process and then processed through a reinforcement learning technique. the approach is validated by the development of an agent-based real-world test case deployed in an edge context.
Blockchain and smart contract technologies are becoming increasingly common in various areas. In these days, some user-side software saves information into blockchain-based storage so that they can ensure security, tr...
详细信息
ISBN:
(纸本)9781728149615
Blockchain and smart contract technologies are becoming increasingly common in various areas. In these days, some user-side software saves information into blockchain-based storage so that they can ensure security, traceability, and fault tolerance of their data. We expect that in the near future, more apps will use blockchain-based storage for dependability. However, there are some inconvenient points in current blockchain technologies for common use. Especially, stale blocks lead an undesirable property of blockchains for checkpointing. In this article we develop a simulator for obtaining some parameters toward constructing an analytical model by using the parameters obtained.
We present Min-Rounds BC (MRBC), a distributed-memory algorithm in the CONGEST model that computes the betweenness centrality (BC) of every vertex in a directed unweighted n-node graph in O(n) rounds. Min-Rounds BC al...
详细信息
ISBN:
(纸本)9781450362252
We present Min-Rounds BC (MRBC), a distributed-memory algorithm in the CONGEST model that computes the betweenness centrality (BC) of every vertex in a directed unweighted n-node graph in O(n) rounds. Min-Rounds BC also computes all-pairs-shortest-paths (APSP) in such graphs. It improves the number of rounds by at least a constant factor over previous results for unweighted directed APSP and for unweighted BC, both directed and undirected. We implemented MRBC in D-Galois, a state-of-the-art distributed graph analytics system, incorporated additional optimizations enabled by the D-Galois model, and evaluated its performance on a production cluster with up to 256 hosts using power-law and road networks. Compared to the BC algorithm of Brandes, on average, MRBC reduces the number of rounds by 14.0x and the communication time by 2.8x for the graphs in our test suite. As a result, MRBC is 2.1x faster on average than Brandes BC for real-world web-crawls on 256 hosts.
the internet was supposed to be an interconnection of independent distributed computer and information systems;the web was formally introduced in 1994 at the first conference now known as WWW1 in Geneva, It was suppos...
详细信息
Scale-out has become the standard answer to data analysis, machine learning and many other fields. Contrary to common belief, scale-up machines can outperform scale-out clusters for a considerable portion of tasks. Ho...
详细信息
We study distributed causal shared memory (or key-value pairs) in an asynchronous network under crash failures. Causal memory, introduced by Ahamad et al. in the context of multi-processor environment in 1994, is an a...
详细信息
ISBN:
(纸本)9781728149615
We study distributed causal shared memory (or key-value pairs) in an asynchronous network under crash failures. Causal memory, introduced by Ahamad et al. in the context of multi-processor environment in 1994, is an abstraction which ensures that nodes agree on the relative ordering of read and write operations that are causally related on key-value pairs. Inspired by the recent interests in geo-replicated causal storage systems (e.g., COPS, Eiger, Bolt-on), we systematically study the fault-tolerance property of the causal shared memory in the client-server model in this work. We identify that 2f +1 servers is both necessary and sufficient to build a resilient causal memory in the presence of up to f crashed servers. We provide boththe necessity proof and a new optimal algorithm that matches the bound. For evaluation, we implement our algorithm in Golang and compare the performance with state-of-the-art fault-tolerant algorithms that ensure strong consistency in the Google Cloud Platform.
暂无评论