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

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Ji Wu Dezun Dong Xiangke Liao Li Wang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

Multi-NoC (multiple network-on-chip) has demonstrated its advantages in power gating for reducing leakage power. This work presents Chameleon, a novel heterogeneous Multi-NoC design. Chameleon employs a fine-grained power gating algorithm which exploits power saving opportunities at different levels of granularity simultaneously. Integrated with a performance-aware traffic allocation policy, Chameleon is able to achieve both high power efficiency and good performance at varying network utilization. Our experimental results show that Chameleon delivers an average of 3.39% higher performance than Catnap, the best in the literature. More importantly, Chameleon consumes an average of 17.16% less power than Catnap.

关键词： Resource management Routing Algorithm design and analysis Optimization Logic gates Computers Power demand

来源：评论

学校读者我要写书评

暂无评论

Accelerating Monte Carlo Simulation of Neutron Transport on the Intel MIC Architecture

Accelerating Monte Carlo Simulation of Neutron Transport on ...

引用

International Conference on Information Science and Control Engineering (ICISCE)

作者： Xiantao Cui Jie Liu Lihua Chi Qinglin Wang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781467368513

Simulation of particle transport is critical for a great many of scientific and engineering domains. The Monte Carlo (MC) method is one of the most important numerical methods for the simulation of particle transport, and can simulate many complex types of particle transport. But the computation requirement of the MC simulation is very large. In 2010, Intel announced the Intel Many Integrated Core (MIC) architecture, which consists of many simple general-purpose cores and supports the well-known shared-memory execution model that is the base of most nodes in HPC machines. On account of the independence of simulation of each particle in the MC method, it is well-suited to accelerate the MC simulation on MIC. In this paper, an algorithm named MCNP-MIC based MIC is presented for MC simulation of neutron transport in the context of deep penetration problem, which includes the development of parallel random generator, the assignment of particle number based thread number and the design of high efficiency data structures for parallelism. Eventually, we get the results as follows: with the same problem scale and computational accuracy, the MCNPMIC algorithm has achieved roughly 5.6-fold speedup running on a 57-core MIC chip in comparison with the serial MCNP algorithm on an Intel Xeon E5-2670 CPU.

关键词： Microwave integrated circuits Neutrons Algorithm design and analysis Monte Carlo methods Data structures Graphics processing units

来源：评论

学校读者我要写书评

暂无评论

Robust Weighted Supervised Sparse Coding for Image Classification

Robust Weighted Supervised Sparse Coding for Image Classific...

引用

2015 IEEE 16th International Conference on Communication Technology(ICCT 2015)

作者： Xiang Zhang Naiyang Guan Zhigang Luo College of Computer National University of Defense Technology National Laboratory for Parallel and Distributed Processing National University of Defense Technology

Sparse coding has shown its great potential in learning image feature representation. Recent developed methods such as group sparse coding prefer discovering the group relationships among examples and have achieved the state-of-the-art results in image classification. However, they suffer from poor robustness shortcomings in practice. This paper proposes a robust weighted supervised sparse coding method(RWSSC) to address this ***, RWSSC distinguishes different classes' contributions to the sparse coding by a novel weighting strategy meanwhile removes the out liers by imposing1 l-regularization over the noisy entries. Benefitting from these strategies, RWSSC can effectively boost performance of sparse coding in image ***, we developed the block coordinate descent algorithm to optimize it, and proved its *** results of image classification on two popular datasets show that RWSSC outperforms the representative sparse coding methods in quantities.

关键词： Sparse coding Supervised learning Image classification

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed Data Clustering on Spark

Efficient Distributed Data Clustering on Spark

引用

IEEE International Conference on Cluster Computing

作者： Jia Li Dongsheng Li Yiming Zhang National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9781467365994

Data clustering is usually time-consuming since it by default needs to iteratively aggregate and process large volume of data. Approximate aggregation based on sample provides fast and quality ensured results. In this paper, we propose to leverage approximation techniques to data clustering to obtain the trade-off between clustering efficiency and result quality, along with online accuracy estimation. The proposed method is based on the bootstrap trials. We implemented this method as an Intelligent Bootstrap Library (IBL) on Spark to support efficient data clustering. Intensive evaluations show that IBL can provide a 2x speed-up over the state of art solution with the same error bound.

关键词： Sparks Accuracy Data mining Estimation error distributed databases Approximation methods

来源：评论

学校读者我要写书评

暂无评论

RaceChecker: Efficient Identification of Harmful Data Races

RaceChecker: Efficient Identification of Harmful Data Races

引用

Euromicro Conference on parallel, distributed and Network-Based processing

作者： Kai Lu Zhendong Wu Xiaoping Wang Chen Chen Xu Zhou Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha PR China

ISBN: (纸本)9781479984923

Data races hidden in concurrent programs have caused severe failures. To improve the reliability, many race detectors are proposed. However, most of the reported races are not harmful, which consumes manual effort to identify the harmful races. This paper proposes RaceChecker that can detect the potential races and identify the harmful races effectively and efficiently. Unlike previous detectors, RaceChecker combines happens-before relation and ad-hoc synchronization to prune the infeasible races so that fewer potential races are required to be verified. Before verification, RaceChecker groups the remaining potential races, guaranteeing the potential races in one group do not interfere with each other. Therefore, multiple potential races in one group can be verified together in one execution. To our knowledge, this is the first effective technique that groups the potential races to improve the efficiency. Unlike previous detectors that verify one potential race in one execution, RaceChecker dynamically controls thread scheduler to create real race conditions to verify multiple potential races in one execution, identifying the harmful races that cause program failures. We have implemented RaceChecker as a prototype tool and have experimented on a number of real-world concurrent programs. Results show that 66% of the potential races are infeasible and nearly 48% of the executions are reduced by the grouping strategy. The known harmful races are also identified effectively. By pruning and grouping, RaceChecker identifies the harmful races more efficiently. Comparing with RaceMob and RaceFuzzer, the time is reduced significantly, with an average of 45% and 81% respectively.

关键词： Detectors Synchronization Concurrent computing Programming Relays Instruction sets Monitoring

来源：评论

学校读者我要写书评

暂无评论

An Online/Offline HIBS Scheme for Privacy Protection of People-centric Sensing

An Online/Offline HIBS Scheme for Privacy Protection of Peop...

引用

International Conference on Industrial Informatics, Computing Technology, Intelligent Technology, Industrial Information Integration (ICIICII)

作者： Peixin Chen Xiaofeng Wang Jinshu Su College of Computer National University of Defense Technology Changsha China National Key Laboratory for Parallel Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781467383134

People-Centric Sensing (PCS), which collects information closely related to human activity and interactions in societies, is stepping into a flourishing time. Along with its great benefits, PCS poses new security challenges such as data integrity, participant privacy. Hierarchical Identity-Based Signature (HIBS) scheme can efficiently provide high integrity messaging, secure communication and privacy protection to PCS. However, the low computation efficiency primarily hinders the PCS adoption of HIBS scheme. In this paper, we propose an online/offline HIBS (HIBOOS) scheme for securing PCS. By splitting the signing phase into online and offline procedures, our scheme achieves high signing efficiency.

关键词： Games Sensors Privacy Public key Generators Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

MatrixMap: Programming Abstraction and Implementation of Matrix Computation for Big Data Applications

MatrixMap: Programming Abstraction and Implementation of Mat...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Yaguang Huangfu Jiannong Cao Hongliang Lu Guanqing Liang Department of Computing The Hong Kong Polytechnic University Parallel and Distributed Processing Laboratory National University of Defense Technology

The computation core of many big data applications can be expressed as general matrix computations, including linear algebra operations and irregular matrix operations. However, existing parallel programming systems such as Spark do not have programming abstraction and efficient implementation for general matrix computations. In this paper, we present MatrixMap, a unified and efficient data-parallel system for general matrix computations. MatrixMap provides powerful yet simple abstraction, consisting of a distributed data structure called bulk key matrix and a computation interface defined by matrix patterns. Users can easily load data into bulk key matrices and program algorithms into parallel matrix patterns. MatrixMap outperforms current state-of-the-art systems by employing three key techniques: matrix patterns with lambda functions for irregular and linear algebra matrix operations, asynchronous computation pipeline with optimized data shuffling strategies for specific matrix patterns and in-memory data structure reusing data in iterations. Moreover, it can automatically handle the parallelization and distribute execution of programs on a large cluster. The experiment results show that MatrixMap is 12 times faster than Spark.

关键词： Data structures Programming Linear algebra Machine learning algorithms Sparks Sparse matrices Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Virtual Frame Aggregation: Clustered Channel Access in Wireless Networks

Virtual Frame Aggregation: Clustered Channel Access in Wirel...

引用

IEEE International Conference on Communications

作者： Xuan Dong Shaohe Lv Chunsheng Zhu Rukhsana Ruby Xiaodong Wang Xingming Zhou Victor C. M. Leung National Laboratory of Parallel and Distributed Processing National University of Defense Technology Department of Electrical and Computer Engineering The University of British Columbia

ISBN: (纸本)9781467364300

Coordination among users is inevitable in wireless communication for efficient medium access. Even though the data rate of individual user increases significantly, the performance of wireless network does not grow up accordingly due to the high MAC coordination overhead. In this paper, we present VFA, namely virtual frame aggregation, to achieve high coordination efficiency by amortizing the overhead over multiple transmissions. VFA provides a novel way to construct a winner cluster and allow the winners to transmit without interruption. Specifically, in a multicarrier network, every contending node chooses a subcarrier and the nodes are ordered by the index of the chosen subcarrier. When there are some subcarriers chosen by two or more nodes, an additional slot is exploited to reorder the collided nodes. Finally, all ordered nodes form a cluster and the transmissions are issued sequentially and uninterruptedly. Simulation results show that usually two slots are enough to construct a sufficiently large winner cluster. Moreover, VFA achieves a notable throughput gain over IEEE 802.11 as high as 120% with better fairness under various scenarios.

关键词： Wireless communication Antennas Wires

来源：评论

学校读者我要写书评

暂无评论

Design, Implementation and Evaluation of an Application-Layer Virtualized Network

Design, Implementation and Evaluation of an Application-Laye...

引用

2015 IEEE Symposium on Service-Oriented System Engineering

作者： Yiming Zhang Dongsheng Li Yijie Wang Zhigang Sun Feng Zhao Jinshu Su National University of Defense Technology Changsha Hunan CN School of Computer National Laboratory for Parallel and Distributed Processing (PDL) Changsha China

The performance of virtualized networks is critical to cloud applications. The "distributed line graphs" (DLG) are a universal technique for designing network topologies based on arbitrary regular graphs. In this paper we implement a prototype (C library) for a DLG-enabled network (called DLG-Kautz), as an application-layer virtualized network service. The effectiveness of our design and implementation is demonstrated through prototype evaluations.

关键词： Routing Message systems Ports (Computers) Servers Payloads Prototypes Libraries

来源：评论

学校读者我要写书评

暂无评论

Experimental verification of the parasitic bipolar amplification effect in PMOS single event transients

引用

Chinese Physics B 2014年第7期23卷 775-779页

作者：何益百陈书明 College of Computer National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

The contribution of parasitic bipolar amplification to SETs is experimentally verified using two P-hit target chains in the normal layout and in the special layout. For PMOSs in the normal layout, the single-event charge collection is composed of diffusion, drift, and the parasitic bipolar effect, while for PMOSs in the special layout, the parasitic bipolar junction transistor cannot turn on. Heavy ion experimental results show that PMOSs without parasitic bipolar amplification have a 21.4% decrease in the average SET pulse width and roughly a 40.2% reduction in the SET cross-section.

关键词： single event effect single event transient parasitic bipolar amplification heavy ion experiments

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：