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

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

A practical method for estimating coupling functions in complex dynamical systems

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Tokuda, Isao T. Levnajic, Zoran Ishimura, Kazuyoshi Department of Mechanical Engineering Ritsumeikan University Kusatsu Japan Complex Systems and Data Science Lab Faculty of Information Studies in Novo Mesto Novo Mesto Slovenia

A foremost challenge in modern network science is the inverse problem of reconstruction (inference) of coupling equations and network topology from the measurements of the network dynamics. Of particular interest are the methods that can operate on real (empirical) data without interfering with the system. One of such earlier attempts [Tokuda et al., PRL, 2007] was a method suited for general limit-cycle oscillators, yielding both oscillators’ natural frequencies and coupling functions between them (phase equations) from empirically measured time series. The present paper reviews the above method in a way comprehensive to domain-scientists other than physics. It also presents applications of the method to (i) detection of the network connectivity, (ii) inference of the phase sensitivity function, (iii) approximation of the interaction among phase-coherent chaotic oscillators, (iv) experimental data from a forced Van der Pol electric circuit. This reaffirms the range of applicability of the method for reconstructing coupling functions and makes it accessible to a much wider scientific community. Copyright © 2019, The Authors. All rights reserved.

关键词： Circuit oscillations

Informal caregivers' attitudes and compliance towards a connected health platform for home care support: Insights from a long-term exposure

学校读者我要写书评

暂无评论

Gerontechnology 2019年第4期18卷 231-242页

作者： Guisado-Fernández, Estefanía Giunti, Guido Mackey, Laura Silva, Paula Alexandra Blake, Catherine Caulfield, Brian Insight Centre for Data Analytics University College Dublin 3rd floor O'Brien Science Building East Dublin Ireland M3S Research Unit Faculty of Information Technology and Electrical Engineering University of Oulu Oulu Finland School of Public Health Physiotherapy and Sports Science University College Dublin Dublin Ireland Department of Computer Science Center for Informatics and Systems of the University of Coimbra (CISUC) University of Coimbra Coimbra Portugal

Background When designing Connected Health (CH) solutions for home care, it is vital to focus on usability and user experience to ensure that technologies are easy to use and meet users' expectations and needs. Generally, the usability and user experience tests are conducted during short-term exposure, which does not allow a true understanding of how the technology can help with the home caring tasks. Research aim We aim to investigate informal caregivers' feedback on the utility and usability of a CH monitoring platform for People with Dementia (PwD) during a period of extended use in the natural living context, and to understand how this was related to compliance patterns. Methods Informal caregiver's feedback about the CH platform, usability, and the impact of short-term versus long-term exposure were investigated through semi-structured individual interviews at the beginning and end of a 6-month deployment in the home care setting. Informal caregivers' compliance with the CH platform was analysed from their daily platform utilization during the deployment time. Results 11 informal caregivers agreed to participate. There was a change in the participants' opinions about the CH platform between the short-term and the long-term exposure feedback. Their initial impressions about what the CH platform could offer them to improve their delivery of home care for the PwD did not correspond with what they found that the CH platform could provide them following the long-term exposure. If at the beginning they saw the CH platform as a helpful tool to facilitate home care delivery and to improve their self-efficacy, after the deployment they expressed that because of the way the platform was designed it was mainly conceived for dementia research benefit and not to fulfill their caring needs. Compliance with the CH platform was quite low and similar between all participants. Conclusions Most contemporary CH studies are not conducted in real-life settings and without enough dur

关键词： Connected health Dementia Informal caregiver Usability User experience

On the selection of solutions for mutation in differential evolution

学校读者我要写书评

暂无评论

Frontiers of Computer science 2018年第2期12卷 297-315页

作者： Yong WANG Zhi-Zhong LIU Jianbin LI Han-Xiong LI Jiahai WANG School of Information Science and Engineering Central South University Changsha 410083 China School of Computer Science and Informatics De Montfort University Leicester LE1 9BH UK Institute of Information Security and Big Data Central South University Changsha 410083 China Department of Systems Engineering and Engineering Management City University of Hong Kong Hong Kong China State Key Laboratory of High Performance Complex Manufacturing Central South University Changsha 410083 China School of Data and Computer Science Sun Yat-sen University Guangzhou 510006 China

Differential evolution （DE） is a kind of evolutionary algorithms, which is suitable for solving complex optimization problems. Mutation is a crucial step in DE that generates new solutions from old ones. It was argued and has been commonly adopted in DE that the solutions selected for mutation should have mutually different indices. This restrained condition, however, has not been verified either theoretically or empirically yet. In this paper, we empirically investigate the selection of solutions for mutation in DE. From the observation of the extensive experiments, we suggest that the restrained condition could be relaxed for some classical DE versions as well as some advanced DE variants. Moreover, relaxing the restrained condition may also be useful in designing better future DE algorithms.

关键词： differential evolution mutation the selection of solutions for mutation evolutionary algorithms

Translating the grid: How a translational approach shaped the development of grid computing

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Foster, Ian Kesselman, Carl Data Science and Learning Division Argonne National Lab LemontIL60439 United States Department of Computer Science University of Chicago ChicagoIL60637 United States Information Sciences Institute Marina del ReyCA90292 United States Department of Industrial and Systems Engineering U. Southern California Los AngelesCA90089 United States

A growing gap between progress in biological knowledge and improved health outcomes inspired the new discipline of translational medicine, in which the application of new knowledge is an explicit part of a research plan. Abramson and Parashar argue that a similar gap between complex computational technologies and ever-more-challenging applications demands an analogous discipline of translational computer science, in which the deliberate movement of research results into large-scale practice becomes a central research focus rather than an afterthought. We revisit from this perspective the development and application of grid computing from the mid-1990s onwards, and find that a translational framing is useful for understanding the technology’s development and impact. We discuss how the development of grid computing infrastructure, and the Globus Toolkit, in particular, benefited from a translational approach. We identify lessons learned that can be applied to other translational computer science initiatives. Copyright © 2020, The Authors. All rights reserved.

关键词： Grid computing

Robot Simulation and Reinforcement Learning Training Platform Based on Distributed Architecture 4th

学校读者我要写书评

暂无评论

Robot Simulation and Reinforcement Learning Training Platfor...

4th International Conference on Cognitive systems and information Processing, ICCSIP 2018

作者： Jiang, Yun-Liang Huang, Zeng-Qiang Cao, Jun-Jie Liu, Yong Ma, Xinqiang Huang, Yi School of Computer Science Hangzhou Dianzi University Hangzhou310018 China School of Information Engineering Huzhou University Huzhou313000 China Institute of Cyber Systems and Control Zhejiang University Hangzhou310027 China Institute of Intelligent Computing and Visualization Based on Big Data Chongqing University of Arts and Sciences Chongqing402160 China

ISBN: (纸本)9789811379826

In recent years, reinforcement learning, which enables robots to learn previously missing abilities, plays an increasingly important role in robotics, such as learning hard-to-code behaviors or optimizing problems without an accepted closed solution. The main problem of RL in robotics is that it is expensive and takes a long time to learn and operate. Another problem: advanced robot simulators like Gazebo are inefficient and time-consuming. In order to cope with these problems, a hybrid computing platform based on traditional robot simulation architecture and distributed architecture (hereinafter referred to as RDTP) is proposed in this paper, which helps to save cost, shorten time and speed up simulation and training. Additionally, the platform is optimized to a certain extent in terms of ease of use and compatibility. © 2019, Springer Nature Singapore Pte Ltd.

关键词： Reinforcement learning

Comparison of phase change process in Si-GST hybrid integrated waveguide and MMI devices

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhang, Hanyu Yang, Xing Lu, Liangjun Chen, Jianping Rahman, B.M.A. Zhou, Linjie College of Telecommunications and Information Engineering Nanjing University of Posts and Telecommunications Nanjing210023 China State Key Laboratory of Advanced Optical Communication Systems and Networks Shanghai Institute for Advanced Communication and Data Science Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Electrical and Electronic Engineering City University of London LondonEC 1V0HB United Kingdom

In the past decades, silicon photonic integrated circuits (PICs) have been considered as a promising approach to solve the bandwidth bottleneck in optical communications and interconnections. Despite significant advances, large-scale PICs still face a series of technical challenges, such as footprint, power consumption, and routing state storage, resulting from the active tuning methods used to control the optical waves. These challenges can be partially addressed by combining chalcogenide phase change materials (PCMs) such as Ge2Sb2Te5 (GST) with silicon photonics, especially applicable in switching applications due to the nonvolatile nature of the GST. Although GST phase transitions between amorphous and crystalline states actuated by optical and electrical pulses heating have been experimentally demonstrated, there is no direct comparison between them. We carried out simulations and experiments to systematically investigate the difference in the phase change process induced by optical and electrical pulses for two types of Si-GST hybrid waveguides. For the phase transition induced by optical pulses, the device has a clear advantage in terms of power consumption and operation speed. For the phase transition induced by electrical pulses, the device is suitable for large-scale integration because it does not require complex light routing. It helps us better understand the phase change process and push forward the further development of Si-GST hybrid integration platform, bringing in new potential *** Codes 78M50 Copyright © 2020, The Authors. All rights reserved.

关键词： Photonic devices

Towards Flexible Sparsity-Aware Modeling: Automatic Tensor Rank Learning Using The Generalized Hyperbolic Prior

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Cheng, Lei Chen, Zhongtao Shi, Qingjiang Wu, Yik-Chung Theodoridis, Sergios The College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China Hangzhou310027 China The Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong The School of Software Engineering Tongji University Shanghai201804 China The Shenzhen Research Institute of Big Data Shenzhen518172 China The National and Kapodistrian University of Athens Greece Greece The Department of Electronic Systems Aalborg University Denmark

Tensor rank learning for canonical polyadic decomposition (CPD) has long been deemed as an essential yet challenging problem. In particular, since the tensor rank controls the complexity of the CPD model, its inaccurate learning would cause overfitting to noise or underfitting to the signal sources, and even destroy the interpretability of model parameters. However, the optimal determination of a tensor rank is known to be a non-deterministic polynomial-time hard (NP-hard) task. Rather than exhaustively searching for the best tensor rank via trial- and-error experiments, Bayesian inference under the Gaussian-gamma prior was introduced in the context of probabilistic CPD modeling, and it was shown to be an effective strategy for automatic tensor rank determination. This triggered flourishing research on other structured tensor CPDs with automatic tensor rank learning. On the other side of the coin, these research works also reveal that the Gaussian-gamma model does not perform well for high-rank tensors and/or low signal-to-noise ratios (SNRs). To overcome these drawbacks, in this paper, we introduce a more advanced generalized hyperbolic (GH) prior to the probabilistic CPD model, which not only includes the Gaussian-gamma model as a special case, but also is more flexible to adapt to different levels of sparsity. Based on this novel probabilistic model, an algorithm is developed under the framework of variational inference, where each update is obtained in a closed-form. Extensive numerical results, using synthetic data and real-world datasets, demonstrate the significantly improved performance of the proposed method in learning both low as well as high tensor ranks even for low SNR cases. Copyright © 2020, The Authors. All rights reserved.

关键词： Tensors

SRSC: Improving Restore Performance for Deduplication-Based Storage systems

学校读者我要写书评

暂无评论

ZTE Communications 2019年第2期17卷 59-66页

作者： ZUO Chunxue WANG Fang TANG Xiaolan ZHANG Yucheng FENG Dan Key Laboratory of Information Storage Systems Engineering Research Center of Data Storage Systems and TechnologyHuazhong University of Science and TechnologyWuhanHubei 430074China 5G Application Product Line ZTE CorporationShenzhenGuangdong 518057China

Modern backup systems exploit data deduplication technology to save stor-age space whereas suffering from the fragmentation problem caused by *** degrades the restore performance because of restoring the chunks thatare scattered all over different containers. To improve the restore performance, thestate-of-the-art History Aware Rewriting Algorithm(HAR) is proposed to collect frag-mented chunks in the last backup and rewrite them in the next backup. However, dueto rewriting fragmented chunks in the next backup, HAR fails to eliminate internalfragmentation caused by self-referenced chunks(that exist more than two times in abackup) in the current backup, thus degrading the restore performance. In this paper,we propose Selectively Rewriting Self-Referenced Chunks(SRSC), a scheme that de-signs a buffer to simulate a restore cache, identify internal fragmentation in the cacheand selectively rewrite them. Our experimental results based on two real-world datas-ets show that SRSC improves the restore performance by 45% with an acceptable sac-rifice of the deduplication ratio.

关键词： data deduplication fragmentation restore performance