检索结果-内蒙古大学图书馆

The CMS Statistical Analysis and Combination Tool: Combine

Computing and software for Big science 2024年第1期8卷 1-45页

作者： Zhokin, A. Zhizhin, I. Zarubin, A. Yuldashev, B.S. Voytishin, N. Vorotnikov, G. Vorobyev, A. Volkov, P. Uzunian, A. Uvarov, L. Toropin, A. Tlisova, I. Teryaev, O. Terkulov, A. Tcherniaev, E. Sulimov, V. Sosnov, D. Smirnov, V. Slabospitskii, S. Skovpen, Y. Shulha, S. Shmatov, S. Shalaev, V. Savrin, V. Savina, M. Radchenko, O. Popov, V. Polikarpov, S. Perfilov, M. Perelygin, V. Palichik, V. Oreshkin, V. Obraztsov, S. Nikitenko, A. Murzin, V. Matveev, V. Malakhov, A. Makarenko, V. Lychkovskaya, N. Levchenko, P. Lanev, A. Krasnikov, N. Kozyrev, A. Korenkov, V. Konstantinov, D. Kodolova, O. Klyukhin, V. Kirsanov, M. Kirpichnikov, D. Kirakosyan, M. Kim, V. Karneyeu, A. Karjavine, V. Kachanov, V. Ivanov, Y. Gribushin, A. Gorbunov, I. Golutvin, I. Golubev, N. Golovtcov, V. Gninenko, S. Gavrilov, V. Gavrilov, G. Dudko, L. Dubinin, M. Druzhkin, D. Dimova, T. Dermenev, A. Chistov, R. Chekhovsky, V. Chadeeva, M. Bunichev, V. Budkouski, D. Borshch, V. Boos, E. Blinov, V. Babaev, A. Azarkin, M. Aushev, T. Andreev, Yu. Andreev, V. Alexakhin, V. Afanasiev, S. Warden, A. Vetens, W. Tsoi, H.F. Teague, D. Smith, W.H. Sharma, V. Shang, V. Savin, A. Pinna, D. Pétré, L. Parida, G. Mondal, S. Mohammadi, A. Mallampalli, A. Sreekala, J. Madhusudanan Loveless, R. Lanaro, A. Koraka, C.K. Herve, A. Herndon, M. He, H. Galloni, C. Everaerts, P. De Bruyn, I. Dasu, S. Bose, T. Black, K. Banerjee, S. Aravind, A. Karchin, P.E. Bhattacharya, S. Neu, C. Ledovskoy, A. Hirosky, R. Hakala, J. Cox, B. Cardwell, B. Viinikainen, J. Velkovska, J. Tuo, S. Sheldon, P. Romeo, F. Melo, A. Elayavalli, R. Kunnawalkam Johns, W. Gurrola, A. Greene, S. Chen, Y. Appelt, E. Volobouev, I. Peltola, T. Mankel, A. Lee, S.W. Lamichhane, K. Kazhykarim, Y. Hussain, A. Hegde, V. Gogate, N. Damgov, J. Akchurin, N. Safonov, A. Rathjens, D. Overton, D. Mueller, R. Luo, S. Kim, H. Kamon, T. Huang, T. Gilmore, J. Eusebi, R. Bouhali, O. Akhter, T. Ahmad, M. Aebi, D. Spanier, S. Nibigira, E. Lee, L. Karunarathna, N. Kanuganti, A.R. Holmes, T. Higginbotham, S. Fiorendi, S. Delannoy Yerevan Physics Institute Yerevan Armenia Institut für Hochenergiephysik Vienna Austria Universiteit Antwerpen Antwerpen Belgium Vrije Universiteit Brussel Brussel Belgium Université Libre de Bruxelles Bruxelles Belgium Ghent University Ghent Belgium Université Catholique de Louvain Louvain-la-Neuve Belgium Centro Brasileiro de Pesquisas Fisicas Rio de Janeiro Brazil Universidade do Estado do Rio de Janeiro Rio de Janeiro Brazil Universidade Estadual Paulista Universidade Federal do ABC São Paulo Brazil Institute for Nuclear Research and Nuclear Energy Bulgarian Academy of Sciences Sofia Bulgaria University of Sofia Sofia Bulgaria Instituto De Alta Investigación Universidad de Tarapacá Casilla 7 D Arica Chile Beihang University Beijing China Department of Physics Tsinghua University Beijing China Institute of High Energy Physics Beijing China State Key Laboratory of Nuclear Physics and Technology Peking University Beijing China Guangdong Provincial Key Laboratory of Nuclear Science and Guangdong-Hong Kong Joint Laboratory of Quantum Matter South China Normal University Guangzhou China Sun Yat-Sen University Guangzhou China University of Science and Technology of China Hefei China Nanjing Normal University Nanjing China Key Laboratory of Nuclear Physics and Ion-beam Application (MOE) Institute of Modern Physics Fudan University Shanghai China Zhejiang University Hangzhou Zhejiang China Universidad de Los Andes Bogota Venezuela Universidad de Antioquia Medellin Colombia Faculty of Electrical Engineering Mechanical Engineering and Naval Architecture University of Split Split Croatia Faculty of Science University of Split Split Croatia Institute Rudjer Boskovic Zagreb Croatia University of Cyprus Nicosia Cyprus Charles University Prague Czech Republic Universidad San Francisco de Quito Quito Ecuador Egyptian Network of High Energy Physics Academy of Scientific Research and Technology of the Arab Republic of Egypt Cairo Egypt Center for High

This paper describes the Combine software package used for statistical analyses by the CMS Collaboration. The package, originally designed to perform searches for a Higgs boson and the combined analysis of those searches, has evolved to become the statistical analysis tool presently used in the majority of measurements and searches performed by the CMS Collaboration. It is not specific to the CMS experiment, and this paper is intended to serve as a reference for users outside of the CMS Collaboration, providing an outline of the most salient features and capabilities. Readers are provided with the possibility to run Combine and reproduce examples provided in this paper using a publicly available container image. Since the package is constantly evolving to meet the demands of ever-increasing data sets and analysis sophistication, this paper cannot cover all details of Combine. However, the online documentation referenced within this paper provides an up-to-date and complete user guide. © CERN, for the benefit of the CMS Collaboration 2024.

关键词： CMS Combine Higgs Higgs boson Statistics

来源：评论

学校读者我要写书评

暂无评论

A full circuit-based quantum algorithm for excited-states in quantum chemistry

arXiv

引用

arXiv 2021年

作者： Wen, Jingwei Wang, Zhengan Chen, Chitong Xiao, Junxiang Li, Hang Qian, Ling Huang, Zhiguo Fan, Heng Wei, Shijie Long, Guilu State Key Laboratory of Low-Dimensional Quantum Physics Department of Physics Tsinghua University Beijing100084 China Software Technology Company Limited Suzhou215163 China Beijing Academy of Quantum Information Sciences Beijing100193 China Institude of Physics Chinese Academy of Sciences Beijing100190 China School of Physical Sciences University of Chinese Academy of Sciences Beijing100190 China Frontier Science Center for Quantum Information Beijing100084 China Beijing National Research Center for Information Science and Technology Beijing100084 China

Utilizing quantum computer to investigate quantum chemistry is an important research field nowadays. In addition to the ground-state problems that have been widely studied, the determination of excited-states plays a crucial role in the prediction and modeling of chemical reactions and other physical processes. Here, we propose a non-variational full circuit-based quantum algorithm for obtaining the excited-state spectrum of a quantum chemistry Hamiltonian. Compared with previous classical-quantum hybrid variational algorithms, our method eliminates the classical optimization process, reduces the resource cost caused by the interaction between different systems, and achieves faster convergence rate and stronger robustness against noise without barren plateau. The parameter updating for determining the next energy-level is naturally dependent on the energy measurement outputs of the previous energy-level and can be realized by only modifying the state preparation process of ancillary system, introducing little additional resource overhead. Numerical simulations of the algorithm with hydrogen, LiH, H2O and NH3 molecules are presented. Furthermore, we offer an experimental demonstration of the algorithm on a superconducting quantum computing platform, and the results show a good agreement with theoretical expectations. The algorithm can be widely applied to various Hamiltonian spectrum determination problems on the fault-tolerant quantum computers. © 2021, CC BY.

关键词： Excited states

来源：评论

学校读者我要写书评

暂无评论

NTIRE 2022 Challenge on Efficient Super-Resolution: Methods and Results

arXiv

引用

arXiv 2022年

作者： Li, Yawei Zhang, Kai Timofte, Radu Van Gool, Luc Kong, Fangyuan Li, Mingxi Liu, Songwei Du, Zongcai Liu, Ding Zhou, Chenhui Chen, Jingyi Han, Qingrui Li, Zheyuan Liu, Yingqi Chen, Xiangyu Cai, Haoming Qiao, Yu Dong, Chao Sun, Long Pan, Jinshan Zhu, Yi Zong, Zhikai Liu, Xiaoxiao Hui, Zheng Yang, Tao Ren, Peiran Xie, Xuansong Hua, Xian-Sheng Wang, Yanbo Ji, Xiaozhong Lin, Chuming Luo, Donghao Tai, Ying Wang, Chengjie Zhang, Zhizhong Xie, Yuan Cheng, Shen Luo, Ziwei Yu, Lei Wen, Zhihong Wu, Qi Li, Youwei Fan, Haoqiang Sun, Jian Liu, Shuaicheng Huang, Yuanfei Jin, Meiguang Huang, Hua Liu, Jing Zhang, Xinjian Wang, Yan Long, Lingshun Li, Gen Zhang, Yuanfan Cao, Zuowei Sun, Lei Alexander, Panaetov Wang, Yucong Cai, Minjie Wang, Li Tian, Lu Wang, Zheyuan Ma, Hongbing Liu, Jie Chen, Chao Cai, Yidong Tang, Jie Wu, Gangshan Wang, Weiran Huang, Shirui Lu, Honglei Liu, Huan Wang, keyan Chen, Jun Chen, Shi Miao, Yuchun Huang, Zimo Zhang, Lefei Ayazoglu, Mustafa Xiong, Wei Xiong, Chengyi Wang, Fei Li, Hao Wen, Ruimian Yang, Zhijing Zou, Wenbin Zheng, Weixin Ye, Tian Zhang, Yuncheng Kong, Xiangzhen Arora, Aditya Zamir, Syed Waqas Khan, Salman Hayat, Munawar Khan, Fahad Shahbaz Gao, Dandan Zhou, Dengwen Ning, Qian Tang, Jingzhu Huang, Han Wang, Yufei Peng, Zhangheng Li, Haobo Guan, Wenxue Gong, Shenghua Li, Xin Liu, Jun Wang, Wanjun Zeng, Kun Lin, Hanjiang Chen, Xinyu Fang, Jinsheng Zhang, Shuhao Zhang, Yuhao Sinha, Abhishek Kumar Moorthi, S. Manthira Dhar, Debajyoti Yang, Hao-Hsiang Huang, Zhi-Kai Chen, Wei-Ting Chang, Hua-En Kuo, Sy-Yen Tan, Wei Chen, Hao Xu, Qian Narang, Pratik Singh, Usneek Sameen, Syed Khaitan, Harsh Yinghua, Liu Tianlin, Zhang Xiaoming, Zhang Meng, Dingxuan Tian, Chunwei Morshed, Mashrur M. Ahsan, Ahmad Omar Computer Vision Lab ETH Zurich Switzerland University of Würzburg Germany ByteDance Shenzhen China State Key Laboratory for Novel Software Technology Nanjing University China ByteDance Inc China NetEase Inc. China Shenzhen Institutes of Advanced Technology CAS China University of Macau China Shanghai AI Lab Shanghai China Nanjing University of Science and Technology China Amazon Web Services United States China Alibaba DAMO Academy EFC Yuhang District Zhejiang Hangzhou China East China Normal University China Youtu Lab Tencent China Megvii Technology China University of Electronic Science and Technology of China China School of Artificial Intelligence Beijing Normal University China Alibaba Group China Bilibili AI China Nankai-Baidu Joint Lab Nankai University Tianjin China Platform Technologies Tencent Online Video China Higher School of Economics Russia Huawei Moscow Research Center Russia Hunan University China Xidian University China Xilinx Technology Beijing Limited China College of Information Science and Engineering Xinjiang University Urumqi China Department of Electronic Engineering Tsinghua University Beijing China Nanjing University China McMaster University Canada School of Telecommunication Engineering Xidian University Xi’an China School of Computer Science Wuhan University Wuhan China School of Mathematical Science University of Electronic Science and Technology of China Chengdu China School of Computer Science The University of Sydney Sydney Australia Aselsan Research Ankara Turkey School of Electronic and Information Engineering South-Central University for Nationalities Wuhan China Guangdong University of Technology China Fujian Normal University Fuzhou University Jimei University China Design Group China Abu Dhabi United Arab Emirates Monash University Melbourne Australia Mohamed bin Zayed University of AI United Arab Emirates North China Electric Power University Changping District Beijing China The School of Art

This paper reviews the NTIRE 2022 challenge on efficient single image super-resolution with focus on the proposed solutions and results. The task of the challenge was to super-resolve an input image with a magnification factor of ×4 based on pairs of low and corresponding high resolution images. The aim was to design a network for single image super-resolution that achieved improvement of efficiency measured according to several metrics including runtime, parameters, FLOPs, activations, and memory consumption while at least maintaining the PSNR of 29.00dB on DIV2K validation set. IMDN is set as the baseline for efficiency measurement. The challenge had 3 tracks including the main track (runtime), sub-track one (model complexity), and sub-track two (overall performance). In the main track, the practical runtime performance of the submissions was evaluated. The rank of the teams were determined directly by the absolute value of the average runtime on the validation set and test set. In sub-track one, the number of parameters and FLOPs were considered. And the individual rankings of the two metrics were summed up to determine a final ranking in this track. In sub-track two, all of the five metrics mentioned in the description of the challenge including runtime, parameter count, FLOPs, activations, and memory consumption were considered. Similar to sub-track one, the rankings of five metrics were summed up to determine a final ranking. The challenge had 303 registered participants, and 43 teams made valid submissions. They gauge the state-of-the-art in efficient single image super-resolution. © 2022, CC BY.

关键词： Chemical activation

来源：评论

学校读者我要写书评

暂无评论

Interval Markov decision processes with multiple objectives: From Robust strategies to Pareto curves

Interval Markov decision processes with multiple objectives:...

引用

作者： Hahn, Ernst Moritz Hashemi, Vahid Hermanns, Holger Lahijanian, Morteza Turrini, Andrea School of Electronics Electrical Engineering and Computer Science Queen's University Belfast Belfast United Kingdom State Key Laboratory of Computer Science Institute of Software CAS Beijing China Department of Information Technology Audi AG Ingolstadt Germany Saarland University Saarland Informatics Campus Saarbrücken Germany Institute of Intelligent Software Guangzhou Guangzhou China Department of Smead Aerospace Engineering and Sciences University of Colorado BoulderCO United States

Accurate Modelling of a real-world system with probabilistic behaviour is a difficult task. Sensor noise and statistical estimations, among other imprecisions, make the exact probability values impossible to obtain. In this article, we consider Interval Markov decision processes (IMDPs), which generalise classical MDPs by having interval-valued transition probabilities. They provide a powerful modelling tool for probabilistic systems with an additional variation or uncertainty that prevents the knowledge of the exact transition probabilities. We investigate the problem of robust multi-objective synthesis for IMDPs and Pareto curve analysis of multi-objective queries on IMDPs. We study how to find a robust (randomised) strategy that satisfies multiple objectives involving rewards, reachability, and more general ω-regular properties against all possible resolutions of the transition probability uncertainties, as well as to generate an approximate Pareto curve providing an explicit view of the trade-offs between multiple objectives. We show that the multi-objective synthesis problem is PSPACE-hard and provide a value iteration-based decision algorithm to approximate the Pareto set of achievable points. We finally demonstrate the practical effectiveness of our proposed approaches by applying them on several case studies using a prototype tool. © 2019 Copyright held by the owner/author(s).

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Mutation testing for ethereum smart contract

arXiv

引用

arXiv 2019年

作者： Wu, Haoran Wang, Xingya Xu, Jiehui Zou, Weiqin Zhang, Lingming Chen, Zhenyu State Key Laboratory for Novel Software Technology Nanjing University 210093 China Department of Computer Science University of Texas Dallas United States

Smart contract is a special program that manages digital assets on blockchain. It is difficult to recover the loss if users make transactions through buggy smart contracts, which cannot be directly fixed. Hence, it is important to ensure the correctness of smart contracts before deploying them. This paper proposes a systematic framework to mutation testing for smart contracts on Ethereum, which is currently the most popular open blockchain for deploying and running smart contracts. Fifteen novel mutation operators have been designed for Ethereum Smart Contracts (ESC), in terms of keyword, global variable/- function, variable unit, and error handling. An empirical study on 26 smart contracts in four Ethereum DApps has been conducted to evaluate the effectiveness of mutation testing. The experimental results show that our approach can outperform the coverage-based approach on defect detection rate (96.01% vs. 55.68%). The ESC mutation operators are effective to reveal real defects and we found 117 out of 729 real bug reports are related to our operators. These show the great potential of using mutation testing for quality assurance of ESC. Copyright © 2019, The Authors. All rights reserved.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Multi-view knowledge graph embedding for entity alignment

arXiv

引用

arXiv 2019年

作者： Zhang, Qingheng Sun, Zequn Hu, Wei Chen, Muhao Guo, Lingbing Qu, Yuzhong State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science University of California Los Angeles United States

We study the problem of embedding-based entity alignment between knowledge graphs (KGs). Previous works mainly focus on the relational structure of entities. Some further incorporate another type of features, such as attributes, for refinement. However, a vast of entity features are still unexplored or not equally treated together, which impairs the accuracy and robustness of embedding-based entity alignment. In this paper, we propose a novel framework that unifies multiple views of entities to learn embeddings for entity alignment. Specifically, we embed entities based on the views of entity names, relations and attributes, with several combination strategies. Furthermore, we design some cross-KG inference methods to enhance the alignment between two KGs. Our experiments on real-world datasets show that the proposed framework significantly outperforms the state-of-the-art embeddingbased entity alignment methods. The selected views, cross-KG inference and combination strategies all contribute to the performance improvement. Copyright © 2019, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Non-invasive Assessment of Hepatic Venous Pressure Gradient (HVPG) Based on MR Flow Imaging and Computational Fluid Dynamics

arXiv

引用

arXiv 2021年

作者： Wang, Kexin Wang, Shuo Xiong, Minghua Wang, Chengyan Wang, He Department of Physics Fudan University Shanghai China Digital Medical Research Center School of Basic Medical Sciences Fudan University Shanghai China Shanghai Key Laboratory of Medical Image Computing and Computer Assisted Intervention Shanghai China Shanghai Zhiyu Software Information Co. Ltd China Human Phenome Institute Fudan University Shanghai China Institute of Science and Technology for Brain-inspired Intelligence Fudan University Shanghai China Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Fudan University Ministry of Education China

Clinically significant portal hypertension (CSPH) is a severe complication of chronic liver disease associated with cirrhosis, which is diagnosed by the measurement of hepatic venous pressure gradient (HVPG). However, HVPG measurement is invasive and therefore difficult to be widely applied in clinical routines. There is no currently available technique to measure HVPG noninvasively. Computational fluid dynamics (CFD) has been used for noninvasive measurement of vascular pressure gradient in the intracranial and coronary arteries. However, it has been scarcely employed in the hepatic vessel system due to the difficulties in reconstructing precise vascular anatomies and setting appropriate boundary conditions. Several computer tomography and ultrasound based studies have verified the effectiveness of virtual HVPG (vHVPG) by directly connecting the portal veins and hepatic veins before CFD simulations [16,12]. We apply the latest techniques of phase-contrast magnetic resonance imaging (PC-MRI) and DIXON to obtain the velocity and vessel anatomies at the same time. Besides, we improve the CFD pipeline in regards to the construction of vessel connections and reduction of calculation time. The proposed method shows high accuracy in the CSPH diagnosis in a study containing ten healthy volunteers and five patients. The MRI-based noninvasive HVPG measurement is promising in the clinical application of CSPH diagnosis. © 2021, CC BY.

关键词： Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

Modeling Geographically Correlated Failures to Assess Network Vulnerability

Modeling Geographically Correlated Failures to Assess Networ...

引用

作者： Wang, Xiaoliang Chen, Mingzhi Lu, Sanglu Department of Computer Science and Technology National Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China

Current communication networks are facing more and more threats from large-scale regional damages, such as natural disasters (e.g., earthquake or tornado) and physical attacks (e.g., electromagnetic pulse attack or dragging anchors). Recently, several region failure models have been proposed to evaluate the impact of such geographically correlated failures on communication networks. These works mainly adopt a kind of 'deterministic' models, where network components within the affected area would fail simultaneously. Such failure models simplify the analysis but may fail to reflect some important behaviors of attacks and thus cause significant over-or under-estimation of region failures. To emulate the impact of realistic catastrophe events such as earthquake and tornado, this paper introduces two probabilistic failure models: 1) a concentric circle model and 2) a line segment model. In the probabilistic models, both the location and effect of the damage are treated as random events. The failure may randomly incur on the entire network plane, and the failure probability of a device depends on many factors, e.g., link length and distance to the damage center. We develop an efficient grid partition-based scheme to estimate the network vulnerability. Based on the grid partition scheme, we further develop a sampling scheme to significantly reduce the computation cost. The probability model helps us more deeply understand the network behaviors under region failure and facilitates the design and maintenance of future highly survivable mission critical networks. © 1972-2012 IEEE.

关键词： Earthquakes

来源：评论

学校读者我要写书评

暂无评论

Scalability Evaluation of Big Data Processing Services in Clouds 1st

Scalability Evaluation of Big Data Processing Services in Cl...

引用

1st International Symposium on Benchmarking, Measuring, and Optimization, Bench 2018

作者： Zhou, Xin Jiang, Congfeng Qiu, Yeliang Fan, Tiantian Wang, Yumei Zhang, Liangbin Wan, Jian Shi, Weisong Key Laboratory of Complex Systems Modeling and Simulation Ministry of Education Hangzhou Dianzi University Hangzhou310037 China School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310037 China College of Big Data and Software Engineering Zhejiang Wanli University Ningbo China School of Information and Electronic Engineering Zhejiang University of Science and Technology Hangzhou310023 China Department of Computer Science Wayne State University DetroitMI48202 United States

ISBN: (纸本)9783030328122

Currently, many cloud providers deploy their big data processing systems as cloud services, which helps users conveniently manage and process their data in clouds. Among different service providers’ big data processing services, how to evaluate and compare their scalability is an interesting and challenging work. Most traditional benchmark tools focus on performance evaluation of big data processing systems, such as aggregated throughput and IOPS, but fail to conduct a quantitative analysis of their scalability. In this paper, we propose a measurement methodology to quantify the scalability of big data processing services, which makes the cloud services scalability comparable. We conduct a group of comparative experiments on AliCloud E-MapReduce and Baidu MRS, and collect their respective scalability characteristics under Hadoop and Spark workloads. The scalability characteristics observed in our work could help cloud users choose the best cloud service platform to set up an optimized big data processing system to achieve their specific goals more successfully. © 2019, Springer Nature Switzerland AG.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Power Characterization of Memory Intensive Applications: Analysis and Implications 1st

Power Characterization of Memory Intensive Applications: Ana...

引用

1st International Symposium on Benchmarking, Measuring, and Optimization, Bench 2018

作者： Qiu, Yeliang Jiang, Congfeng Fan, Tiantian Wang, Yumei Zhang, Liangbin Wan, Jian Shi, Weisong Key Laboratory of Complex Systems Modeling and Simulation Ministry of Education Hangzhou Dianzi University Hangzhou310037 China School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310037 China College of Big Data and Software Engineering Zhejiang Wanli University Ningbo China School of Information and Electronic Engineering Zhejiang University of Science and Technology Hangzhou310023 China Department of Computer Science Wayne State University DetroitMI48202 United States

ISBN: (纸本)9783030328122

DRAM is a significant source of server power consumption especially when the server runs memory intensive applications. Current power aware scheduling assumes that DRAM is as energy proportional as other components. However, the non-energy proportionality of DRAM significantly affects the power and energy consumption of the whole server system when running memory intensive applications. Thus good knowledge of server power characterization under memory intensive workloads can help better workload placement with power reduction. In this paper, we investigate the power characteristics of memory intensive applications on real rack servers of different generations. Through comprehensive analysis we find that (1) Server power consumption changes with workload intensity and concurrent execution threads. However, fully utilized memory systems are not the most energy efficient. (2) Powered memory modules of installed memory capacity, i.e. the memory capacity per processor core has significant impact on the application’s performance and server power consumption even if the memory system is not fully utilized. (3) Memory utilization is not always a good indicator for server power consumption when it is running memory intensive applications. Our experiments show that hardware configuration, workload types, as well as concurrently running threads have significant impact on a server’s energy efficiency when running memory intensive applications. Our findings presented in this paper provide useful insights and guidance to system designers, as well as data center operators for energy efficiency aware job scheduling and power reductions. © 2019, Springer Nature Switzerland AG.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：