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

11th International Conference on Information science and technology, ICIST 2021

作者： Jin, Chi Wang, Qinglin Zhao, Yang Dou, Yong National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Changsha China

ISBN: (纸本)9781665412667

Monte Carlo (MC) simulation plays a key role in radiotherapy. Since the simulation time of the MC program cannot fully meet the clinical requirements, we use the ARM-based FT-2000+ multi-core processor for parallelization, which provides an effective solution for accelerating MC dose calculation. In this paper, we implement and verify FT-DPM, which is an OpenMP-based MC Dose Planning Method on FT-2000+. FT-DPM utilizes the parallelism of MC simulation and the advantage of ARM architecture to achieve the parallelization on ARM architecture. Meanwhile, we optimize the original DPM program in terms of memory allocation, data structure and data type. The experiments show that, compared with the original DPM code, FT-DPM obtains very accurate results and reaches the maximum speedups of 155.94 times for the electron case. The parallel program based on FT-2000+ only takes 44.1 seconds to simulate the particle transport of 100 million times, showing good clinical application potential. In addition, the speedup and efficiency of FT-DPM running on different core counts are also discussed. © 2021 IEEE.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Irony Detector at SemEval-2018 Task 3: Irony Detection in English Tweets using Word Graph 12

Irony Detector at SemEval-2018 Task 3: Irony Detection in En...

引用

12th International Workshop on Semantic Evaluation, SemEval 2018, co-located with the 16th Annual Conference of the North American Chapter of the

作者： Ahmed, Usman Zafar, Lubna Qayyum, Faiza Islam, Muhammad Arshad Parallel Computing Network Department of Computer Science Capital University of Science and Technology Islamabad Pakistan

ISBN: (纸本)9781948087209

This paper describes the Irony detection system that participates in SemEval-2018 Task 3: Irony detection in English tweets. The system participated in the subtasks A and B. This paper discusses the results of our system in the development, evaluation and post evaluation. Each class in the dataset is represented as directed unweighted graphs. Then, the comparison is carried out with each class graph which results in a vector. This vector is used as features by machine learning algorithm. The model is evaluated on a hold on strategy. The organizers randomly split 80% (3,833 instances) training set (provided to the participant in training their system) and testing set 20% (958 instances). The test set is reserved to evaluate the performance of participants systems. During the evaluation, our system ranked 23 in the Coda Lab result of the subtask A (binary class problem). The binary class system achieves accuracy 0.6135, precision 0.5091, recall 0.7170 and F measure 0.5955. The subtask B (multi-class problem) system is ranked 22 in Coda Lab results. The multiclass model achieves the accuracy 0.4158, precision 0.4055, recall 0.3526 and f measure 0.3101. © 2018 Association for Computational Linguistics

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

A Heterogeneous KBA parallel Algorithm for the Cartesian Discrete Ordinates for Multizone Heterogeneous System 8

A Heterogeneous KBA Parallel Algorithm for the Cartesian Dis...

引用

8th International Conference on Computer and Communication Systems, ICCCS 2023

作者： Li, Runhua Liu, Jie National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Changsha China

ISBN: (纸本)9781665456128

Innovations in powerful high-performance computing (HPC) architecture are enabling high-fidelity whole-core neutron transport simulations at reasonable time. Especially, the currently fashionable heterogeneous architectures make the cost of such simulations at very low level. Neutron distribution of a reactor core is governed by the Boltzmann neutron transport equation (BTE), first viable solutions of which need tremendous computer resources. Among of the high-fidelity numerical methods, the discrete ordinates method (SN) is becoming popular in the reaction design community by taking a good balance between computational cost and accuracy. Recently, MT-3000, which is a multizone heterogeneous architecture with a peak double precision performance of 11.6 TFLOPS, is proposed. In this work, the BTE is solved by the SN with heterogenous Koch-Baker-Alcouffe (KBA) parallel algorithms based on the MT-3000 architecture. A communication mechanism has been established to efficiently transmit data among the acceleration cores and the CPU cores. The kernel computation procedure is largely accelerated by the vectorization and instruction pipelining techniques. Numerical experiments show that our formulation could achieve 1.37 TFLOPs with single MT-3000, that is 11.8% of its peak performance. © 2023 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization of a CFD Application on Intel Multicore and Manycore Architectures

Performance Optimization of a CFD Application on Intel Multi...

引用

10th Annual Conference of Advanced Computer Architecture, ACA 2014

作者： Che, Yonggang Zhang, Lilun Wang, Yongxian Xu, Chuanfu Liu, Wei Cheng, Xinghua Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9783662444900

This paper reports our experience optimizing the performance of a high-order and high accurate Computational Fluid Dynamics (CFD) application (HOSTA) on the state of art multicore processor and the emerging Intel Many Integrated Core (MIC) coprocessor. We focus on effective loop vectorization and memory access optimization. A series techniques, including data structure transformations, procedure inlining, compiler SIMDization, OpenMP loop collapsing, and the use of Huge Pages, are explored. Detailed execution time and event counts from Performance Monitoring Units are measured. The results show that our optimizations have improved the performance of HOSTA by 1.61× on a two Intel Sandy Bridge processors based computer node and 1.97× on a Intel Knights Corner coprocessor, the public MIC product. The microarchitecture level effects of these optimizations are also discussed. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

DIPP—An LLC replacement policy for on-chip dynamic heterogeneous multi-core architecture

DIPP—An LLC replacement policy for on-chip dynamic heteroge...

引用

International Conference of Young Computer Scientists, Engineers and Educators, ICYCSEE 2015

作者： Yang, Zhang Zuocheng, Xing Xiao, Ma Science and technology on Parallel and distributed processing laboratory National University of Defense Technology ChangSha China

ISBN: (纸本)9783662462478

As the big data era is coming, it brings new challenges to the massive data processing. A combination of GPU and CPU on chip is the trend to release the pressure of large scale computing. We found that there are different memory access characteristics between GPU and CPU. The most important one is that the programs of GPU include a large number of threads, which lead to higher access frequency in cache than the CPU programs. Although the LRU policy favors the programs with high memory access frequency, the programs of GPU can’t get the corresponding performance boost even more cache resources are provided. So LRU policy is not suitable for heterogeneous multi-core processor. Based on the different characteristics of GPU and CPU programs on memory access, this paper proposes an LLC dynamic replacement policy--DIPP (Dynamic Insertion/ Promotion Policy) for heterogeneous multi-core processors. The core idea of the replacement policy is to reduce the miss rate of the program and enhance the overall system performance by limiting the cache resources that GPU can acquire and reducing the thread interferences between programs. Experiments compare the DIPP replacement policy with LRU and we conduct a classified discussion according to the program results of GPU. Friendly programs enhance 23.29% on the average performance (using arithmetic mean). Large working sets programs can improve 13.95%, compute-intensive programs enhance 9.66% and stream class programs improve 3.8%. © Springer-Verlag Berlin Heidelberg 2015.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

End-to-End learning of cost-volume aggregation for real-time dense stereo

End-to-End learning of cost-volume aggregation for real-time...

引用

2017 IEEE International Workshop on Machine Learning for Signal Processing, MLSP 2017

作者： Kuzmin, Andrey Mikushin, Dmitry Lempitsky, Victor Skolkovo Institute of Science and Technology Russia Applied Parallel Computing LLC Russia

ISBN: (纸本)9781509063413

We present a new deep learning-based approach for dense stereo matching. Compared to previous works, our approach does not use deep learning of pixel appearance descriptors, employing very fast classical matching scores instead. At the same time, our approach uses a deep convolutional network to predict the local parameters of cost volume aggregation process, which in this paper we implement using differentiable domain transform. By treating such transform as a recurrent neural network, we are able to train our whole system that includes cost volume computation, cost-volume aggregation (smoothing), and winner-takes-all disparity selection end-to-end. The resulting method is highly efficient at test time, while achieving good matching accuracy. On the KITTI 2012 and KITTI 2015 benchmark, it achieves a result of 5.08% and 6.34% error rate respectively while running at 29 frames per second rate on a modern GPU. © 2017 IEEE.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

PartialRC: A Partial Recomputing Method for Efficient Fault Recovery on GPGPUs

引用

Journal of Computer science & technology 2012年第2期27卷 240-255页

作者：徐新海杨学军薛京灵林宇斐林一松 National Laboratory for Parallel and Distributed Processing School of ComputerNational University of Defense Technology Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales

GPGPUs are increasingly being used to as performance accelerators for HPC （High Performance Computing） applications in CPU/GPU heterogeneous computing systems, including TianHe-1A, the world＇s fastest supercomputer in the TOP500 list, built at NUDT （National University of Defense technology） last year. However, despite their performance advantages, GPGPUs do not provide built-in fault-tolerant mechanisms to offer reliability guarantees required by many HPC applications. By analyzing the SIMT （single-instruction, multiple-thread） characteristics of programs running on GPGPUs, we have developed PartialRC, a new checkpoint-based compiler-directed partial recomputing method, for achieving efficient fault recovery by leveraging the phenomenal computing power of GPGPUs. In this paper, we introduce our PartialRC method that recovers from errors detected in a code region by partially re-computing the region, describe a checkpoint-based faulttolerance framework developed on PartialRC, and discuss an implementation on the CUDA platform. Validation using a range of representative CUDA programs on NVIDIA GPGPUs against FullRC （a traditional full-recomputing Checkpoint-Rollback-Restart fault recovery method for CPUs） shows that PartialRC reduces significantly the fault recovery overheads incurred by FullRC, by 73.5% when errors occur earlier during execution and 74.6% when errors occur later on average. In addition, PartialRC also reduces error detection overheads incurred by FullRC during fault recovery while incurring negligible performance overheads when no fault happens.

关键词： GPGPU partial recomputing fault tolerance CUDA checkpointing

来源：评论

学校读者我要写书评

暂无评论

Kinetostatics Analysis of a Novel 6-DOF parallel Manipulator with Three Planar Limbs and Equipped with Three Fingers

引用

Chinese Journal of Mechanical Engineering 2014年第5期27卷 919-927页

作者： LU Yi LI Xuepeng College of Mechanical Engineering Yanshan University Key Laboratory of Parallel Robot and Mechatronic System of Hebei Province Key Laboratory of Advanced Forging & Stamping Technology and Science of Ministry of National Education

It is significant to develop a robot hand with high rigidity by a 6-DOF parallel manipulator（PM）.However,the existing6-DOF PMs include spherical joint which has less capability of pulling force bearing,less rotation range and lower precision under alternately heavy loads.A novel 6-DOF PM with three planar limbs and equipped with three fingers is proposed and its kinematics and statics are analyzed systematically.A 3-dimension simulation mechanism of the proposed manipulator is constructed and its structure characteristics is *** kinematics formulae for solving the displacement,velocity,acceleration of the platform,the active legs and the fingers are *** statics formulae are derived for solving the active forces of PM and the finger *** analytic example is given for solving the kinematics and statics of proposed manipulator and the analytic solved results are verified by the simulation *** is proved from the error analysis of analytic solutions and simulation solutions that the derived analytic formulae are correct and provide the theoretical and technical foundations for its manufacturing,control and application.

关键词： parallel manipulator planar limbs finger kinematics statics

来源：评论

学校读者我要写书评

暂无评论

SMVAR: A Novel RNN Accelerator Based on Non-blocking Data Distribution Structure 25

SMVAR: A Novel RNN Accelerator Based on Non-blocking Data Di...

引用

25th IEEE International Conferences on High Performance Computing and Communications, 9th International Conference on Data science and Systems, 21st IEEE International Conference on Smart City and 9th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Xu, Jinwei Jiang, Jingfei Xu, Shiyao Gao, Lei National University of Defense Technology Science and Technology on Parallel and Distributed Laboratory Hunan Changsha China

ISBN: (纸本)9798350330014

Recurrent neural networks (RNNs) have become common models in the field of artificial intelligence to process temporal sequence task, such as speech recognition, text analysis, natural language processing, etc. To speedup RNNs inference, previous research proposed model sparse pruning techniques. However, the pruning rate of existing sparse pruning algorithms will be affected by pruning granularity and hardware friendliness. In order to approximate nonstructured pruning algorithm, this paper proposes Large Region Balanced Sparse (LRBS) pruning method, which does not limit sub-matrix shape and effectively improves pruning rate. Furthermore, we propose Sparse Matrix Vector Multiplication Accelerator for RNNs (SMVAR), which adopt non-blocking data distribution structure to solve the problem of efficient execution of large region irreg-ular matrix multiplication. To further improve the accelerator performance, SMVAR fine-grained adjusts the pipeline between macro-operations to reduce the idle of compute components. In addition, according to the coarse-grained block characteristics of LRBS algorithm, we develop the coarse-grained parallelism of accelerator with multiply compute units(CUs) structure. Experiments show that the pruning rate of our proposed LRBS is 1.25x-2.5x higher than that of the existing pruning algorithms. Compared with the existing work, the execution efficiency is improved by more than 2.02x-35.9x in the same application scenario. © 2023 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

A Novel Interactive Recurrent Attention Network for Emotion-Cause Pair Extraction 3

A Novel Interactive Recurrent Attention Network for Emotion-...

引用

3rd International Conference on Algorithms, Computing and Artificial Intelligence, ACAI 2020

作者： Jia, Xiangyu Chen, Xinhai Wan, Qian Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781450388115

Unlike Emotion Cause Extraction (ECE) task which consists of pre-annotate emotions and passage, emotion-cause pair extraction (ECPE) aims at extracting potential emotions and corresponding causes in the document without the need for pre-annotations. Traditional ECPE solutions divide the extracting emotions and causes operation into two separate parts. However, separating the bidirectional dependence between emotion and cause may lose a lot of potentially useful information. In this paper, we propose a novel interactive recurrent attention network (IRAN). Our approach focuses on the bidirectional impact between emotions and causes, and extracts emotions and causes simultaneously. The information in the document can be fully exploited through multiple modeling and information extraction. Our emotion-specific transformation and distance fusion correlation can adaptively focus on the emotions and the distance, gracefully incorporate them into a distinguishable neural network attention framework. The experimental results show that our proposed model achieves better performance than other widely-used models on the ECPE corpus. © 2020 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：