With the explosive growth of information, more and more organizations are deploying private cloud systems or renting public cloud systems to process big data. However, there is no existing benchmark suite for evaluating cloud performance on the whole system level. To the best of our knowledge, this paper proposes the first benchmark suite CloudRank-D to benchmark and rank cloud computing systems that are shared for running big data applications. We analyze the limitations of previous metrics, e.g., floating point operations, for evaluating a cloud computing system, and propose two simple metrics: data processed per second and data processed per Joule as two complementary metrics for evaluating cloud computing systems. We detail the design of CloudRank-D that considers representative applications, diversity of data characteristics, and dynamic behaviors of both applications and system software platforms. Through experiments, we demonstrate the advantages of our proposed metrics. In several case studies, we evaluate two small-scale deployments of cloud computing systems using CloudRank-D. 相似文献
嵌入式开发领域经常使用串口通信,但串口通信方式占用很多硬件资源,设备的利用率较低。文章研究了基于Linux VMware虚拟机进行串口通信的Use Physical Serial Port模式、Use Out File模式以及Use Named Pipe模式的功能和特点,给出了基于VMware构建串口通信环境的方法以及具体实现过程。 相似文献
Knowledge and Information Systems - Question answering over knowledge graph (KGQA), which automatically answers natural language questions by querying the facts in knowledge graph (KG), has drawn... 相似文献
In recent years, the parameterized level set method (PLSM) has attracted widespread attention for its good stability, high efficiency and the smooth result of topology optimization compared with the conventional level set method. In the PLSM, the radial basis functions (RBFs) are often used to perform interpolation fitting for the conventional level set equation, thereby transforming the iteratively updating partial differential equation (PDE) into ordinary differential equations (ODEs). Hence, the RBFs play a key role in improving efficiency, accuracy and stability of the numerical computation in the PLSM for structural topology optimization, which can describe the structural topology and its change in the optimization process. In particular, the compactly supported radial basis function (CS-RBF) has been widely used in the PLSM for structural topology optimization because it enjoys considerable advantages. In this work, based on the CS-RBF, we propose a PLSM for structural topology optimization by adding the shape sensitivity constraint factor to control the step length in the iterations while updating the design variables with the method of moving asymptote (MMA). With the shape sensitivity constraint factor, the updating step length is changeable and controllable in the iterative process of MMA algorithm so as to increase the optimization speed. Therefore, the efficiency and stability of structural topology optimization can be improved by this method. The feasibility and effectiveness of this method are demonstrated by several typical numerical examples involving topology optimization of single-material and multi-material structures.
Applied Intelligence - Pharmaceutical drug combinations can effectively treat various medical conditions. However, some combinations can cause serious adverse drug reactions (ADR). Therefore,... 相似文献
Distributed and Parallel Databases - In this paper we propose and study the problem of k-Collective influential facility placement over moving object. Specifically, given a set of candidate... 相似文献