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

Characterizing the performance-energy tradeoff of small ARM Cores in HPC computation 1

20th International Conference on Parallel Processing, Euro-Par 2014

作者： Laurenzano, Michael A. Tiwari, Ananta Jundt, Adam Peraza, Joshua Ward Jr., William A. Campbell, Roy Carrington, Laura EP Analytics United States Dept. of Computer Science and Engineering University of Michigan United States Performance Modeling and Characterization Lab San Diego Supercomputer Center United States High Performance Computing Modernization Program U.S. Dept. of Defense United States

ISBN: (数字)9783319098739

ISBN: (纸本)9783319098722

Deploying large numbers of small, low-power cores has been gaining traction recently as a system design strategy in high performance computing (HPC). The ARM platform that dominates the embedded and mobile computing segments is now being considered as an alternative to high-end x86 processors that largely dominate HPC because peak performance per watt may be substantially improved using off-the-shelf commodity processors. In this work we methodically characterize the performance and energy of HPC computations drawn from a number of problem domains on current ARM and x86 processors. Unsurprisingly, we find that the performance, energy and energy-delay product of applications running on these platforms varies significantly across problem types and inputs. Using static program analysis we further show that this variation can be explained largely in terms of the capabilities of two processor subsystems: single instruction multiple data (SIMD)/floating point and the cache/memory hierarchy;and that static analysis of this kind is sufficient to predict which platform is best for a particular application/input pair. In the context of these findings, we evaluate how some of the key architectural changes being made for upcoming 64-bit ARM platforms may impact HPC application performance. © 2014 Springer International Publishing Switzerland.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Heuristics for robust allocation of resources to parallel applications with uncertain execution times in heterogeneous systems with uncertain availability

Heuristics for robust allocation of resources to parallel ap...

引用

World Congress on engineering, WCE 2014

作者： Hansen, Timothy Ciorba, Florina M. Maciejewski, Anthony A. Siegel, Howard Jay Srivastava, Srishti Banicescu, Ioana Department of Electrical and Computer Engineering Colorado State University Fort Collins CO 80523 United States Center for Information Services and High Performance Computing Technische Universitöt Dresden Dresden 01062 Germany Department of Computer Science and Engineering Mississippi State University Mississippi State MS 30692 United States

ISBN: (纸本)9789881925275

The scheduling of moldable parallel applications to clusters of processors is challenging, where the number of processors on which a moldable application executes is decided by the scheduler. When the application execution times are stochastic in nature, and the availability of the resources is uncertain, this becomes an even greater challenge. A model is presented for the stochastic execution times of moldable parallel applications that are assigned to heterogeneous parallel resources, incorporating the change in execution times when applications are mapped to different numbers of processors. To account for the uncertainties in both application execution times and resource availability, a robustness model that combines the two sources of uncertainties is proposed. Using this robustness model, three novel iterative-greedy heuristics are developed to allocate heterogeneous resources to batches of parallel applications to maximize the probability of completing by a designated time, called the makespan goal. To verify the performance of the proposed heuristics, a simulation study is conducted using different batch and system sizes. To showcase the benefit of using the proposed iterative-greedy heuristics, their performance is studied against two comparison heuristics. The five heuristics are evaluated against the upper bound on robustness.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Contraint on mediator-baed dark matter and calar dark energy model uing = 13 TeV pp colliion data collected by the ATLAS detector

引用

Journal of high Energy Physics 2019年第5期2019卷 142-142页

作者： The ATLAS collaboration M. Aaboud G. Aad B. Abbott D. C. Abbott O. Abdinov D. K. Abhayasinghe S. H. Abidi O. S. AbouZeid N. L. Abraham H. Abramowicz H. Abreu Y. Abulaiti B. S. Acharya S. Adachi L. Adam C. Adam Bourdarios L. Adamczyk L. Adamek J. Adelman M. Adersberger A. Adiguzel T. Adye A. A. Affolder Y. Afik C. Agapopoulou M. N. Agaras A. Aggarwal C. Agheorghiesei J. A. Aguilar-Saavedra F. Ahmadov G. Aielli S. Akatsuka T. P. A. Åkesson E. Akilli A. V. Akimov K. Al Khoury G. L. Alberghi J. Albert M. J. Alconada Verzini S. Alderweireldt M. Aleksa I. N. Aleksandrov C. Alexa D. Alexandre T. Alexopoulos M. Alhroob B. Ali G. Alimonti J. Alison S. P. Alkire C. Allaire B. M. M. Allbrooke B. W. Allen P. P. Allport A. Aloisio A. Alonso F. Alonso C. Alpigiani A. A. Alshehri M. I. Alstaty M. Alvarez Estevez B. Alvarez Gonzalez D. Álvarez Piqueras M. G. Alviggi Y. Amaral Coutinho A. Ambler L. Ambroz C. Amelung D. Amidei S. P. Amor Dos Santos S. Amoroso C. S. Amrouche F. An C. Anastopoulos N. Andari T. Andeen C. F. Anders J. K. Anders A. Andreazza V. Andrei C. R. Anelli S. Angelidakis I. Angelozzi A. Angerami A. V. Anisenkov A. Annovi C. Antel M. T. Anthony M. Antonelli D. J. A. Antrim F. Anulli M. Aoki J. A. Aparisi Pozo L. Aperio Bella G. Arabidze J. P. Araque V. Araujo Ferraz R. Araujo Pereira A. T. H. Arce F. A. Arduh J-F. Arguin S. Argyropoulos J.-H. Arling A. J. Armbruster L. J. Armitage A. Armstrong O. Arnaez H. Arnold A. Artamonov G. Artoni S. Artz S. Asai N. Asbah E. M. Asimakopoulou L. Asquith K. Assamagan R. Astalos R. J. Atkin M. Atkinson N. B. Atlay K. Augsten G. Avolio R. Avramidou M. K. Ayoub A. M. Azoulay G. Azuelos A. E. Baas M. J. Baca H. Bachacou K. Bachas M. Backes F. Backman P. Bagnaia M. Bahmani H. Bahrasemani A. J. Bailey V. R. Bailey J. T. Baines M. Bajic C. Bakalis O. K. Baker P. J. Bakker D. Bakshi Gupta S. Balaji E. M. Baldin P. Balek F. Balli W. K. Balunas J. Balz E. Banas A. Bandyopadhyay Sw. Banerjee A. A. E. Bannoura L. Barak W. M. Barbe E. L. Barberio D. Barberis M. Barbero T. Barillari M-S. B University Politehnica Bucharest Université Ibn-Tofail Universidade Nova de Lisboa CERN Université Mohamed Premier and LPTPM CPPM Aix-Marseille Université CNRS/IN2P3 University of Oklahoma University of Massachusetts Azerbaijan Academy of Sciences Royal Holloway University of London University of Toronto University of Copenhagen University of Sussex Tel Aviv University Technion Israel Institute of Technology Argonne National Laboratory Sezione di Trieste ICTP King’s College London University of Tokyo Universität Mainz Université Paris-Saclay AGH University of Science and Technology Faculty of Physics and Applied Computer Science Northern Illinois University Ludwig-Maximilians-Universität München Bogazici University Istanbul University Dept. of Physics Particle Physics Department Rutherford Appleton Laboratory University of California Santa Cruz LPC Université Clermont Auvergne CNRS/IN2P3 Radboud University Nijmegen/Nikhef Alexandru Ioan Cuza University of Iasi Universidad de Granada Laboratório de Instrumentação e Física Experimental de Partículas – LIP IFT-UAM/CSIC Joint Institute for Nuclear Research INFN Sezione di Roma Tor Vergata Università di Roma Tor Vergata Kyoto University Lunds universitet Université de Genève P.N. Lebedev Physical Institute of the Russian Academy of Sciences INFN Sezione di Bologna INFN Bologna and Universita’ di Bologna Dipartimento di Fisica University of Victoria Universidad Nacional de La Plata and CONICET Horia Hulubei National Institute of Physics and Nuclear Engineering Humboldt Universität zu Berlin National Technical University of Athens Republic Czech Technical University in Prague INFN Sezione di Milano University of Chicago University of Washington University of Oregon University of Birmingham INFN Sezione di Napoli Università di Napoli University of Glasgow Universidad Autónoma de Madrid Centro Mixto Universidad de Valencia – CSIC Universidade Federal do Rio De Janeiro COPPE/EE/IF McGill University Oxford University Brandeis University University of Michigan Unive

来源：评论

学校读者我要写书评

暂无评论

Scalability Analysis and Evaluation of Divisible Load Scheduling

Scalability Analysis and Evaluation of Divisible Load Schedu...

引用

International Conference on Parallel Processing Workshops (ICPPW)

作者： Mahadevan Balasubramaniam Ioana Banicescu Florina M. Ciorba Department of Computer Science & Engineering Mississippi State University Mississippi USA Center for Information Services and High Performance Computing Technische Universität Dresden Germany

ISBN: (纸本)9781479956166

In this work, we address the problem of the scalability of divisible load scheduling of data parallel workloads (also called arbitrarily divisible workloads) on high performance parallel and distributed computing systems. Divisible load theory offers a linear, deterministic, and tractable model for scheduling arbitrarily divisible workloads, often encountered in scientific applications. With the continuous increasing problem and the system sizes, it is imperative that application scheduling algorithms scale well to leverage the processing capabilities of the high performance computing systems. We conduct an analytical evaluation as well as a simulation-based study of the scalability of divisible load scheduling algorithms, called DLT algorithms, when applied for scheduling two NAS parallel benchmarks, namely, the embarrassingly parallel (EP) and the integer sort (IS) benchmarks onto a target system modeled as a 3-d torus topology. The EP benchmark is computationally intensive and the IS benchmark is communication intensive. Two questions related to the scalability study are addressed, namely, the fastest time to solve the problem and the condition for cost-optimality. A simulation-based study was conducted to support and verify the solutions obtained via the analytical model.

关键词： Benchmark testing Computational modeling Scalability Load modeling Mathematical model Processor scheduling Runtime

来源：评论

学校读者我要写书评

暂无评论

Portfolio-Based Selection of Robust Dynamic Loop Scheduling Algorithms Using Machine Learning

Portfolio-Based Selection of Robust Dynamic Loop Scheduling ...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Nitin Sukhija Brandon Malone Srishti Srivastava Ioana Banicescu Florina M. Ciorba Department of Computer Science and Engineering Mississippi State University MS USA Department of Computer Science Helsinki Institute for Information Technology Technische Universität Dresden Center for Information Services and High Performance Computing Dresden Germany

ISBN: (纸本)9781479941155

The execution of computationally intensive parallel applications in heterogeneous environments, where the quality and quantity of computing resources available to a single user continuously change, often leads to irregular behavior, in general due to variations of algorithmic and systemic nature. To improve the performance of scientific applications, loop scheduling algorithms are often employed for load balancing of their parallel loops. However, it is a challenge to select the most robust scheduling algorithms for guaranteeing optimized performance of scientific applications on large-scale computing systems that comprise resources which are widely distributed, highly heterogeneous, often shared among multiple users, and have computing availabilities that cannot always be guaranteed or predicted. To address this challenge, in this work we focus on a portfolio-based approach to enable the dynamic selection and use of the most robust dynamic loop scheduling (DLS) algorithm from a portfolio of DLS algorithms, depending on the given application and current system characteristics including workload conditions. Thus, in this paper we provide a solution to the algorithm selection problem and experimentally evaluate its quality. We propose the use of supervised machine learning techniques to build empirical robustness prediction models that are used to predict DLS algorithm's robustness for given scientific application characteristics and system availabilities. Using simulated scientific applications characteristics and system availabilities, along with empirical robustness prediction models, we show that the proposed portfolio-based approach enables the selection of the most robust DLS algorithm that satisfies a user-specified tolerance on the given application's performance obtained in the particular computing system with a certain variable availability. We also show that the portfolio-based approach offers higher guarantees regarding the robust performance of the applic

关键词： Robustness Heuristic algorithms Prediction algorithms Program processors Availability Predictive models Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

On Reliability and Security in Knowledge Grids

On Reliability and Security in Knowledge Grids

引用

International Conference on P2P, Parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Christian Esposito Massimo Ficco Francesco Palmieri Vincenzo Loia Institute of High Performance Computing and Networking (ICAR) Italian National Research Council (CNR) Naples Italy Department of Industrial and Information Engineering Second University of Naples Aversa CE Italy Department of Computer Science University of Salerno Fisciano SA Italy

Proper knowledge management and advanced semantic reasoning are of pivotal importance in promoting innovation and productivity in a cooperative team and opening new opportunities in commerce, science, and computing applications. To address such a requirements a series of solutions for distributed knowledge management have been proposed over the last decade, among which the most promising is the so-called knowledge grid. Such infrastructures have been traditionally designed for science and educational applications, but they are starting to be progressively used in more critical scenarios, such as disaster management and recovery, or financial services. This imposes the need of providing reliability and security within the context of knowledge grids. The goal of this paper is to define such needs and to describe the correspondence of the available solutions to these needs. Last, we highlight possible space for research opportunities within the topics of reliability and security in knowledge grids.

关键词： Reliability Security Knowledge engineering Semantics Routing Context Distributed databases

来源：评论

学校读者我要写书评

暂无评论

Parallel architecture and optimization for discrete-event simulation of spike neural networks

引用

science China(Technological sciences) 2013年第2期56卷 509-517页

作者： TANG YuHua ZHANG BaiDa WU JunJie HU TianJiang ZHOU Jing LIU FuDong Department of Computer Science and Technology School of ComputerNational University of Defense Technology State Key Laboratory of High Performance Computing National University of Defense Technology College of Mechatronic Engineering and Automation National University of Defense Technology

Spike neural networks are inspired by animal brains,and outperform traditional neural networks on complicated ***,spike neural networks are usually used on a large scale,and they cannot be computed on commercial,off-the-shelf computers.A parallel architecture is proposed and developed for discrete-event simulations of spike neural ***,mechanisms for both parallelism degree estimation and dynamic load balance are emphasized with theoretical and computational *** results show the effectiveness of the proposed parallelized spike neural network system and its corresponding support components.

关键词： spike neural network discrete event simulation intelligent parallelization framework

来源：评论

学校读者我要写书评

暂无评论

Parallel Bayesian Network Structure Learning for Genome-Scale Gene Networks

Parallel Bayesian Network Structure Learning for Genome-Scal...

引用

Supercomputing Conference

作者： Sanchit Misra Md. Vasimuddin Kiran Pamnany Sriram P. Chockalingam Yong Dong Min Xie Maneesha R. Aluru Srinivas Aluru Parallel Computing Lab Intel Corporation Bangalore India Dept. of Computer Science and Engineering Indian Institute of Technology Bombay Mumbai India State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China School of Biology Georgia Institute of Technology Atlanta USA School of Computational Science and Engineering Georgia Institute of Technology Atlanta USA

Learning Bayesian networks is NP-hard. Even with recent progress in heuristic and parallel algorithms, modeling capabilities still fall short of the scale of the problems encountered. In this paper, we present a massively parallel method for Bayesian network structure learning, and demonstrate its capability by constructing genome-scale gene networks of the model plant Arabidopsis thaliana from over 168.5 million gene expression values. We report strong scaling efficiency of 75% and demonstrate scaling to 1.57 million cores of the Tianhe-2 supercomputer. Our results constitute three and five orders of magnitude increase over previously published results in the scale of data analyzed and computations performed, respectively. We achieve this through algorithmic innovations, using efficient techniques to distribute work across all compute nodes, all available processors and coprocessors on each node, all available threads on each processor and coprocessor, and vectorization techniques to maximize single thread performance.

关键词： Bayes methods Hypercubes Instruction sets Genomics Bioinformatics Coprocessors Vectors

来源：评论

学校读者我要写书评

暂无评论

Coordinated Caching Model for Minimizing Energy Consumption in Radio Access Network

Coordinated Caching Model for Minimizing Energy Consumption ...

引用

IEEE International Conference on Communications

作者： Yuemei Xu Yang Li Zihou Wang Tao Lin Guoqiang Zhang Song Ci High Performance Network Lab Institute of Acoustics Chinese Academy of Sciences National Computer Network Emergency Response Technical Team/Coordination Center of China School of Computer Science and Technology Nanjing Normal University Nanjing China Department of Computer and Electronics Engineering University of Nebraska-Lincoln

To reduce network access latency, network traffic volume, and server load, caching capacity was proposed as a component of eNodeBs in the ratio access network (RAN). These eNodeB caches require less transport energy but bring additional caching energy through providing each eNodeB with caching capacity. It is thus challenging for eNodeBs to make content placement and request routing decisions so as to minimize the total energy consumption, especially when considering different caching hardware technologies, arrival rate of requests and content popularity. To address this problem, we first build an energy model to formulate the problem of minimizing energy consumption at eNodeB caches. Then a Lagrangian relaxation technique is adopted to find a near-optimal solution to the proposed model. Based on the proposed model and the obtained solution, we design a practical scheme for coordinating the content placement and request routing, and thus ensure the minimum-energy eNodeB caches. Compared with the existing works, our proposal significantly reduces the energy consumption by approximately 28% while keeps a good network performance. Our results also indicate that caching hardware technologies and content popularity greatly affect the content placement, therefore are crucial to the energy efficiency of eNodeB caches.

关键词： Energy consumption Servers Radio access networks Nickel Routing Random access memory Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Gaussian-modulated coherent-state measurement-device-independent quantum key distribution

引用

Physical Review A 2014年第4期89卷 042335-042335页

作者： Xiang-Chun Ma Shi-Hai Sun Mu-Sheng Jiang Ming Gui Lin-Mei Liang College of Science National University of Defense Technology Changsha 410073 People's Republic of China Centre for Quantum Information and Quantum Control Department of Physics and Department of Electrical and Computer Engineering University of Toronto Toronto Ontario Canada M5S 3G4 State Key Laboratory of High Performance Computing National University of Defense Technology Changsha 410073 People's Republic of China

Measurement-device-independent quantum key distribution (MDI-QKD), leaving the detection procedure to the third partner and thus being immune to all detector side-channel attacks, is very promising for the construction of high-security quantum information networks. We propose a scheme to implement MDI-QKD, but with continuous variables instead of discrete ones, i.e., with the source of Gaussian-modulated coherent states, based on the principle of continuous-variable entanglement swapping. This protocol not only can be implemented with current telecom components but also has high key rates compared to its discrete counterpart; thus it will be highly compatible with quantum networks.

关键词： GAUSSIAN distribution COHERENT states QUANTUM networks (Optics) QUANTUM entanglement BELL'S theorem PARAMETER estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：