Anomalies of multitier services running in cloud platform can be caused by components of the same tenant or performance interference from other tenants. If the performance of a multitier service degrades, we need to f...
详细信息
ISBN:
(纸本)9781538627044
Anomalies of multitier services running in cloud platform can be caused by components of the same tenant or performance interference from other tenants. If the performance of a multitier service degrades, we need to find out the root causes precisely to recover the service as soon as possible. In this paper, we argue that cloud providers are in a better position than tenants to solve this problem, and the solution should be non-intrusive to tenants' services or applications. Based on these two considerations, we propose a solution for cloud providers to help tenants to localize root causes of any anomaly. We design a non-intrusive method to capture the dependency relationships of components, which improves the feasibility of root cause localization system. Our solution can find out root causes no matter they are in the same tenant as the anomaly or from other tenants. Our proposed two-step localization algorithm exploits measurement data of both application layer and underlay infrastructure and a random walk procedure to improve its accuracy. Our real-world experiments of a three-tier web application running in a small-scale cloud platform show a 38.9% improvement in mean average precision compared to current methods.
As a virtual backbone structure, connected dominating sets (CDSs) play an important role in topology control for wireless networks. In this paper, we develop a distributed self-stabilizing CDS construction algorithm u...
详细信息
ISBN:
(纸本)9781509053360
As a virtual backbone structure, connected dominating sets (CDSs) play an important role in topology control for wireless networks. In this paper, we develop a distributed self-stabilizing CDS construction algorithm under the SINR model (also known as the physical interference model), a more practical yet more challenging interference model for distributed algorithmdesign. Specifically, we propose a randomized distributed algorithm that can construct a CDS in O(log n) timeslots with a high probability, where n is the total number of nodes in the network. The constructed CDS achieves constant approximation in both density and diameter. To the best of our knowledge, this is the first known asymptotically optimal self-stabilizing result in terms of both density and diameter for distributed CDS construction under the practical SINR model.
Sorting is one of the basic computational operation that has an immense impact on the performance of the system. Since the past few decades, sorting algorithms have been studied extensively in the field of hardware en...
详细信息
ISBN:
(纸本)9781538611043
Sorting is one of the basic computational operation that has an immense impact on the performance of the system. Since the past few decades, sorting algorithms have been studied extensively in the field of hardware engineering and real-time operating systems. The efficiency of an application depends on the usage of a sorting algorithm. In this article, we have compared various sorting algorithms on basis of time complexity. We propose a vector-based parallel odd-even merge sort, which has worst-case time complexity less than that of O(n). This sorting algorithm is first designed and simulated in Matlab. We then implement bit-true, cycle-accurate and high-throughput architecture for the same algorithm on Xilinx Virtex-7 VC707 field programmable gate array (FPGA) emulation kit.
Path planning for automated parking remains challenged by the demand to balance general parking scenarios and computational efficiency. This paper proposes a two-stage rapid-exploring random tree (RRT) algorithm to im...
详细信息
ISBN:
(纸本)9781509067817
Path planning for automated parking remains challenged by the demand to balance general parking scenarios and computational efficiency. This paper proposes a two-stage rapid-exploring random tree (RRT) algorithm to improve the computational efficiency. At first the proposed algorithm performs space exploration and establishes prior knowledge, represented as waypoints, using cheap computation. Secondly a waypoint-guided RRT algorithm, with a sampling scheme biased by the waypoints, constructs a kinematic tree connecting the initial and goal configurations. Numerical study demonstrates that the two-stage algorithm achieves at least 2X faster than the baseline one-stage algorithm.
The dynamic characteristics of a hydraulic turbine governing system is determined by the parameters of the hydraulic turbine *** are several drawbacks of the conventional particle swarm alg
ISBN:
(纸本)9781509053643;9781509053636
The dynamic characteristics of a hydraulic turbine governing system is determined by the parameters of the hydraulic turbine *** are several drawbacks of the conventional particle swarm alg
Mobile edge caching enables content delivery directly within the radio access network, which effectively alleviates the backhaul burden and reduces round-trip latency. To fully exploit the edge resources, the most pop...
详细信息
ISBN:
(纸本)9781509050192
Mobile edge caching enables content delivery directly within the radio access network, which effectively alleviates the backhaul burden and reduces round-trip latency. To fully exploit the edge resources, the most popular contents should be identified and cached. Observing that content popularity varies greatly at different locations, to maximize local hit rate, this paper proposes an online learning algorithm that dynamically predicts content hit rate, and makes location-differentiated caching decisions. Specifically, a linear model is used to estimate the future hit rate. Considering the variations in user demand, a perturbation is added to the estimation to account for uncertainty. The proposed learning algorithm requires no training phase, and hence is adaptive to the time-varying content popularity profile. Theoretical analysis indicates that the proposed algorithm asymptotically approaches the optimal policy in the long term. Extensive simulations based on real world traces show that, the proposed algorithm achieves higher hit rate and better adaptiveness to content popularity fluctuation, compared with other schemes.
Application of an evolutionary algorithm in designing an artificial electromagnetic conductor (AMC) at 12 GHz is explained in this paper. To do so, a binary version of particle swarm optimization algorithm in connecti...
详细信息
ISBN:
(纸本)9781509044511
Application of an evolutionary algorithm in designing an artificial electromagnetic conductor (AMC) at 12 GHz is explained in this paper. To do so, a binary version of particle swarm optimization algorithm in connection with EM simulation is used, resulting in an AMC with 29% fractional bandwidth at the operating frequency.
作者:
Shen, MinghuaLuo, GuojieXiao, NongSun Yat Sen Univ
Sch Data & Comp Sci Guangzhou Guangdong Peoples R China Peking Univ
Sch EECS Ctr Energy Efficient Comp & Applicat Beijing Peoples R China NUDT
Collaborat Innovat Ctr High Performance Comp Changsha Hunan Peoples R China
Routing is a time-consuming process in the FPGA design flow. Parallelization is a promising direction to accelerate the routing. While synchronous parallelization can converge a feasible solution, the ideal speedup is...
详细信息
ISBN:
(纸本)9781538630938
Routing is a time-consuming process in the FPGA design flow. Parallelization is a promising direction to accelerate the routing. While synchronous parallelization can converge a feasible solution, the ideal speedup is rarely achieved due to excessive communication overheads. Asynchronous parallelization can provide an almost linear speedup, but it is difficult to converge in the limited number of iterations due to net dependency. In this paper we propose SAPRoute, which coordinates synchronous and asynchronous parallelism on distributed multiprocessing environment to accelerate the routing for FPGAs. The objective is to boost the more speedup of parallel routing algorithm under the requirement of convergence. To the best of our knowledge, this is the first work to study the impact of synchronization and asynchronization during parallelization. Experimental results show that our approach have negligible explicit synchronization overhead and achieves significant speedup improvement over a set of commonly used benchmarks. Notably, SAPRoute produces the speedup of 24.27x on average compared to the default serial solution.
We analyze the behaviors of the Filtered-X LMS (FXLMS) algorithm for active noise control (ANC). Correlations between the impulse response of an adaptive filter and a primary path are treated as macroscopic variables....
详细信息
ISBN:
(纸本)9781538615423
We analyze the behaviors of the Filtered-X LMS (FXLMS) algorithm for active noise control (ANC). Correlations between the impulse response of an adaptive filter and a primary path are treated as macroscopic variables. To obtain the correlations, we analytically solve the equations and finally compute the MSE. In particular, we analyze the behaviors of multiple-channel ANC. We theoretically show that the MSE is affected by the secondary paths that are not directly connected.
Social network analysis (SNA) is the application of graph theory to understand, categorize and quantify relationships in a social network. It can be a great tool to improve analytic capabilities in any field, for exam...
详细信息
ISBN:
(纸本)9789532330922
Social network analysis (SNA) is the application of graph theory to understand, categorize and quantify relationships in a social network. It can be a great tool to improve analytic capabilities in any field, for example marketing analytics, churn prediction, health care, etc. In terms of SNA, network structure is defined by nodes, edges and metrics which quantify the importance or influence of certain nodes in the network or relationship strength between nodes. algorithms for network metrics calculation are complex and that makes SNA difficult to implement in big data environments on large datasets with many nodes and edges. In this paper we will elaborate how to efficiently and performance wise perform SNA and visualize results of the analysis on large datasets using increasingly popular GraphX and JavaScript libraries.
暂无评论