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

Accelerating Data Transfer in Dataflow architectures Through a Look-Ahead Acknowledgment Mechanism

Journal of computer Science & Technology 2022年第4期37卷 942-959页

作者： Yu-Jing Feng De-Jian Li Xu Tan Xiao-Chun Ye Dong-Rui Fan Wen-Ming Li Da Wang Hao Zhang Zhi-Min Tang State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China Beijing Smartchip Microelectronics Technology Company Limited Beijing 100000China School of Computer and Control Engineering University of Chinese Academy of SciencesBeijing 100190China

The dataflow architecture,which is characterized by a lack of a redundant unified control logic,has been shown to have an advantage over the control-flow architecture as it improves the computational performance and power efficiency,especially of applications used in high-performance computing(HPC).Importantly,the high computational efficiency of systems using the dataflow architecture is achieved by allowing program kernels to be activated in a simultaneous ***,a proper acknowledgment mechanism is required to distinguish the data that logically belongs to different *** solutions include the tagged-token matching mechanism in which the data is sent before acknowledgments are received but retried after rejection,or a handshake mechanism in which the data is only sent after acknowledgments are ***,these mechanisms are characterized by both inefficient data transfer and increased area *** performance of the dataflow architecture depends on the efficiency of data *** order to optimize the efficiency of data transfer in existing dataflow architectures with a minimal increase in area and power cost,we propose a Look-Ahead Acknowledgment(LAA)*** accelerates the execution flow by speculatively acknowledging ahead without *** simulation analysis based on a handshake mechanism shows that our LAA increases the average utilization of computational units by 23.9%,with a reduction in the average execution time by 17.4%and an increase in the average power efficiency of dataflow processors by 22.4%.Crucially,our novel approach results in a relatively small increase in the area and power consumption of the on-chip logic of less than 0.9%.In conclusion,the evaluation results suggest that Look-Ahead Acknowledgment is an effective improvement for data transfer in existing dataflow architectures.

关键词： dataflow model control-flow model high-performance computing application data transfer power efficiency

来源：评论

学校读者我要写书评

暂无评论

Theoretical Treatment of Target Coverage in Wireless Sensor Networks

引用

Journal of computer Science & Technology 2011年第1期26卷 117-129页

作者：谷雨赵保华计宇生李颉 School of Computer Science University of Science and Technology of China State Key Laboratory of Networking and Switching Technology Information Systems Architecture Science Research Division National Institute of InformaticsTokyoJapan Department of Computer Science University of TsukubaTsukuba Science CityIbarakiJapan

The target coverage is an important yet challenging problem in wireless sensor networks, especially when both coverage and energy constraints should be taken into account. Due to its nonlinear nature, previous studies of this problem have mainly focused on heuristic algorithms; the theoretical bound remains unknown. Moreover, the most popular method used in the previous literature, i.e., discretization of continuous time, has yet to be justified. This paper fills in these gaps with two theoretical results. The first one is a formal justification for the method. We use a simple example to illustrate the procedure of transforming a solution in time domain into a corresponding solution in the pattern domain with the same network lifetime and obtain two key observations. After that, we formally prove these two observations and use them as the basis to justify the method. The second result is an algorithm that can guarantee the network lifetime to be at least （1 - ε） of the optimal network lifetime, where ε can be made arbitrarily small depending on the required precision. The algorithm is based on the column generation （CG） theory, which decomposes the original problem into two sub-problems and iteratively solves them in a way that approaches the optimal solution. Moreover, we developed several constructive approaches to further optimize the algorithm. Numerical results verify the efficiency of our CG-based algorithm.

关键词： target coverage wireless sensor networks time-dependent solution pattern-based solution column generation

来源：评论

学校读者我要写书评

暂无评论

Towards silicon photonic neural networks for artificial intelligence

引用

Science China(Information Sciences) 2020年第6期63卷 105-118页

作者： Bowen BAI Haowen SHU Xingjun WANG Weiwen ZOU State Key Laboratory of Advanced Optical Communications System and Networks School of Electronics Engineering and Computer Science Peking University Frontiers Science Center for Nano-optoelectronics Peking University State Key Laboratory of Advanced Optical Communication Systems and Networks Intelligent Microwave Lightwave Integration Innovation Center(iMLic) Department of Electronic Engineering Shanghai Jiao Tong University

Brain-inspired photonic neural networks for artificial intelligence have attracted renewed interest. For many computational tasks, such as image recognition, speech processing and deep learning, photonic neural networks have the potential to increase the computing speed and energy efficiency on the orders of magnitude compared with digital electronics. Silicon Photonics, which combines the advantages of electronics and photonics, brings hope for the large-scale photonic neural network integration. This paper walks through the basic concept of artificial neural networks and focuses on the key devices which construct the silicon photonic neuromorphic systems. We review some recent important progress in silicon photonic neural networks, which include multilayer artificial neural networks and brain-like neuromorphic systems, for artificial intelligence. A prototype of silicon photonic artificial intelligence processor for ultra-fast neural network computing is also proposed. We hope this paper gives a detailed overview and a deeper understanding of this emerging field.

关键词： photonic neural networks artificial intelligence deep learning photonic computing accelerator silicon photonics

来源：评论

学校读者我要写书评

暂无评论

Bug localization based on syntactical and semantic information of source code

引用

Journal of systems Engineering and Electronics 2023年第1期34卷 236-246页

作者： YAN Xuefeng CHENG Shasha GUO Liqin College of Computer Science Technology Nanjing University of Aeronautics and AstronauticsNanjing 211106China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing 211106China State Key Laboratory of Intelligent Manufacturing System Technology Beijing Institute of Electronic System EngineeringBeijing 100854China

The existing software bug localization models treat the source file as natural language, which leads to the loss of syntactical and structure information of the source file. A bug localization model based on syntactical and semantic information of source code is proposed. Firstly, abstract syntax tree(AST) is divided based on node category to obtain statement sequence. The statement tree is encoded into vectors to capture lexical and syntactical knowledge at the statement ***, the source code is transformed into vector representation by the sequence naturalness of the statement. Therefore,the problem of gradient vanishing and explosion caused by a large AST size is obviated when using AST to the represent source code. Finally, the correlation between bug reports and source files are comprehensively analyzed from three aspects of syntax, semantics and text to locate the buggy code. Experiments show that compared with other standard models, the proposed model improves the performance of bug localization, and it has good advantages in mean reciprocal rank(MRR), mean average precision(MAP) and Top N Rank.

关键词： bug report abstract syntax tree code representation software bug localization

来源：评论

学校读者我要写书评

暂无评论

Statistical Interconnect Crosstalk Noise Model and Analysis for Process Variations

引用

Chinese Journal of Electronics 2015年第1期24卷 83-87页

作者： LI Jianwei DONG Gang WANG Zeng YE Xiaochun Faculty of Automation and Information Engineering Xi'an University of Technology State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences Microelectronics Institute Xidian University College of Physics Sicence Qingdao University

When operating frequency is over several gigahertz, the effect of inductance plays an important role and should be included for accurate and speed crosstalk noise analysis. And for new generation IC(Integrated circuit) design tools, the crosstalk noise analysis tools should consider the influence of process variations. In this paper, we propose coupled RLC crosstalk noise distributed parameter model with capacitive load termination. And we develop the framework that how to use the crosstalk noise model for process variations. Our results show that compare with HSPICE, the critical data errors of proposed model are within 1% and the relative errors occurred between calculated values for process variations and HSPICE Monte Carlo simulation values are less than 5%. The key features of the new model include:(1) The impact of inductance on crosstalk noise is considered;(2) The model can be used for process variations analysis;(3) The model reflect the effects of load capacitance directly;(4) The numerical inversion of Laplace transform is introduced for improving speed. So the proposed model meets the needs of future IC design both in speed and accuracy.

关键词： Crosstalk noise Interconnect Inductance Process variation Statistical

来源：评论

学校读者我要写书评

暂无评论

CHMasters: A scalable and speed-efficient metadata service in distributed file system

CHMasters: A scalable and speed-efficient metadata service i...

引用

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

作者： Xu, Min Zhou, Junrui Zhou, Wei An, Hong Department of Computer Science and Technology University of Science and Technology Hefei 230026 China Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)9780769545646

Distributed file system (DFS) is playing important roles of supporting large distributed data-intensive applications to meet storage needs. Typically, the design of DFS, such as GFS in Google, DMS in Cisco and TFS in Alibaba, is driven by observations of specific application workloads, internal demands and technological environment. In such systems, the metadata service is a critical factor that can affect the file system performance and availability to a great degree. Five requirements have been summarized for the metadata service: location transparent file service, smart director, efficient speed, strong scalability and friendly collaborator. In this paper, we present metadata service module called CHMasters in our DFS. Consistent hashing protocol is used to relieve potential hot spots on name servers. Files'metadata and master nodes are mapped into the same hash space by consistent hash function. And then files'metadata are scattered to master nodes by clockwise "closest" principle. Chunkserver acts as a client when report its chunks info. Only a small proportion of files'metadata will be rehashed when master nodes state change. A new scalable file mapping strategy is also proposed to map file sizes from few MB to several GB efficiently. After intensive experiments, it shows CHMasters is satisfying the above five requirements. © 2011 IEEE.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Extended selective encoding of scan slices for reducing test data and test power

Extended selective encoding of scan slices for reducing test...

引用

作者： Liu, Jun Han, Yinhe Li, Xiaowei Key Laboratory of Computer System and Architecture Institute of Computing Technology Graduate University of Chinese Academy of Sciences China School of Computer and Information Hefei University of Technology China

Test data volume and test power are two major concerns when testing modern large circuits. Recently, selective encoding of scan slices is proposed to compress test data. This encoding technique, unlike many other compression techniques encoding all the bits, only encodes the target-symbol by specifying a single bit index and copying group data. In this paper, we propose an extended selective encoding which presents two new techniques to optimize this method: a flexible grouping strategy, X bits exploitation and filling strategy. Flexible grouping strategy can decrease the number of groups which need to be encoded and improve test data compression ratio. X bits exploitation and filling strategy can exploit a large number of don't care bits to reduce testing power with no compression ratio loss. Experimental results show that the proposed technique needs less test data storage volume and reduces average weighted switching activity by 25.6% and peak weighted switching activity by 9.68% during scan shift compared to selective encoding. Copyright © 2010 The Institute of Electronics, Information and Communication Engineers.

关键词： Filling

来源：评论

学校读者我要写书评

暂无评论

High repetition rate passively mode-locked erbium-doped fiber laser

引用

Chinese Science Bulletin 2008年第5期53卷 706-708页

作者： LI Jing DAI YongHeng ZHANG ZhiGang Institute of Quantum Electronics State Key Laboratory of Advanced Optical Communication System and Networks School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

We report a passively mode-locked high repetition rate erbium-doped femtosecond fiber laser via nonlinear polarization rotation, with a fundamental repetition rate of 101.94 MHz. The output power is 34 mW when pumped by a single mode fiber coupled laser diode at 370 mW. The spectral width is 25 nm, corresponding to a transform limited pulse width of 105 fs.

关键词：铒掺杂光纤激光器循环率光学频率被动锁模光纤

来源：评论

学校读者我要写书评

暂无评论

Distribution discovery: Local analysis of temporal rules 6th

Distribution discovery: Local analysis of temporal rules

引用

6th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2002

作者： Jin, Xiaoming Lu, Yuchang Shi, Chunyi The State Key Laboratory of Intelligent Technology and System Computer Science and Technology Dept Tsinghua University Beijing China

ISBN: (纸本)9783540437048

In recent years, there has been increased interest in using data mining techniques to extract temporal rules from temporal sequences. Local temporal rules, which only a subsequence exhibits, are actually very common in practice. Efficient discovery of the time duration in which temporal rules are valid could benefit KDD of many real applications. In this paper, we present a novel problem class that is the discovery of the distribution of temporal rules. We simplify the mining problem and depict a model that could represent this knowledge clearly, uniquely and efficiently. Our methods include four online dividing strategies for different mining interest, an incremental algorithm for measuring rule-sets, and an algorithm for mining this knowledge. We have analyzed the behavior of the problem and our algorithms with both synthetic data and real data. The results correspond with the definition of our problem and reveal a kind of novel knowledge. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Enhanced recognition using iterative learning fusion in remote sensing images

Enhanced recognition using iterative learning fusion in remo...

引用

2012 IAPR Workshop on Pattern Recognition in Remote Sensing, PRRS 2012

作者： Yang, Qianwen Sun, Fuchun Liu, Huaping Department of Computer Science State Key Laboratory of Intelligent Technology and System Tsinghua University Beijing 100084 China

ISBN: (纸本)9781467349628

This article focuses on remote sensing image fusion in order to improve target recognition performance. Current fusion algorithms are mostly designed for specific purpose and have exponential complexity. We propose a fast and robust image fusion algorithm - the iterative learning fusion (ILF) algorithm, to improve the quality of images. This algorithm combines iterative learning in control theory with Multi-scale Geometric Analysis (MGA) image fusion algorithms;also, we apply color transfer to preserve color feature and cooperate it with SVM to improve recognition. By performing iterative learning, fusion parameters will converge to optimal in MGA fusion process. Theoretical analysis and experiments demonstrate improvement of visual and quantitative performance by proposed algorithm. © 2012 IEEE.

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：