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

A big data based data storage systems for rock burst experiment

International Journal of Wireless and Mobile Computing 2013年第5期6卷 463-472页

作者： Zhang, Yu Bai, Yan-Ping Zhu, Dong-Feng Lv, Zhao-Yong Department of Computer Science Beijing University of Civil Engineering and Architecture Beijing China State Key Laboratory for GeoMechanics and Deep Underground Engineering China University of Mining and Technology Beijing China School of Management Capital Normal University Beijing China School of Computer Science and Technology Beijing Institute of Technology Beijing China Department of Computer Teaching and Network Information Beijing University of Civil Engineering and Architecture Beijing China

State Key laboratory for GeoMechanics and Deep Underground Engineering, Deep-Lab for short, has been committed to the study of rock burst. Deep-Lab accumulated a large number of rock-burst data. With the deepening of the research progress, massive-data dilemma, artificial-management-data dilemma and experimental-data-analysis dilemma have become three big problems of rock burst. These dilemmas restrict the development of rock burst research technologies. This article takes big data in rock burst experiment as research objects and innovatively introduces big data technology into rock burst. Digital features of rock-burst experimental data were extracted. On this basis, a big data based data storage systems for rock burst experiment, BDSS for short, was designed and built. Then an integrated rock burst experimental platform was constructed. Experiments show that, BDSS solves three dilemmas of rock burst, and realises the distributed storage system of data. BDSS also realises dynamic and efficient load of rock-burst big data, and its efficient query under complication conditions. Copyright © 2013 Inderscience Enterprises Ltd.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Hybrid approach of filtering unnecessary way accesses for set-associative caches

引用

Jisuanji Xuebao/Chinese Journal of computers 2013年第4期36卷 799-808页

作者： Fan, Ling-Jun Xu, Yuan-Chao Shi, Wei-Song Fan, Dong-Rui Lou, Jie State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Science Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China Department of Computer Science Wayne State University Detroit MI-48202 United States Intel Corporation Beijing 100190 China College of Information Engineering Capital Normal University Beijing 100048 China

Power has been a big issue in processor design for several years. Conventional popular approaches for addressing this issue like DVFS (Dynamic Voltage Frequency Scaling) now hit the law of diminishing returns. As multi/many-core processors becoming the main stream processors, caches account for more and more CPU die area and power, this paper presents using filtering unnecessary way accesses to reduce dynamic power consumption of caches shared by instruction and data. The methods include using Invalid Filter, which could eliminate accesses to cache ways contained invalid blocks, and I/D Filter, which could eliminate accesses to cache ways contained instruction/data access type mismatch blocks, and Tag-2 Filter, which could eliminate accesses to cache ways contained tag lowest 2 bits mismatch blocks. Since the methods reducing the activities happened in cache architecture, dynamical CPU power could be significantly decreased. In the paper, we also propose combining the above methods together, which is called Invalid+I/D+Tag-2 Filter, in an attempt to achieve better power saving results. We have verified the effectiveness and complementariness of the three proposed methods through analysis and experiments. Also, our evaluations show that, we could obtain 19.6%~47.8% (which is on average 34.3%) improvement on a 64KB-4way set-associative cache and 19.6%~55.2% (which is on average 39.2%) improvement on a 128KB-8way set-associative cache comparing to Invalid+I/D Filter, and 16.1%~27.7% (which is on average 16.6%) improvement on a 64KB-4way set-associative cache and 6.9%~44.4% (which is on average 25.0%) improvement on a 128KB-8way set-associative cache comparing to Invalid+Tag-2 Filter, respectively.

关键词： Bandpass filters

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Circular Queue Method for Iterative Stencil Computations on GPUs

引用

Journal of computer science & Technology 2012年第1期27卷 57-74页

作者： Yang Yang Hui-Min Cui Xiao-Bing Feng Jing-Ling Xue State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences Beijing 100190China Graduate University of Chinese Academy of Sciences Beijing 100190China Programming Languages and Compilers Group School of Computer Science and Engineering University of New South WalesSydneyNSW 2052Australia

In this paper, we present a hybrid circular queue method that can significantly boost the performance of stencil computations on GPU by carefully balancing usage of registers and shared-memory. Unlike earlier methods that rely on circular queues predominantly implemented using indirectly addressable shared memory, our hybrid method exploits a new reuse pattern spanning across the multiple time steps in stencil computations so that circular queues can be implemented by both shared memory and registers effectively in a balanced manner. We describe a framework that automatically finds the best placement of data in registers and shared memory in order to maximize the performance of stencil computations. Validation using four different types of stencils on three different GPU platforms shows that our hybrid method achieves speedups up to 2.93X over methods that use circular queues implemented with shared-memory only.

关键词： stencil computation circular queue GPU occupancy register

来源：评论

学校读者我要写书评

暂无评论

Combined Measurement of the Higgs Boson Mass in pp Collisions at s=7 and 8 TeV with the ATLAS and CMS Experiments

引用

Physical Review Letters 2015年第19期114卷 191803-191803页

作者： G. Aad B. Abbott J. Abdallah O. Abdinov R. Aben M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu R. Abreu Y. Abulaiti B. S. Acharya L. Adamczyk D. L. Adams J. Adelman S. Adomeit T. Adye A. A. Affolder T. Agatonovic-Jovin J. A. Aguilar-Saavedra S. P. Ahlen F. Ahmadov G. Aielli H. Akerstedt T. P. A. Åkesson G. Akimoto A. V. Akimov G. L. Alberghi J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander T. Alexopoulos M. Alhroob G. Alimonti L. Alio J. Alison S. P. Alkire B. M. M. Allbrooke P. P. Allport A. Aloisio A. Alonso F. Alonso C. Alpigiani A. Altheimer B. Alvarez Gonzalez D. Álvarez Piqueras M. G. Alviggi B. T. Amadio K. Amako Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos A. Amorim S. Amoroso N. Amram G. Amundsen C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders G. Anders J. K. Anders K. J. Anderson A. Andreazza V. Andrei S. Angelidakis I. Angelozzi P. Anger A. Angerami F. Anghinolfi A. V. Anisenkov N. Anjos A. Annovi M. Antonelli A. Antonov J. Antos F. Anulli M. Aoki L. Aperio Bella G. Arabidze Y. Arai J. P. Araque A. T. H. Arce F. A. Arduh J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster O. Arnaez V. Arnal H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Asai N. Asbah A. Ashkenazi B. Åsman L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay B. Auerbach K. Augsten M. Aurousseau G. Avolio B. Axen M. K. Ayoub G. Azuelos M. A. Baak A. E. Baas C. Bacci H. Bachacou K. Bachas M. Backes M. Backhaus E. Badescu P. Bagiacchi P. Bagnaia Y. Bai T. Bain J. T. Baines O. K. Baker P. Balek T. Balestri F. Balli E. Banas Sw. Banerjee A. A. E. Bannoura H. S. Bansil L. Barak S. P. Baranov E. L. Barberio D. Barberis M. Barbero T. Barillari M. Barisonzi T. Barklow N. Barlow S. L. Barnes B. M. Barnett R. M. Barnett Z. Barnovska A. Baroncelli G. Barone A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos A. Bassalat A. Basye R. L. Bates S. J. Batista J. R. Batley M. Battaglia M. Bauce F. Bauer H. S. Bawa J. B. Beach CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman Oklahoma USA Institute of Physics Academia Sinica Taipei Taiwan Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam Netherlands Department of Physics and Astronomy Michigan State University East Lansing Michigan USA Department of Physics University of Toronto Toronto Ontario Canada Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel CERN Geneva Switzerland Department of Physics Stockholm University Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Physics Department Brookhaven National Laboratory Upton New York USA Department of Physics Northern Illinois University DeKalb Illinois USA Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Oliver Lodge Laboratory University of Liverpool Liverpool United Kingdom Institute of Physics University of Belgrade Belgrade Serbia Laboratorio de Instrumentacao e Fisica Experimental de Particulas-LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada (Spain) Portugal Department of Physics Boston University Boston Massachusetts USA Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN Sezione di Roma Tor Vergata Roma Italy Dipartimento di Fisica Università di Roma Tor Vergata Roma Italy Fysiska institutionen Lunds universitet Lund Sweden International Center for Elementary Particle Physics and Depart

A measurement of the Higgs boson mass is presented based on the combined data samples of the ATLAS and CMS experiments at the CERN LHC in the H→γγ and H→ZZ→4ℓ decay channels. The results are obtained from a simultaneous fit to the reconstructed invariant mass peaks in the two channels and for the two experiments. The measured masses from the individual channels and the two experiments are found to be consistent among themselves. The combined measured mass of the Higgs boson is mH=125.09±0.21 (stat)±0.11 (syst) GeV.

关键词： HIGGS bosons RESEARCH COLLISIONS (Nuclear physics) ATLAS (computer program language) REST mass (Relativity) BOSONS

来源：评论

学校读者我要写书评

暂无评论

A Dependability Model for TMR System

引用

International Journal of Automation and computing 2012年第3期9卷 315-324页

作者： Peng, Jun-Jie Liu, Yan-Ping Chen, Yuan-Yuan School of Computer Engineering and Science Shanghai University Shanghai 200072 China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

Much research has been done on the dependability evaluation of computer systems. However, much of this is gone no further than study of the fault coverage of such systems, with little focus on the relationship between fault coverage and overall system dependability. In this paper, a Markovian dependability model for triple-modular-redundancy (TMR) system is presented. Having fully considered the effects of fault coverage, working time, and constant failure rate of single module on the dependability of the target TMR system, the model is built based on the stepwise degradation strategy. Through the model, the relationship between the fault coverage and the dependability of the system is determined. What is more, the dependability of the system can be dynamically and precisely predicted at any given time with the fault coverage set. This will be of much benefit for the dependability evaluation and improvement, and be helpful for the system design and maintenance.

关键词： Dependability Markovian model coverage triple-modular-redundancy (TMR) failure rate.

来源：评论

学校读者我要写书评

暂无评论

Way sharing set associative cache architecture

Way sharing set associative cache architecture

引用

25th International Conference on VLSI Design, VLSID 2012 and the 11th International Conference on Embedded Systems

作者： Janraj, C.J. Kalyan, T. Venkata Warrier, Tripti Mutyam, Madhu Computer Architecture and Systems Laboratory Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 India

ISBN: (纸本)9780769546384

In order to minimize the conflict miss rate, cache memories can be organized in set-associative manner. The downside of increasing the associativity is increase in the per access energy consumption. In conventional n-way set-associative caches, irrespective of the set-wise demand, each set has n cache ways at its disposal, but cache sets may exhibit nonuniform demand for these cache ways. Exploiting this property, we propose a novel cache architecture, called way sharing cache, wherein by allowing sharing of cache ways among a pair of cache sets, we obtain dynamic energy savings as high as 41% in DL1 cache with negligible performance penalty. © 2012 IEEE.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

Diagnosis and Layout Aware (DLA) scan chain stitching

Diagnosis and Layout Aware (DLA) scan chain stitching

引用

IEEE International Test Conference

作者： Jing Ye Yu Huang Yu Hu Wu-Tung Cheng Ruifeng Guo Liyang Lai Ting-Pu Tai Xiaowei Li Weipin Changchien Daw-Ming Lee Ji-Jan Chen Sandeep C. Eruvathi Kartik K. Kumara Charles Liu Sam Pan State Key Laboratory of Computer Architecture Institute of Computing Technology Beijing P. R. China Silicon Test Solutions Mentor Graphics Corp. Wilsonville OR USA Hsinchu Science Park Taiwan Semiconductor Manufacturing Company Hsinchu Taiwan

ISBN: (纸本)9781479908608

Without appropriate stitching of scan chains, even with good diagnosis algorithm and diagnostic pattern generation, it may still result in bad scan chain diagnostic resolution. To improve the diagnostic resolution, we propose a novel Diagnosis and Layout Aware (DLA) scan chain stitching method, which is pattern independent and supports embedded scan compaction. It is based on three ideas: (1) increasing the number of sensitive scan cells, which can capture useful diagnostic information; (2) properly distributing the sensitive scan cells along the scan chains to enhance the overall resolution; (3) stitching scan cells based on their placement at layout to preserve the chip performance. Experiments on ISCAS'89/ITC'99 benchmark circuits and a real industry circuit based on 20nm technology with silicon results show that, the proposed DLA scan chain stitching method effectively improves the resolution, with negligible impact on chip performance, embedded scan compaction, transition fault coverage, and test power dissipation. The silicon results even show 7X average resolution improvement comparing to without using the proposed method.

关键词： Circuit faults Layout Automatic test pattern generation Routing computer architecture Microprocessors Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Massively parallel breadth first search using a tree-structured memory model

Massively parallel breadth first search using a tree-structu...

引用

2012 International Workshop on Programming Models and Applications for Multicores and Manycores, PMAM 2012

作者： St. John, Tom Dennis, Jack B. Gao, Guang R. Computer Architecture and Parallel Systems Laboratory University of Delaware United States Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology United States

ISBN: (纸本)9781450312110

Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be used to perform breadth-first search of large undirected graphs. Overall, the computation can be expressed as a data flow process wherein a set of vertices to be searched is partitioned into a set of sub-domains and processed independently by many concurrent tasks. The main contributions of the paper are listed below. • We present the first case study demonstrating the power of the Fresh Breeze program execution model (PXM) in the exploitation of fine-grain parallelism found in irregular applications such as graph algorithms. • We present a novel parallel breadth-first search algorithm which is fully determinate. • We describe a unique sparse vector representation that represents the set of adjacencies for each vertex. • We provide an experimental study and analysis of our implementation. An estimate is also made of the performance that might be achieved with a massively parallel system built according to Fresh Breeze principles. © 2012 ACM.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Feedback-controlled security-aware and energy-efficient scheduling for real-time embedded systems

Feedback-controlled security-aware and energy-efficient sche...

引用

7th International Conference on Embedded and Multimedia Computing, EMC 2012

作者： Ma, Yue Sang, Nan Jiang, Wei Zhang, Lei School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789400750753

Security has become an important characteristic for many real-time systems. Due to the lack of enough and stable energy supply in battery-powered embedded systems, one of the foremost challenges is the mismatch between energy and performance requirements of security processing. In this paper, we propose a security-aware and energy-efficient scheduling algorithm that aims at reducing energy consumption while ensuring the real-time and security requirements. Based on the feedback control theory, we employ a feedback unit to keep track of the CPU utilization and manage the security level dynamically. Simulation results show the effectiveness and efficiency of the proposed algorithm. © 2012 Springer science+Business Media.

关键词： Feedback control

来源：评论

学校读者我要写书评

暂无评论

MAP-numa: Access patterns used to characterize the NUMA memory access optimization techniques and algorithms

MAP-numa: Access patterns used to characterize the NUMA memo...

引用

9th IFIP International Conference on Network and Parallel Computing, NPC 2012

作者： Luo, Qiuming Liu, Chenjian Kong, Chang Cai, Ye Shenzhen China College of Computer Science and Software Engineering Shenzhen University China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783642356056

Some typical memory access patterns are provided and programmed in C, which can be used as benchmark to characterize the various techniques and algorithms aim to improve the performance of NUMA memory access. These access patterns, called MAP-numa (Memory Access Patterns for NUMA), currently include three classes, whose working data sets are corresponding to 1-dimension array, 2-dimension matrix and 3-dimension cube. It is dedicated for NUMA memory access optimization other than measuring the memory bandwidth and latency. MAP-numa is an alternative to those exist benchmarks such as STREAM, pChase, etc. It is used to verify the optimizations' (made automatically/manually to source code/executive binary) capacities by investigating what locality leakage can be remedied. Some experiment results are shown, which give an example of using MAP-numa to evaluate some optimizations based on Oprofile sampling. © IFIP International Federation for Information Processing 2012.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：