In Mobile Cyber-physical system (CPS) is a popular research field in recent years. It aims to control and monitor mobile devices in complex and real-time scenes, and provide people with convenience and economy by usin...
详细信息
ISBN:
(纸本)9781450371926
In Mobile Cyber-physical system (CPS) is a popular research field in recent years. It aims to control and monitor mobile devices in complex and real-time scenes, and provide people with convenience and economy by using intelligent applications. The scenes in mobile CPS have close relationships with everyone's life and it has pervasive effect on people's life anytime and anywhere. In the paper, we focus on the intelligent transportation systems (ITS) in mobile CPS. Specifically, we analyse the bottlenecks in automated and autonomous vehicles and find the on-car computer is the key component for low latency and low power self-driving vehicles. We show detailed research developments on the most advanced CPU-GPU platform including four aspects, mainly putting focus on the methods to reduce latency and energy in the system. The four aspects cover reducing data transferring overhead, reducing power consumption with power-gating, optimizing warp scheduling scheme and optimizing cache performance in coprocessors. Finally, we give the prospects and development trends in the computing platform of self-driving on-car system.
Error diffusion dithering is a technique that is used to represent a grey-scale image in a format usable by a printer. At every step, an algorithm converts the grey-scale value of a pixel to a new value within the all...
详细信息
ISBN:
(纸本)9781728108995
Error diffusion dithering is a technique that is used to represent a grey-scale image in a format usable by a printer. At every step, an algorithm converts the grey-scale value of a pixel to a new value within the allowed ones, generating a conversion error. To achieve the effect of continuous-tone illusion, the error is distributed to the neighboring pixels. Among the existent algorithms, the most commonly used is Floyd-Steinberg. However, this algorithm suffers two issues: artifacts and slowness. Regarding artifacts, those are textures that can appear after the image elaboration, making it visually different from the original one. In order to avoid this effect, we will use a stochastic version of Floyd-Steinberg algorithm. To evaluate the results, we will apply the Weighted Signal to Noise Ratio (WSNR), a visualbased model to account for perceptivity of dithered textures. This filter has a low-pass characteristic and, in particular, it uses a Contrast Sensitivity Function to evaluate the similarity between the original image and the final image. Our claim is that the new stochastic algorithm is better suited for both the WSNR measure and the visual analysis. Secondly, we will face slowness: we will describe a parallel version of Floyd-Steinberg algorithm that will exploit GPU (Graphics Processing Unit), drastically reducing the spent time. Specifically, we noticed that the serial version computational time increases quadratically with the input size, while the parallel version one increases linearly. Both the image quality and the computational performance of the parallel algorithm are evaluated on several large-scale images.
Nowadays, enormously expanding use of mobile gadgets for capturing images is getting overwhelming response. This fact results in a tremendously increasing usage of digital images. To maintain the quality of vastly per...
详细信息
The data connection of electric power marketing and distribution network is an integrated platform of operation and distribution data based on geographic information platform, which integrates the data of marketing bu...
详细信息
ISBN:
(数字)9781728165219
ISBN:
(纸本)9781728165226
The data connection of electric power marketing and distribution network is an integrated platform of operation and distribution data based on geographic information platform, which integrates the data of marketing business application system, production management information system and grid geospatial information service platform, and shares the whole face of production data and marketing customer data, so as to achieve the connection of operation and distribution data and business, and realize fault location and electric failure Scope analysis, line loss statistics, business expansion and installation, etc. Graph database has the technical advantages of high efficiency of topological data organization, low redundancy of topological data storage, strong expansibility of topological data model and high efficiency of topological analysis and calculation, which can meet the storage, query and retrieval requirements of large-scale operation and distribution data. After application verification, the results show that the graph database can provide data storage, query and retrieval technology scheme for the operation and distribution of power grid. With the business development of operation and distribution of power grid, there are performance bottlenecks in the existing data storage mode, which seriously restricts the deepening of application. It is necessary to introduce advanced computing technology to achieve breakthrough, and improve the data storage efficiency of the existing data platform The parallel and concurrent ability of data retrieval and query can meet the management requirements of geometric growth of power grid equipment, the analysis requirements of real-time data of power grid, and the concurrent access requirements of largescale growth of users.
Mobile and energy harvesting devices increasingly provide resources for edge environments. These devices' mobility and limited energy budgets may cause failures and poor performance. The reliability and efficiency...
详细信息
ISBN:
(数字)9781728170022
ISBN:
(纸本)9781728170039
Mobile and energy harvesting devices increasingly provide resources for edge environments. These devices' mobility and limited energy budgets may cause failures and poor performance. The reliability and efficiency of edge services can be improved with equivalent microservices that satisfy application requirements by different means: execute equivalent microservices in the predefined patterns of fail-over to minimize execution costs or speculative parallelism to reduce latency. However, given the vast dissimilarities in resource availability and capability across edge environments, being limited to these predefined patterns when implementing edge services causes inconsistent QoS. To address this problem, we provide QoS-consistent edge services by customizing the execution of equivalent microservices. Our system estimates the environment-specific QoS of equivalent microservices and dynamically generates execution strategies that best satisfy given QoS requirements. We evaluate the effectiveness and performance of our system via simulations and benchmarks with realistic edge deployments. Our approach consistently out-performs the predefined execution patterns in satisfying the QoS requirements in unreliable and dynamic edge environments.
Work-stealing schedulers are common in shared memory environments. However, large scale distributed memory usage has been limited to specific ad-hoc implementations preventing a broader adoption. In this paper we intr...
详细信息
ISBN:
(纸本)9783030105495;9783030105488
Work-stealing schedulers are common in shared memory environments. However, large scale distributed memory usage has been limited to specific ad-hoc implementations preventing a broader adoption. In this paper we introduce a new scalable work-stealing algorithm for distributed memory systems as well as our implementation as the TITUS DLB library. It is based on Kleinberg's small-world graph. It allows to control the communication patterns and associated runtime overheads while providing efficient heuristics for victim selection and results routing. To validate our approach, we present the DLB Bench benchmark which emulates arbitrary workload distribution and imbalance characteristics. Finally, we compare TITUS DLB to the ad-hoc solution developed for the YALES2 computational fluid dynamics and combustion solver. We achieve up to 54% performance gain over thousands of cores.
Public key encryption with equality test (PKEET) enables the testing whether two ciphertexts encrypt the same message. Identity-based encryption with equality test (IBEET) simplify the certificate management of PKEET,...
详细信息
ISBN:
(数字)9781728190747
ISBN:
(纸本)9781728183824
Public key encryption with equality test (PKEET) enables the testing whether two ciphertexts encrypt the same message. Identity-based encryption with equality test (IBEET) simplify the certificate management of PKEET, which leads to many potential applications such as in smart city applications or Wireless Body Area Networks. Lee et al. (ePrint 2016) proposed a generic construction of IBEET scheme in the standard model utilising a 3-level hierachy IBE together with a one-time signature scheme, which can be instantiated in lattice setting. Duong et al. (ProvSec 2019) proposed the first direct construction of IBEET in standard model from lattices. However, their scheme achieve CPA security only. In this paper, we improve the Duong et al.'s construction by proposing an IBEET in standard model which achieves CCA2 security and with smaller ciphertext and public key size.
Application migration in Wide Area Network (WAN) is needed in many scenarios: disaster recovery and service hand-off in edge cloud. Modern distributed applications are virtualized with multiple virtual machines or con...
详细信息
An efficient way to cope with the combinatorial explosion problem induced by the model checking process is to compute the Symbolic Observation Graph (SOG). Given a stutter-invariant event-based LTL formula phi, involv...
详细信息
ISBN:
(纸本)9781728138435
An efficient way to cope with the combinatorial explosion problem induced by the model checking process is to compute the Symbolic Observation Graph (SOG). Given a stutter-invariant event-based LTL formula phi, involving a subset of actions (called observable actions), the SOG is a condensed representation of the state space graph based on a symbolic encoding of the nodes (sets of states linked with unobservable actions) and an explicit representation of the edges (labelled with observable actions). It has the advantage to be much reduced comparing to the original state space graph while being equivalent with respect to stutter-invariant temporal properties (i.e., the original system satisfies phi if and only if the corresponding SOG satisfies phi). Aiming to go further in the process of tackling the state space explosion problem, we propose in this paper to parallelize the construction of the SOG using a hybrid approach (distributed+shared memory). Doing so, we take advantage of the recent advances in computer hardware, by distributing the construction process over a large number of multi-core processors. We studied the performances of our new approach comparing to both distributed and shared memory approaches on one side, and to the sequential construction on the other side. The obtained results show that the proposed approach offers an interesting alternative allowing to completely exploit the available distributed architecture while offering significant speedup.
Graph traversal is a critical building block in many algorithms. Traversing a large graph using breadth-first search, although conceptually simple, is time-consuming in distributed-memory environments due to the amoun...
详细信息
ISBN:
(纸本)9781728145358
Graph traversal is a critical building block in many algorithms. Traversing a large graph using breadth-first search, although conceptually simple, is time-consuming in distributed-memory environments due to the amount of exchanged data. In this work, we present both an efficient algorithmic approach to carry out the traversal and a low-overhead runtime that provides efficient primitives to implement the algorithm. Our algorithm relies on constructing a traversal composed of partially consistent trees until all vertices are discovered. We resolve such inconsistency through election and exchange steps. The election phase relies on communicating compressed vertices through collectives that do not stress the bisection bandwidth of the interconnect. We leverage the space consistency programming abstraction to allow an efficient overlap of computation with communication. We extend the model to leverage hardware accelerated collectives and provide primitives for one-sided broadcast and sparse reduction. We present the algorithm and runtime designs and show the results of applying our techniques on the Bluegene/Q architectures. We achieve 1040 GTEPS on a single rack (1K nodes), which is better than the best-known algorithms on the same architecture. We also achieve superior scalability compared with other implementations up to 32K nodes.
暂无评论