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

10th IEEE International Conference on Computer and Information technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010

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

ISBN: (纸本)9780769541082

In recent years, heterogeneous parallel system have become a focus research area in high performance computing field. Generally,in a heterogeneous parallel system, CPU provides the basic computing environment and special purpose accelerator (GPU in this paper) provides high computing performance. However, the overall performance of the system is prone to be limited by the data communication between the CPU and the GPU. Data communication is typically used to synchronize the array on the CPU and the stream (in AMD's terminology) on the GPU. In many cases, programmers just add data synchronization for each GPU invoking independently. It is easy to program in this manner but much redundant communication may be introduced, which will dramatically degrade the overall performance. To alleviate this problem, based on the stream programming model, we propose a heuristic data communication schedule approach in this paper. By analyzing the state transition of stream/array data pair, relaxing the synchronization strategy conditionally and considering optimization for branch and loop control structure, our approach can significantly reduce the redundant data communication in most cases. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Optimization of two bottleneck programs in SAR system on GPGPU 20th

Optimization of two bottleneck programs in SAR system on GPG...

引用

20th Annual Conference on Computer Engineering and technology, NCCET 2016

作者： Zhang, Yang Xing, Zuocheng Liu, Cang Tang, Chuan Chen, Lirui Wang, Qinglin National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9789811031588

The Synthetic Aperture Radar (SAR) system is a kind of modern high-resolution microwave imaging radar used in all-weather and all day long to provide remote sensing means and generate high resolution images of the land under illumination of radar beam. Unlike optical sensors, SAR algorithm needs a post-processing process on the data acquired to form the final image. In this article, we use the General Purpose Graphic processing Units (GPGPU) to accelerate two of SAR algorithms, PGA (Phase Gradient Autofocus) and PDE (Partial Differential Equations), which are two computational intensive algorithms in the post-processing process for the system. Our work shows that the GPU architecture has different acceleration effects on the two algorithms. PGA can achieve an acceleration of 21.7% and PDE can get a speed up of 2.58× on GPGPU. We analyse the reasons for the results and conclude that GPU is a promising platform to accelerate the SAR system. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Synthetic aperture radar

来源：评论

学校读者我要写书评

暂无评论

Recent advances on trusted computing in China

引用

Chinese science Bulletin 2012年第35期57卷 4529-4532页

作者： DONG Wei CHEN LiQian School of Computer National University of Defense TechnologyChangsha 410073China National Laboratory for Parallel and Distributed Processing Changsha 410073China

This article highlights some recent research advances on trusted computing in China,focusing mainly on the methodologies and technologies related to trusted computing module,trusted computing platform,trusted network ... 详细信息

关键词：可信计算平台中国计算模块网络连接软件

来源：评论

学校读者我要写书评

暂无评论

Area-efficient high-throughput sorted QR decomposition-based MIMO detector on FPGA

Area-efficient high-throughput sorted QR decomposition-based...

引用

IEEE International Conference on Computer and Communications, ICCC 2015

作者： Zhou, Tong Guo, Song Lei, Yuanwu Dou, Yong National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781467381253

This paper aimed to improve MIMO detector's performance in both throughput and cost. Thus, it presents a FPGA architecture implementation for the SQRD detection in a 4 × 4 16-QAM MIMO wireless communication systems. The exploitation of fine-grained parallelism and coarse-grained parallelism strategies are responsible for bettering the performance of the implementation. Besides, this paper proposes a method to ensure the correctness of the implementation of time-sharing modules, which is general and applicable to any MIMO detector implementation. The work results in a real-time FPGA-based implementation delivering 32 MSQRD/s with 5.2 us latency and lowering more than 50\% cost in hardware resources on a Xilinx Virtex6. © 2015 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Quantitative analysis of collaborative-based annotation in software engineering education 8

Quantitative analysis of collaborative-based annotation in s...

引用

2018 8th International Workshop on Computer science and Engineering, WCSE 2018

作者： Yu, Jie Wang, RenMin Zeng, LingBin Wang, Tao Yin, Gang Fan, Qiang Yu, Yue National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9789811178610

The primary goal of software engineering education is to develop the ability of students, a common method is to let students to read excellent open source code, so that students can improve themselves through this behavior. When reading the code, we tend to add comments to the code, in the past, the labeling of students tend to be an independent behavior, in this paper we analyze the quantitative of collaborative-based code annotation method, and the result shows the collaborative-based code annotation method is working well in improving students programming skills. © Proceedings of 2018 the 8th International Workshop on Computer science and Engineering, WCSE 2018. All rights reserved.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Dolphin: A search engine for OSS based on crowd discussions across communities 7

Dolphin: A search engine for OSS based on crowd discussions ...

引用

7th IEEE International Conference on Software Engineering and Service science, ICSESS 2016

作者： Zhan, Yun Yin, Gang Wang, Tao Cheng, Yang Li, Zhixing Wang, Huaimin National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781467399036

The global open source software resources have become an Internet-scale repository, which provide abundant resources for software reuse. However, how to locate the desired resource efficiently and accurately from such large amounts is quite a challenge problem. Most of recent works barely focus on the semantic similarity by analyzing the software itself, which often result in inappropriate ranking. In this paper, we propose Dolphin, a global OSS search engine, which leverage the crowd discussions around OSS across communities for optimizing software ranking. Dolphin employs the crowd wisdom as an important factor and combines it with the semantic similarity to optimize search results ranking. We implement an OSS search engine based on the proposed approach, which provides online service continuously. Extensive experiments and user studies suggest the effectiveness of our approach. © 2016 IEEE.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

DFTracker: detecting double-fetch bugs by multi-taint parallel tracking

引用

Frontiers of Computer science 2019年第2期13卷 247-263页

作者： Pengfei WANG Kai LU Gen LI Xu ZHOU Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China College of Computer National University of Defense Technology Changsha 410073 China Collaborative Innovation Center of High Performance Computing National University of Defense Technology Changsha 410073 China

A race condition is a common trigger for concurrency bugs. As a special case, a race condition can also occur across the kernel and user space causing a doublefetch bug, which is a field that has received little research attention. In our work, we first analyzed real-world doublefetch bug cases and extracted two specific patterns for doublefetch bugs. Based on these patter ns, we proposed an approach of multi-taint parallel tracking to detect double-fetch bugs. We also implemented a prototype called DFTracker (doublefetch bug tracker), and we evaluated it with our test suite. Our experiments demonstrated that it could effectively find all the double-fetch bugs in the test suite including eight realworld cases with no false negatives and minor false positives. In addition, we tested it on Linux kernel and found a new double-fetch bug. The execution overhead is approximately 2x for single-file cases and approximately 9x for the whole kernel test, which is acceptable. To the best of the authors1 knowledge, this work is the first to introduce multi-taint parallel tracking to double-fetch bug detection—an innovative method that is specific to double-fetch bug features—and has better path coverage as well as lower runtime overhead than the widely used dynamic approaches.

关键词： multi-taint parallel tracking double fetch race condition between kernel and user time of check to time of use real-world case analysis Clang Static Analyzer

来源：评论

学校读者我要写书评

暂无评论

Untrusted Hardware Causes Double-Fetch Problems in the I/O Memory

引用

Journal of Computer science & technology 2018年第3期33卷 587-602页

作者： Kai Lu Peng-Fei Wang Gen Li Xu Zhou College 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 Collaborative Innovation Center of High-Performance Computing National University of Defense Technology Changsha 410073 China

The double fetch problem occurs when the data is maliciously changed between two kernel reads of the supposedly same data, which can cause serious security problems in the kernel. Previous research focused on the double fetches between the kernel and user applications. In this paper, we present the first dedicated study of the double fetch problem between the kernel and peripheral devices （aka. the hardware double fetch）. Operating systems communicate with peripheral devices by reading from and writing to the device mapped I/O （input and output） memory. Owing to the lack of effective validation of the attached hardware, compromised hardware could flip the data between two reads of the same I/O memory address, causing a double fetch problem. We propose a static pattern-matching approach to identify the hardware double fetches from the Linux kernel. Our approach can analyze the entire kernel without relying on the corresponding hardware. The results are categorized and each category is analyzed using case studies to discuss the possibility of causing bugs. We also find four previously unknown double-fetch vulnerabilities, which have been confirmed and fixed after reporting them to the maintainers.

关键词： hardware double fetch double-fetch bug I/O memory peripheral device double-fetch vulnerability

来源：评论

学校读者我要写书评

暂无评论

Automatic concurrency management for distributed applications

Automatic concurrency management for distributed application...

引用

15th IEEE Symposium on Computers and Communications, ISCC 2010

作者： Li, Huiba Liu, Shengyun Peng, Yuxing Li, Dongsheng National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781424477555

Building distributed applications is difficult mostly because of concurrency management. Existing approaches primarily include events and threads. Researchers and developers have been debating for decades to prove which is superior. Although the conclusion is far from obvious, this long debate clearly shows that neither of them is perfect. One of the problems is that they are both complex and error-prone. Both events and threads need the programmers to explicitly manage concurrency, and we believe it is just the source of difficulties. In this paper, we propose a novel approach-automatic concurrency management by the runtime system. It dynamically analyzes the programs to discover potential concurrency opportunities;and it dynamically schedules the communication and the computation tasks, resulting in automatic concurrent execution. This approach is inspired by the instruction scheduling technologies used in modern microprocessors, which dynamically exploits instruction-level parallelism. However, hardware scheduling algorithms do not fit software in many aspects, thus we have to design a new scheme completely from scratch. automatic concurrency management is a runtime technique with no modification to the language, compiler or byte code, so it is good at backward compatibility. It is essentially a dynamic optimization for networking programs. © 2010 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on online failure prediction model and status pretreatment method for exascale system

Research on online failure prediction model and status pretr...

引用

3rd International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery, CyberC 2011

作者： Zhou, Hao Jiang, Yanhuang National Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9780769545578

The reliability issue of Exascale system is extremely serious. Traditional passive fault-tolerant methods, such as rollback-recovery, can not fully guarantee system reliability any more because of their large executing overhead and long recovering duration. Active fault tolerance is expected to become another important fault-tolerant approach for Exascale system. Focusing on system failure prediction, which is one key step of active fault tolerance, we construct online failure prediction model and research on the effective method of system status pretreatment. In order to improve the accuracy and real-time feature of current methods, the proposed Improved Adaptive Semantic Filter (IASF) method processes the latest system logs regularly, filtering useless information out of them according to their semantics. Adopting the main idea of Vector Space Model (VSM), IASF method creates Event Vector corresponding to each log record. By calculating the cosine of vectorial angle, it evaluates the semantics correlation between different log records, and then executes temporal and spatial redundant filter considering the burst feature of log records. IASF method is insensitive to the type of system log and does not introduce any expert system or domain knowledge. The experiment result shows that system can eliminate about 99.6% of useless log records after executing IASF method. © 2011 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：