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

作者： Liu, Peng Yu, Jiyang Huang, Michael C. College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi214125 China Department of Shannon Lab. Huawei Technologies Co. Ltd. Hangzhou310051 China Department of Electrical and Computer Engineering University of Rochester RochesterNY14627-0231 United States

Most processors employ hardware data prefetching techniques to hide memory access latencies. However, the prefetching requests from different threads on a multicore processor can cause severe interference with prefetching and/or demand requests of others. The data prefetching can lead to significant performance degradation due to shared resource contention on shared memory multicore systems. This article proposes a thread-aware data prefetching mechanism based on low-overhead runtime information to tune prefetching modes and aggressiveness, mitigating the resource contention in the memory system. Our solution has three new components: (1) a self-tuning prefetcher that uses runtime feedback to dynamically adjust data prefetching modes and arguments of each thread, (2) a filtering mechanism that informs the hardware about which prefetching request can cause shared data invalidation and should be discarded, and (3) a limiter thread acceleration mechanism to estimate and accelerate the critical thread which has the longest completion time in the parallel region of execution. On a set of multithreaded parallel benchmarks, our thread-aware data prefetchingmechanism improves the overall performance of 64-core system by 13% over a multimode prefetch baseline system with two-level cache organization and conventional modified, exclusive, shared, and invalid-based directory coherence *** compare our approach with the feedback directed prefetching technique and find that it provides 9% performance improvement on multicore systems, while saving the memory bandwidth consumption.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

One-to-Any Command and Control Model:Precisely Coordinated Operation on Uncooperative Controlled Nodes

引用

Wuhan University Journal of Natural Sciences 2015年第6期20卷 490-498页

作者： QIU Han LI Yufeng LI Heshuai ZHU Junhu State Key Laboratory of Mathematic Engineering and Advanced Computing National Digital Switching System Engineering and Technological Research Center

New precisely cooperative attacks, such as the coordi- nated cross plane session termination （CXPST） attack, need thou- sands upon thousands machines to attack diverse selected links simultaneously with the given rate. However, almost all command and control（C＆C） mechanisms only provide publishing one com- mand to the whole once, so-called one-to-all C＆C model, and are not productive to support CXPST-alike attacks. In this paper, we present one-to-any C＆C model on coordination among the unco- operative controlled nodes. As an instance of one-to-any C＆C model, directional command publishing （DCP） mechanism lever- aging on Kademlia is provided with a range-mapping key creating algorithm for commands to compute the publishing range and a statistically stochastic node querying scheme to obtain the com- mands immediately. With theoretical analysis and simulation, it is indicated that one-to-any C＆C model fits for precisely coordi- nated operation on uncooperative controlled nodes with least complexity, better accuracy and efficiency. Furthermore, DCP mechanism can support one-to-all command publishing at the same time. As an example of future C＆C model, studying on one-to-any C＆C model may help to promote the development of more efficient countermeasures.

关键词： one-to-any command and control（C＆C） model directional command publishing（DCP） mechanism precisely cooperative attack uncooperative controlled node

来源：评论

学校读者我要写书评

暂无评论

PACM: A Prediction-Based Auto-Adaptive Compression Model for HDFS

PACM: A Prediction-Based Auto-Adaptive Compression Model for...

引用

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

作者： Ruijian Wang Chao Wang Li Zha University of the Chinese Academy of Sciences Beijing China Institute of Computing Technology Chinese Academy of Sciences Beijing China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

ISBN: (纸本)9781509036837

Nowadays the digital universe becomes larger and larger. The data created every year has been up to ZB level. How to store the data in many normal servers is a critical issue. Although a distributed file system alleviates the storage problem, there is still a need to reduce the storage and speed up transmission of largescale data. The distributed file system like HDFS already offers compression schemes to cater to the need, however, when the workload and data format change, configuring the compression with only one kind of algorithm is not always effective. In this paper, we proposed a model called PACM (Prediction-based Auto-adaptive Compression Model) to optimize the storage and performance by using different algorithms, e.g. quicklz, zlib, snappy according to variable data format and workload. We also implemented the model inHadoop and our empirical evaluation shows that by using PACM, the write throughput has been improved by 2-5 times.

关键词： Adaptation models Compression algorithms Data models Prediction algorithms Load modeling Predictive models Throughput

来源：评论

学校读者我要写书评

暂无评论

Register one-to-one mapping strategy in dynamic binary translation

引用

International Conference on Network Security and Communication engineering, NSCE 2014

作者： Cui, Y.N. Pang, J.M. Shan, Z. Yue, F. State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781138028210

Dynamic Binary Translation (DBT) is an important technology to cross-platform software transplantation such as enhancing the compatibility of Alpha. However, there exist some factors that impede its performance: high translation overhead and translated code of low quality. In this work, we take advantage of host registers, using register mapping strategy to promote the performance of DBT. By mapping registers from guest Instruction-Set Architectures (ISA) to host machines, it could off-load the overhead caused by load and store operations of memory. By simplifying the rules of the intermediate code generated, it could lower the number of intermediate code and improve the quality of translated code. Form X86 to ALPHA on SPEC 2006, the code expansion reduces 32.86% and the performance of the optimized translator is improved by 7.55%. © 2015 Taylor & Francis Group, London.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Constraints on dark photon dark matter using data from LIGO’s and Virgo’s third observing run

引用

Physical Review D 2022年第6期105卷 063030-063030页

作者： R. Abbott T. D. Abbott F. Acernese K. Ackley C. Adams N. Adhikari R. X. Adhikari V. B. Adya C. Affeldt D. Agarwal M. Agathos K. Agatsuma N. Aggarwal O. D. Aguiar L. Aiello A. Ain P. Ajith T. Akutsu S. Albanesi A. Allocca P. A. Altin A. Amato C. Anand S. Anand A. Ananyeva S. B. Anderson W. G. Anderson M. Ando T. Andrade N. Andres T. Andrić S. V. Angelova S. Ansoldi J. M. Antelis S. Antier S. Appert Koji Arai Koya Arai Y. Arai S. Araki A. Araya M. C. Araya J. S. Areeda M. Arène N. Aritomi N. Arnaud S. M. Aronson K. G. Arun H. Asada Y. Asali G. Ashton Y. Aso M. Assiduo S. M. Aston P. Astone F. Aubin C. Austin S. Babak F. Badaracco M. K. M. Bader C. Badger S. Bae Y. Bae A. M. Baer S. Bagnasco Y. Bai L. Baiotti J. Baird R. Bajpai M. Ball G. Ballardin S. W. Ballmer A. Balsamo G. Baltus S. Banagiri D. Bankar J. C. Barayoga C. Barbieri B. C. Barish D. Barker P. Barneo F. Barone B. Barr L. Barsotti M. Barsuglia D. Barta J. Bartlett M. A. Barton I. Bartos R. Bassiri A. Basti M. Bawaj J. C. Bayley A. C. Baylor M. Bazzan B. Bécsy V. M. Bedakihale M. Bejger I. Belahcene V. Benedetto D. Beniwal T. F. Bennett J. D. Bentley M. BenYaala F. Bergamin B. K. Berger S. Bernuzzi D. Bersanetti A. Bertolini J. Betzwieser D. Beveridge R. Bhandare U. Bhardwaj D. Bhattacharjee S. Bhaumik I. A. Bilenko G. Billingsley S. Bini R. Birney O. Birnholtz S. Biscans M. Bischi S. Biscoveanu A. Bisht B. Biswas M. Bitossi M.-A. Bizouard J. K. Blackburn C. D. Blair D. G. Blair R. M. Blair F. Bobba N. Bode M. Boer G. Bogaert M. Boldrini L. D. Bonavena F. Bondu E. Bonilla R. Bonnand P. Booker B. A. Boom R. Bork V. Boschi N. Bose S. Bose V. Bossilkov V. Boudart Y. Bouffanais A. Bozzi C. Bradaschia P. R. Brady A. Bramley A. Branch M. Branchesi J. E. Brau M. Breschi T. Briant J. H. Briggs A. Brillet M. Brinkmann P. Brockill A. F. Brooks J. Brooks D. D. Brown S. Brunett G. Bruno R. Bruntz J. Bryant T. Bulik H. J. Bulten A. Buonanno R. Buscicchio D. Buskulic C. Buy R. L. Byer L. Cadonati G. Cagnoli C. Cahillane J. Calderón Bustillo J. D. Callaghan T. A. Callis LIGO Laboratory California Institute of Technology Pasadena California 91125 USA Louisiana State University Baton Rouge Louisiana 70803 USA Dipartimento di Farmacia Università di Salerno I-84084 Fisciano Salerno Italy INFN Sezione di Napoli Complesso Universitario di Monte S. Angelo I-80126 Napoli Italy OzGrav School of Physics and Astronomy Monash University Clayton 3800 Victoria Australia LIGO Livingston Observatory Livingston Louisiana 70754 USA University of Wisconsin-Milwaukee Milwaukee Wisconsin 53201 USA OzGrav Australian National University Canberra Australian Capital Territory 0200 Australia Max Planck Institute for Gravitational Physics (Albert Einstein Institute) D-30167 Hannover Germany Leibniz Universität Hannover D-30167 Hannover Germany Inter-University Centre for Astronomy and Astrophysics Pune 411007 India University of Cambridge Cambridge CB2 1TN United Kingdom Theoretisch-Physikalisches Institut Friedrich-Schiller-Universität Jena D-07743 Jena Germany University of Birmingham Birmingham B15 2TT United Kingdom Center for Interdisciplinary Exploration and Research in Astrophysics (CIERA) Northwestern University Evanston Illinois 60208 USA Instituto Nacional de Pesquisas Espaciais 12227-010 São José dos Campos São Paulo Brazil Gravity Exploration Institute Cardiff University Cardiff CF24 3AA United Kingdom INFN Sezione di Pisa I-56127 Pisa Italy International Centre for Theoretical Sciences Tata Institute of Fundamental Research Bengaluru 560089 India Gravitational Wave Science Project National Astronomical Observatory of Japan (NAOJ) Mitaka City Tokyo 181-8588 Japan Advanced Technology Center National Astronomical Observatory of Japan (NAOJ) Mitaka City Tokyo 181-8588 Japan INFN Sezione di Torino I-10125 Torino Italy Università di Napoli “Federico II” Complesso Universitario di Monte S. Angelo I-80126 Napoli Italy Université de Lyon Université Claude Bernard Lyon 1 CNRS Institut Lumière Matière F-69622 Villeurbanne Franc

We present a search for dark photon dark matter that could couple to gravitational-wave interferometers using data from advanced LIGO and Virgo’s third observing run. To perform this analysis, we use two methods, one based on cross-correlation of the strain channels in the two nearly aligned LIGO detectors, and one that looks for excess power in the strain channels of the LIGO and Virgo detectors. The excess power method optimizes the Fourier transform coherence time as a function of frequency, to account for the expected signal width due to Doppler modulations. We do not find any evidence of dark photon dark matter with a mass between mA∼10−14–10−11 eV/c2, which corresponds to frequencies between 10–2000 Hz, and therefore provide upper limits on the square of the minimum coupling of dark photons to baryons, i.e., U(1)B dark matter. For the cross-correlation method, the best median constraint on the squared coupling is ∼1.31×10−47 at mA∼4.2×10−13 eV/c2; for the other analysis, the best constraint is ∼2.4×10−47 at mA∼5.7×10−13 eV/c2. These limits improve upon those obtained in direct dark matter detection experiments by a factor of ∼100 for mA∼[2–4]×10−13 eV/c2, and are, in absolute terms, the most stringent constraint so far in a large mass range mA∼2×10−13–8×10−12 eV/c2.

关键词： Dark matter Gravitational wave detectors

来源：评论

学校读者我要写书评

暂无评论

Automatic binary de-obfuscation based compiler optimization 6th

引用

6th International Conference on Swarm Intelligence, ICSI 2015 held in conjunction with the 2nd BRICS Congress on Computational Intelligence, CCI 2015

作者： Lin, Wei Fei, Jin-Long Cai, Rui-Jie State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450002 China

ISBN: (纸本)9783319204710

Junk code increase manual analysis difficulty in reverse engineering, and seriously disturb the automatic analysis process of ant code obfuscating, so find a junk code removing method has a great significance in the field of reverse engineering. Based on this, aiming at the problem that the executable context-dependent junk code is difficult to remove automatically, this paper proposes a junk code removing method based on idle register slicing, through analyzing data dependencies between instructions, get all the idle register of all instruction in code block, slice the code block by idle registers respectively, remove all the junk code in the slice instruction. Experiments show that, this method can remove embedded executable junk code rapidly and accurately, improve the efficiency of reverse engineering. © Springer International Publishing Switzerland 2015.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

Virtual channel based aggregated multi-source multicast across backbone

Virtual channel based aggregated multi-source multicast acro...

引用

International Conference on Control engineering and Information System, ICCEIS 2014

作者： Chen, Y. Li, C.L. Huang, K.X. Zhang, X.B. State Key Laboratory of Mathematical Engineering and Advanced Computing ZhengzhouHenan China

ISBN: (纸本)9781138026858

To achieve the tradeoff between state aggregation and traffic redundancy, different branches of the tree are formed in backbone and receivers’ access networks. In receivers’ access network, each branch corresponds to a multicast group;while in the backbone and on the paths of senders to backbone, each branch corresponds to a multicast traffic class, which achieves multicast states aggregation. Simulation results show that VC-AMSM will result in some traffic redundancy, but it can greatly reduce the number of multicast states and control messages in the network. And the one-tree-one-traffic-class characteristic provides a preferable basis to reconfigure the routing to label switching. © 2015 Taylor & Francis Group, London.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Water Splitting: Optical and Electrical Enhancement of Hydrogen Evolution by MoS2@MoO3Core–Shell Nanowires with Designed Tunable Plasmon Resonance (Adv. Funct. Mater. 32/2018)

引用

advanced Functional Materials 2018年第32期28卷

作者： Shaohui Guo Xuanhua Li Xingang Ren Lin Yang Jinmeng Zhu Bingqing Wei State Key Laboratory of Solidification Processing Center for Nano Energy Materials School of Materials Science and Engineering Northwestern Polytechnical University and Shaanxi Joint Lab of Graphene (NPU) Xi'an 710072 China Northwestern Polytechnical University‐Queen Mary University of London (NPU‐QMUL) Joint Research Institute of Advanced Materials and Structures (JRI‐AMAS) Xi'an 710072 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University No. 3 Feixi Road Hefei Anhui Province 230039 P. R. China Department of Mechanical Engineering University of Delaware Newark DE 19716 USA

来源：评论

学校读者我要写书评

暂无评论

keyword search over encrypted data in cloud computing from lattices in the standard model 2nd

Keyword search over encrypted data in cloud computing from l...

引用

2nd International Conference on Cloud computing and Big Data, CloudCom-Asia 2015

作者： Gu, Chunxiang Zheng, Yonghui Kang, Fei Xin, Dan State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001 China

ISBN: (纸本)9783319284293

As cloud computing becomes popular, more and more sensitive information are being centralized into the cloud. Hence, we need some mechanism to support operations on encrypted data in many applications in cloud. Public key encryption with keyword search (PEKS) is a mechanism for searching on encrypted data. It enables user Alice to send a secret value TW to a cloud server that will enable the server to selectively retrieve encrypted messages containing the keyword, but learn nothing else. In this paper, we propose a PEKS scheme using lattices. Lattice-based cryptosystems are becoming an increasingly popular in the research community. Our scheme can be proven secure in the standard model with the hardness of the standard Learning With Errors problem. © Springer International Publishing Switzerland 2015.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Scalable QoS multicast provisioning in wide-sense circuit tree

Scalable QoS multicast provisioning in wide-sense circuit tr...

引用

International Conference on Control engineering and Information System, ICCEIS 2014

作者： Huang, K.X. Chen, Y. Li, C.L. Zhang, X.B. State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan China

ISBN: (纸本)9781138026858

It is still a hot topic that how to provide dynamic reconfigurable QoS multicast service in the network. The MPLS network combined with the DiffServ can provide end-to-end QoS guarantee for differentiated services, and aggregated multicast can reduce the cost of maintaining multicast state. In this paper, based on the technology of the Wide-sense circuit Tree technique, we propose an architecture to provide the dynamic QoS multicast service, in the reconfigurable network environment. With the idea of aggregated multicast to reduce multicast state, and using the Wide-sense circuit technology to guarantee the quality of the transport service. © 2015 Taylor & Francis Group, London.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：