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

作者： Song, Hui Zhang, Wenli Liu, Ke Shen, Yifan Chen, Mingyu State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Frontier Research Center Peng Cheng Laboratory Shenzhen China

This article aims to enhance the monitoring accuracy of high concurrent network services. As modern network services grow rapidly in data centers, tail latency has become one of the most crucial deciding factors on user experience. Latency measurement and anomaly detection are essential in evaluating service performance. Existing monitoring tools can be divided into two categories according to estimation methods. First, approaches based on sample traffic sample network packets to unburden the measurement. Second, approaches based on full traffic like wrk, analyze all of the packets from the kernel network stack and load the client-side overhead into response delay. Therefore, we propose a high-performance monitor system named HCMonitor, which computes the server-side response latency and the round-trip time of per-request. It can afford full traffic monitoring on the basis of userspace, "zero copy" and pipeline. By switch mirroring, the measured latency eliminates the kernel network stack overhead and the queuing delay of the client-side. Such measurement results in improved accuracy, online analysis, anomaly detection, real-time display and transparent to network services. Our evaluations show HCMonitor obtains a higher throughput compared with tcpdump by over 200 times. Compared with wrk, the tail latency accuracy shows an increase by up to 72%–76% in high concurrent networks. © 2021 John Wiley & Sons Ltd.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

A Power and Area Optimization Approach of Mixed Polarity Reed-Muller Expression for Incompletely Specified Boolean Functions

引用

Journal of computer science & Technology 2017年第2期32卷 297-311页

作者： Zhen-Xue He Li-Min Xiao Li Ruan Fei Gu Zhi-Sheng Huo Guang-Jun Qin Ming-Fa Zhu F Long-Bing Zhang Rui Liu Xiang Wang State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China School of Electronic and Information Engineering Beihang University Beijing 100191 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China National Engineering Research Center for Science and Technology Resources Sharing Service Beihang University Beijing 100191 China

The power and area optimization of Reed-Muller （RM） circuits has been widely concerned. However, almost none of the exiting power and area optimization approaches can obtain all the Pareto optimal solutions of the original problem and are efficient enough. Moreover, they have not considered the don＇t care terms, which makes the circuit performance unable to be further optimized. In this paper, we propose a power and area optimization approach of mixed polarity RM expression （MPRM） for incompletely specified Boolean functions based on Non-Dominated Sorting Genetic Algorithm II （NSGA-II）. Firstly, the incompletely specified Boolean function is transformed into zero polarity incompletely specified MPRM （ISMPRM） by using a novel ISMPRM acquisition algorithm. Secondly, the polarity and allocation of don＇t care terms of ISMPRM is encoded as chromosome. Lastly, the Pareto optimal solutions are obtained by using NSGA-II, in which MPRM corresponding to the given chromosome is obtained by using a chromosome conversion algorithm. The results on incompletely specified Boolean functions and MCNC benchmark circuits show that a significant power and area improvement can be made compared with the existing power and area optimization approaches of RM circuits.

关键词： power and area optimization Reed-Muller （RM） circuit Pareto optimal solution don＇t care term chromosomeconversion

来源：评论

学校读者我要写书评

暂无评论

Read Extensively, Focus Smartly: A Cross-document Semantic Enhancement Method for Visual Documents NER 29

Read Extensively, Focus Smartly: A Cross-document Semantic E...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Zhao, Jun Zhao, Xin Zhan, Wenyu Gui, Tao Zhang, Qi Qiao, Liang Cheng, Zhanzhan Pu, Shiliang School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai China Institute of Modern Languages and Linguistics Fudan University China Hikvision Research Institute Shanghai China

The introduction of multimodal information and pretraining technique significantly improves entity recognition from visually-rich documents. However, most of the existing methods pay unnecessary attention to irrelevant regions of the current document while ignoring the potentially valuable information in related documents. To deal with this problem, this work proposes a cross-document semantic enhancement method, which consists of two modules: 1) To prevent distractions from irrelevant regions in the current document, we design a learnable attention mask mechanism, which is used to adaptively filter redundant information in the current document. 2) To further enrich the entity-related context, we propose a cross-document information awareness technique, which enables the model to collect more evidence across documents to assist in prediction. The experimental results on two documents understanding benchmarks covering eight languages demonstrate that our method outperforms the SOTA methods. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Fusion Coherence: Scalable Cache Coherence for Heterogeneous Kilo-Core System

Fusion Coherence: Scalable Cache Coherence for Heterogeneous...

引用

10th Annual Conference of Advanced computer architecture, ACA 2014

作者： Pei, Songwen Kim, Myoung-Seo Gaudiot, Jean-Luc Xiong, Naixue Department of Computer Science and Engineering University of Shanghai for Science and Technology Shanghai 200093 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Department of Electrical Engineering and Computer Science University of California Irvine CA 92697 United States School of Computer Science Colorado Technical University Springs CO 80907 United States

ISBN: (纸本)9783662444900

Future heterogeneous systems will integrate CPUs and GPUs on a single chip to achieve high computing performance as well as high throughput. In general, it would discard the current discrete pattern and will build a uniformed shared memory system avoiding explicit data movement among CPUs and GPUs connected by high throughput NoC. We propose a scalable cache coherence solution Fusion Coherence for Heterogeneous Kilo-core System architecture by integrating CPUs and GPUs on a single chip to mitigate the coherence bandwidth side effects of GPU memory requests as well as overhead of copying data among memories of CPUs and GPUs. The Fusion Coherence coalesces L3 data cache of CPUs and GPUs based on a uniformed physical memory, further integrates a region directory and cuckoo directory into two levels of cache coherence directory without modifying cache coherence protocol. According to the experimental results with a subset of Rodina benchmarks, it is effective to decrease the overhead of data transfer and get an average execution speedup by 2.4x. The highest speedup is approximate to 4x for data-intensive applications. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Flooding-X: Improving BERT's Resistance to Adversarial Attacks via Loss-Restricted Fine-Tuning 60

Flooding-X: Improving BERT's Resistance to Adversarial Attac...

引用

60th Annual Meeting of the Association for Computational Linguistics, ACL 2022

作者： Liu, Qin Zheng, Rui Bao, Rong Liu, Jingyi Liu, ZhiHua Cheng, Zhanzhan Qiao, Liang Gui, Tao Zhang, Qi Huang, Xuanjing School of Computer Science Fudan University China Institute of Modern Languages and Linguistics Fudan University China Shanghai Key Laboratory of Intelligent Information Processing China Hikvision Research Institute Hangzhou China

ISBN: (纸本)9781955917216

Adversarial robustness has attracted much attention recently, and the mainstream solution is adversarial training. However, the tradition of generating adversarial perturbations for each input embedding (in the settings of NLP) scales up the training computational complexity by the number of gradient steps it takes to obtain the adversarial samples. To address this problem, we leverage Flooding method which primarily aims at better generalization and we find promising in defending adversarial attacks. We further propose an effective criterion to bring hyper-parameter-dependent flooding into effect with a narrowed-down search space by measuring how the gradient steps taken within one epoch affect the loss of each batch. Our approach requires zero adversarial sample for training, and its time consumption is equivalent to fine-tuning, which can be 2-15 times faster than standard adversarial training. We experimentally show that our method improves BERT's resistance to textual adversarial attacks by a large margin, and achieves state-of-the-art robust accuracy on various text classification and GLUE tasks. © 2022 Association for Computational Linguistics.

关键词： Floods

来源：评论

学校读者我要写书评

暂无评论

Xdn: towards efficient inference of residual neural networks on cambricon chips 2nd

Xdn: towards efficient inference of residual neural networks...

引用

2nd International Symposium on Benchmarking, Measuring, and Optimization, Bench 2019

作者： Li, Guangli Wang, Xueying Ma, Xiu Liu, Lei Feng, Xiaobing State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China College of Computer Science and Technology Jilin University Changchun China MOE Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun China

ISBN: (纸本)9783030495558

In this paper, we present XDN, an optimization and inference engine for accelerating residual neural networks on Cambricon chips. We leverage a channel pruning method to compress the weights of ResNet-50. By exploring the optimization opportunities in computational graphs, we propose a layer fusion strategy, which dramatically decreases the number of scalar computation layers, such as Batch Normalization, Scale. Furthermore, we design an efficient implementation of XDN, including data preprocessing, hyper-parameter auto-tuning, etc. The experimental results show that the ResNet-50 model can achieve significant speedup without accuracy loss by using our XDN engine. © Springer Nature Switzerland AG 2020.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

An ultra-fast hybrid simulation framework for ASIP

An ultra-fast hybrid simulation framework for ASIP

引用

2011 18th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2011

作者： Qiu, Ji Gao, Xiang Jiang, Yifei Xiao, Xu Key Laboratory of Computer System and Architecture Institute of Computing Technology Graduate University of Chinese Academy of Science Beijing 100190 China Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign Urbana IL United States

ISBN: (纸本)9781457718458

ISS (Instruction Set Simulator) plays an important role in pre-silicon software development for ASIP. However, the speed of traditional simulation is too slow to effectively support full-scale software development. In this paper, we propose a hybrid simulation framework which further improves the previous simulation methods by aggressively utilizing the host machine resources. The utilization is achieved by categorizing instructions of ASIP application into two types, namely custom and basic instructions, via binary instrumentation. Then in a way of hybrid simulation, only custom instructions are simulated on the ISS and basic instructions are executed fast and natively on the host machine. We implement this framework for an industrial ASIP to validate our approach. Experimental results show that when the implemented ISS, namely GS-Sim, is applied to practical multimedia decoders, an average simulation speed up to 1058.5MIPS can be achieved, which is 34.7 times of the state-of-art dynamic binary translation simulator and is the fastest to the best of our knowledge. © 2011 IEEE.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Concurrency bug localization using shared memory access pairs 14

Concurrency bug localization using shared memory access pair...

引用

2014 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014

作者： Wang, Wenwen Wu, Chenggang Yew, Pen-Chung Yuan, Xiang Wang, Zhenjiang Li, Jianjun Feng, Xiaobing State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences Beijing China Department of Computer Science and Engineering University of Minnesota at Twin-Cities United States

ISBN: (纸本)9781450326568

Non-determinism in concurrent programs makes their debugging much more challenging than that in sequential programs. To mitigate such difficulties, we propose a new technique to automatically locate buggy shared memory accesses that triggered concurrency bugs. Compared to existing fault localization techniques that are based on empirical statistical approaches, this technique has two advantages. First, as long as enough successful runs of a concurrent program are collected, the proposed technique can locate buggy memory accesses to the shared data even with only one single failed run captured, as opposed to the need of capturing multiple failed runs in other statistical approaches. Second, the proposed technique is more precise because it considers memory accesses in those failed runs that terminate prematurely.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Concurrency bug localization using shared memory access pairs

Concurrency bug localization using shared memory access pair...

引用

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Optimizing web browser on many-core architectures

Optimizing web browser on many-core architectures

引用

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2011

作者： Fan, Lingjun Shi, Weisong Tang, Shibin Yan, Chenggang Fan, Dongrui Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China Academy of Sciences Graduate University Beijing China Department of Computer Science Wayne State University Detroit United States

ISBN: (纸本)9780769545646

As more and more Web applications emerging on sever end today, the Web browser on client end has become a host of a variety of applications other than just rendering static Web pages. This leads to more and more performance requirements of a Web browser, for which user experience is very important. This situation may become more urgency when on handheld devices. Some efforts like redesign a new Web browser have been made to overcome this problem. In this paper, we address this issue by optimizing the main processes of the Web browser on a state-of-the-art 64-core architecture, Godson-T, which was developed at Chinese Academy of sciences, as multi-/many-core architecture to be the mainstream processor in the upcoming years. We start a new core to process a new tab when facing up to intensive URL requests, and we use scratch-pad memory (SPM) of each core as a local buffer to store the HTML source data to be processed to reduce off-chip memory access and exploit more data locality, otherwise, we use DTA to transfer HTML data for backup. Experiments conducted on the cycle-accurate simulator show that, starting each tab process by a new core could obtain 5.7% to 50% speedup with different number of cores used to process corresponding URL requests, with onchip scratchpad memory of each core used to store the HTML data, more speedup could be achieved when number of cores increase. Also, as Data Transfer Agent (DTA) used to transfer the HTML data, the backup of HTML data can get 2X to 5X speedups according to different data amount. © 2011 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：