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

A full-pipelined architecture of the schnorr-euchner MIMO sphere decoder

9th FTRA InternationalConference on Future Information Technology, FutureTech 2014

作者： Guo, Lei Zeng, Shirong Dou, Yong Jiang, Jingfei National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9783642550379

Multiple-input and multiple-output (MIMO) is an important approach in high-rate wireless communications. The Schnorr-Euchner (SE) sphere-decoding algorithm enables fast detection for receivers by recursive tree searching with optimized expanding order. In this paper, we propose a looped-pipeline architecture for an SE MIMO detector that processes multiple groups of data in parallel. The full-pipelined design has a short critical path that provides a maximum working frequency of 229 MHz on FPGA. High throughput is achieved at a relatively low cost. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Optimized deep belief networks on CUDA GPUs

Optimized deep belief networks on CUDA GPUs

引用

International Joint Conference on Neural Networks, IJCNN 2015

作者： Li, Teng Dou, Yong Jiang, Jingfei Wang, Yueqing Lv, Qi National Laboratory for Parallel and Distributed Processing National University of Defense and Technology Changsha China

ISBN: (纸本)9781479919604

A deep belief network (DBN) is an important branch of deep learning models and has been successfully applied in many machine learning and pattern recognition fields such as computer vision and speech recognition. However, the training of billions of parameters in DBN is computationally challenging for modern central processing units (CPUs). Many studies have reported the efficient implementations of the pre-training process of DBNs for graphics processing units (GPUs), but few studies have mentioned the fine-tuning process of DBNs. In this paper, we describe an efficient DBN implementation on the GPU, including the pre-training and fine-tuning processes. Experimental results show that our proposed method on the GPU (NVIDIA Tesla K40c) achieves up to 22 speedups on the pre-training process and 33 speedups on the fine-tuning processes compared with conventional CPU (Intel Core i7-4790K) implementations. Moreover, the performance of our algorithm is superior to that of the OpenBLAS library on the CPU and the CUBLAS library on the GPU. © 2015 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Mapping OpenMP concepts to the stream programming model

Mapping OpenMP concepts to the stream programming model

引用

International Conference on Computer Science and Education

作者： Tang, Tao Lin, Yisong Ren, Xiaoguang National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781424460052

OpenMP is a widely used parallel programming model on traditional multi-core processors. Generally, OpenMP is used to develop fine-grained parallelism through a multithread model. Stream programming model is a new kind of parallel programming model for stream architectures. OpenMP bears a resemblance to the stream programming model at some level. The transformation between the two models has attracted much attention from the research community, since it is the foundation of porting programs between the two architectures. Most related researches focus on the efficiency of porting existing parallel programs to the new architectures such as GPUs. Very few of these studies, however, focus on the portative problem systematically, namely, what kind of parallel programs can be or should be transplanted into stream programs and mapped to run on the stream processors. In this paper, we study the mapping relationship of parallel mechanism in OpenMP to the stream programming model, and point out those parallel mechanisms in OpenMP that are infeasible or undesirable for stream programs. By analyzing two typical benchmarks, we draw the conclusion that a majority of scientific applications are suitable to be mapped to the stream programming model. Our conclusion effectively validates the idea of accelerating scientific applications with the stream processors. ©2010 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

A stream system-on-chip architecture for high speed target recognition based on biologic vision

A stream system-on-chip architecture for high speed target r...

引用

12th Asia-Pacific Computer Systems Architecture Conference, ACSAC 2007

作者： Wu, Nan Yang, Qianming Wen, Mei He, Yi Xun, Changqing Zhang, Chunyuan National Laboratory for Parallel and Distributed Processing Chang Sha Hu Nan 410073 China

ISBN: (纸本)9783540743088

For target recognition based on biologic vision, an application-specific stream SOC: MASA-MI is described in this paper. MASA-MI consists of several heterogeneous cores, and a stream accelerator core is used to accelerate matching image which consumes the most time in target recognition. We implemented it on Altera EP2S60 FPGA. Result shows the 166MHz MASA-MI provides a peak performance of 585 fps. MASA-MI's performance is an order of magnitude higher than those of today's DSPs such as the Texas Instruments TMS320DM642 (600MHz). On the other hand, the cost is far less than special purpose processors. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Integrated circuit layout

来源：评论

学校读者我要写书评

暂无评论

An empirical study of reviewer recommendation in pull-based development model 17

An empirical study of reviewer recommendation in pull-based ...

引用

9th Asia-Pacific Symposium on Internetware, Internetware 2017

作者： Yang, Cheng Zhang, Xunhui Zeng, Lingbin Fan, Qiang Yin, Gang Wang, Huaimin National Laboratory for Parallel and Distributed Processing College of Computer Changsha Hunan410073 China

ISBN: (纸本)1595930361

Code review is an important process to reduce code defects and improve software quality. However, in social coding communities using the pull-based model, everyone can submit code changes, which increases the required code review efforts. Therefore, there is a great need of knowing the process of code review and analyzing the pre-existing reviewer recommendation algorithms. In this paper, we do an empirical study about the PRs and their reviewers in Rails project. Moreover, we reproduce a popular and effective IR-based code reviewer recommendation algorithm and validate it on our dataset which contains 16,049 *** find that the inactive reviewers are very important to code reviewing process, however, the pre-existing method's recommendation result strongly depends on the activeness of reviewers. © 2017 Association for Computing Machinery.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Factorization Machine-based Unsupervised Model Selection Method

Factorization Machine-based Unsupervised Model Selection Met...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Zhang, Ruyi Wang, Yijie Xu, Hongzuo Zhou, Haifang National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Machine learning is broadly used in many intelligent cybernetic systems. With the burgeoning of the communities of AI, the number of machine learning-based models is rapidly increasing, but picking a suitable and optimal (or relatively good) model from overwhelming options has become a conundrum when deploying a new system. Therefore, we are motivated by an intriguing question: Can we automatically select a proper model for new data? However, unsupervised model selection poses two main challenges: (i) Evaluation and comparison of candidate models on the new data are infeasible due to the lack of labels;and (ii) It is non-trivial to build relationships between model performance and data characteristics when the interaction between these characteristics should be considered. In light of these limitations, this paper proposes a factorization machine-based unsupervised model selection method. Following mainstream model selection protocols, we also leverage model performance on prior known datasets. Differently, we learn higher-order complex relationships between model performance and dataset characteristics. Specifically, our method transfers the historical performance into a second-order function of meta-features and embedding weights by harnessing the power of factorization machine. This function can be subsequently used to select a proper model when given a new dataset. Extensive experiments show that our method obtains more superior model selection performance than five state-of-the-art approaches, and our method executes faster than its competitors by approximate three magnitudes. © 2022 IEEE.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

DDPER: DECENTRALIZED distributed PRIORITIZED EXPERIENCE REPLAY

DDPER: DECENTRALIZED DISTRIBUTED PRIORITIZED EXPERIENCE REPL...

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Liu, Sidun Qiao, Peng Dou, Yong Li, Rongchun National Laboratory for Parallel and Distributed Processing National University of Defense Technology Hunan China

ISBN: (纸本)9781665438643

In off-policy reinforcement learning, prioritized experience replay plays an important role. However, the centralized prioritized experience replay becomes the bottleneck for efficient training. We propose to approximate the centralized prioritized experience replay in a distributed and decentralized way under certain mild assumptions. To be specific, each actor stores samples in its local replay in the same way as prioritized experience replay, the learner fetches a batch of samples from these replays following a certain strategy. We implement a Deep Q-Learning off-policy algorithm upon the proposed framework. The comparison experiments are performed on a commonly used subset of the Atari-57 learning environment. The experimental results show that the proposed framework speeds up training as the number of actors increases. With the same algorithm and hyper-parameter settings, the proposed framework with 16 actors achieves superior performance that Ape-X with 32 and even more actors does. © 2021 IEEE

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Detailed and clock-driven simulation for HPC interconnection network

引用

Frontiers of Computer Science 2016年第5期10卷 797-811页

作者： Wenhao ZHOU Juan CHEN Chen CUI Qian WANG Dezun DONG Yuhua TANG State Key Laboratory of High Performance Computing School of Computer National University of Defense Technology Changsha 410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China

Performance and energy consumption of high performance computing （HPC） interconnection networks have a great significance in the whole supercomputer, and building up HPC interconnection network simulation plat- form is very important for the research on HPC software and hardware technologies. To effectively evaluate the per- formance and energy consumption of HPC interconnection networks, this article designs and implements a detailed and clock-driven HPC interconnection network simulation plat- form, called HPC-NetSim. HPC-NetSim uses application- driven workloads and inherits the characteristics of the de- tailed and flexible cycle-accurate network simulator. Besides, it offers a large set of configurable network parameters in terms of topology and routing, and supports router＇s on/off states. We compare the simulated execution time with the real execution time of Tianhe-2 subsystem and the mean error is only 2.7%. In addition, we simulate the network behaviors with different network structures and low-power modes. The results are also consistent with the theoretical analyses.

关键词： high performance computing clock-driven sim-ulation interconnection network BookSim

来源：评论

学校读者我要写书评

暂无评论

Exploiting attribute redundancy in extracting open source forge websites

Exploiting attribute redundancy in extracting open source fo...

引用

4th International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery, CyberC 2012

作者： Li, Xiang Zhu, Yanxu Yin, Gang Wang, Tao Wang, Huaimin National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9780769548104

Open Source Forge (OSF) websites provide information on massive open source software projects, extracting these web data is important for open source research. Traditional extraction methods use string matching among pages to detect page template, which is time-consuming. A recent work published in VLDB exploits redundant entities among websites to detect web page coordinates of these entities. The experiment gives good results when these coordinates are used for extracting other entities of the target site. However, OSF websites have few redundant project entities. This paper proposes a modified version of that redundancy-based method tailored for OSF websites, which relies on a similar yet weaker presumption that entity attributes are redundant rather than whole entities. Like the previous work, we also construct a seed database to detect web page coordinates of the redundancies, but all at the attribute-level. In addition, we apply attribute name verification to reduce false positives during extraction. The experiment result indicates that our approach is competent in extracting OSF websites, in which scenario the previous method can not be applied. © 2012 IEEE.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Enhanced streamline texture synthesis for vector field visualization 4

Enhanced streamline texture synthesis for vector field visua...

引用

4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000

作者： Zhang, Wen Li, Xiaomei National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)0769505902

The Streamline Texture Synthesis (STS) method uses a different 1D texture to texture map each streamline and streamline textures are synthesized. The Enhanced STS (ESTS) adjusts the width of a streamline based on the critical point and maps several 1D textures to a streamline in order to accelerate computing. ESTS can also simulate animations and visualize 2D unsteady or 3D surface flows. The analyzed result proves that ESTS produces substantially better visual results and ESTS is fast enough to visualize vector field interactively. © 2000 IEEE.

关键词： Computer graphics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：