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

4th International Conference on Computer Engineering and Networks, CENet2014

作者： Li, Teng Dou, Yong Jiang, Jingfei Qiao, Peng Department of Computer Science National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

ISBN: (纸本)9783319111032

Moving objects detection is important in traffic video analysis, and many algorithms are being increasingly applied to moving objects detection. Most of these algorithms are time-consuming and cannot satisfy real-time demand in traffic video analysis by using a conventional central processing unit (CPU) sequential method. The emergence of the graphics processing unit (GPU) and multi-core CPU provides a method to accelerate the aforementioned algorithms to meet demand. In this study, we provide a GPU-accelerated implementation of the background subtraction algorithm and the morphological operation algorithm. Then, the connected component labeling algorithm is parallelized on a multi-core CPU with Open Multi-processing (OpenMP). Furthermore, parallel pipeline implementation on a heterogeneous platform is proposed by integrating the aforementioned algorithms. Experimental results show that the proposed implementation achieves a significant speedup of up to 5×, compared with sequential implementation on a CPU. © Springer International Publishing Switzerland 2015.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Labelwalking nonnegative matrix factorization 40

Labelwalking nonnegative matrix factorization

引用

40th IEEE International Conference on Acoustics, Speech, and Signal processing, ICASSP 2015

作者： Lan, Long Guan, Naiyang Zhang, Xiang Huang, Xuhui Luo, Zhigang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781467369978

Semi-supervised learning (SSL) utilizes plenty of unlabeled examples to boost the performance of learning from limited labeled examples. Due to its great discriminant power, SSL has been widely applied to various real-world tasks such as information retrieval, pattern recognition, and speech separa- tion. Label propagation (LP) is a popular SSL method which propagates labels through the dataset along high density areas defined by unlabeled examples, LP assumes nearby examples should share the same label, thus, it unavoidably pushes the labels to the wrong examples, especially when different la- beled examples are not strictly separated. Seed K-means uses labeled examples to initialize class centers, and avoid getting stuck in poor local optima comparing to traditional K-means, however the hard constraint of each example's membership makes Seed K-means failed in many real world applications. This paper proposes a novel label walking nonnegative matrix factorization method (LWNMF) to handle labeled examples in SSL based on the framework of NMF. LWNMF decomposes the whole dataset into the product of a basis matrix and a coefficient matrix, and to travel labels to unlabeled examples, LWNMF regards the class indicators of labeled examples as their coefficients and iteratively updates both basis matrix and coefficients of unlabeled examples. Since LWNMF learns comprehensive class centroids, labels iteratively walk to unlabeled examples through these significant centroids. © 2015 IEEE.

关键词： K-means Label propagation Nonnegative matrix factorization Semisupervised learning

来源：评论

学校读者我要写书评

暂无评论

Identifying repeated interleavings to improve the efficiency of concurrency bug detection 15th

Identifying repeated interleavings to improve the efficiency...

引用

15th International Conference on Algorithms and Architectures for parallel processing, ICA3PP 2015

作者： Wu, Zhendong Lu, Kai Wang, Xiaoping Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)9783319271392

Detecting concurrency bugs is becoming increasingly important. Many pattern-based concurrency bug detectors focus on the specific types of interleavings that are correlated to concurrency bugs. To detect multiple types of concurrency bugs, general detectors focus on multiple types of interleaving patterns, including data race pattern, atomicity violation pattern, and atomic-set violation pattern. Unfortunately, they suffer from redundant analysis due to repeated interleavings, which may affect the efficiency of concurrency bug detection. Hence, we propose an approach to identify the repeated interleavings. To the best of our knowledge, this is the first approach that can prune repeated interleavings to improve the efficiency of concurrency bug detection. We apply our approach to existing general detectors (PECAN and Maple) to avoid analyzing repeated interleavings. We evaluated the general detectors with and without our approach, respectively. The experimental results show that the bug detection results are not affected. With our approach, the bug detection time of PECAN and Maple are reduced by 40.0% and 44.4%, respectively. Additionally, our approach does not affect the overhead of bug detection, and consumes only a little memory. © Springer International Publishing Switzerland 2015.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Locality Protected Dynamic Cache Allocation Scheme on GPUs

Locality Protected Dynamic Cache Allocation Scheme on GPUs

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Yang Zhang Zuocheng Xing Li Zhou Chunsheng Zhu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China School of Electronic Science and Engineering National University of Defense Technology Changsha China Department of Electrical and Computer Engineering University of British Columbia Vancouver BC Canada

ISBN: (纸本)9781509032068

As we are approaching the exascale era in supercomputing, designing a balanced computer system with powerful computing ability and low energy consumption becomes increasingly important. GPU is a widely used accelerator in most recently applied supercomputers. It adopts massive multithreads to hide long latency and has high energy efficiency. In contrast to its strong computing power, GPUs have few on-chip resources with several MB of fast on-chip memory storage per SM (Streaming Multiprocessors). GPU caches exhibit poor efficiency due to the mismatch of the throughput-oriented execution model and its cache hierarchy design. Since the severe deficiency in on-chip memory, the benefit of high computing capacity of GPUs is pulled down by the poor cache performance dramatically, which limits system performance and energy-efficiency. In this paper, we put forward a locality protected scheme to make full use of the data locality based on the fixed capacity. We present a Locality Protected method based on instruction PC (LPP) to promote GPU performance. Firstly, we use a PC-based collector to collect the reuse information of each cache line. After getting the dynamic reuse information of the cache line, we take an intelligent cache allocation unit (ICAU) which coordinates the reuse information with LRU (Least Recently Used) replacement policy to find out the cache line with the least locality for eviction. The results show that LPP provides an up to 17.8% speedup and an average of 5.5% improvement over the baseline method.

关键词： Graphics processing units System-on-chip Computer architecture Instruction sets Resource management Optimization Electronic mail

来源：评论

学校读者我要写书评

暂无评论

High Performance Interconnect Network for Tianhe System

引用

Journal of Computer science & technology 2015年第2期30卷 259-272页

作者：廖湘科庞征王克非卢宇彤谢旻夏军董德尊所光 College of Computer National University of Defense Technology Changsha 410073 Science and Technology on Parallel and Distributed Processing Laboratory National Changsha 410073 China China University of Defense Technology State Key Laboratory of High Performance Computing National University of Defense Technology Changsha 410073 China

In this paper, we present the Tianhe-2 interconnect network and message passing services. We describe the architecture of the router and network interface chips, and highlight a set of hardware and software features effectively supporting high performance communications, ranging over remote direct memory access, collective optimization, hardwareenable reliable end-to-end communication, user-level message passing services, etc. Measured hardware performance results are also presented.

关键词： Tianhe-2 supercomputer interconnect network router architecture network interface architecture user-level message passing

来源：评论

学校读者我要写书评

暂无评论

Cooperative repair based on tree structure for multiple failures in distributed storage systems with regenerating codes 15

Cooperative repair based on tree structure for multiple fail...

引用

12th ACM International Conference on Computing Frontiers, CF 2015

作者： Pei, Xiaoqiang Wang, Yijie Ma, Xingkong Fu, Yongquan Xu, Fangliang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan410073 China

ISBN: (纸本)9781450333580

Regenerating codes have been proposed to achieve an optimal trade-off curve between the amount of storage space and the network traffic for repair. However, existing repair schemes based on regenerating codes are inadequate to meet the requirements of small network traffic cost and high efficiency when repairing multiple failures. In this paper, we propose a cooperative repair scheme based on tree structure for multiple failures with regenerating codes, called CTREE. For generality, we propose a two-layer repair framework to support both repairs for single and multiple failures. For high repair efficiency, a parallel tree-structured data transmission technique is proposed to organize the data transmissions between the providers and newcomers. For small network network traffic cost, a core-based data exchange technique is proposed to organize the data exchanges between the coordinator and the other newcomers. To evaluate the performance of CTREE, we conduct experiments on both 30 physical and 200 virtual servers. Numerical analysis and extensive experiments confirm that CTREE can support both single and multiple failure repairs, significantly reduces the network traffic cost and improves the repair efficiency compared with the state-of-the-art approaches under various parameter settings. © Copyright 2015 ACM.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

An Efficient Algorithm for Tensor Principal Component Analysis via Proximal Linearized Alternating Direction Method of Multipliers

An Efficient Algorithm for Tensor Principal Component Analys...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Linbo Qiao Bofeng Zhang Lei Zhuang Jinshu Su College of Computer National University of Defense Technology ChanzSha China National Laboratory for Parallel and Distributed Processing National University of Defense Technology ChangSha China Department of Statistics Shanghai University of Finance and Economics Shanghai China

ISBN: (纸本)9781509036783

In paper, we focus on the computation of the principal components for a general tensor, known as the tensor principal component analysis (PCA) problem. It has been proven that the general tensor PCA problem is reducible to its matricization form when the order is even. Usually it is considered as low-rank matrix completion problems theoretically. It is common to consider nuclear norm as a surrogate of the rank operator since it is the tightest convex lower bound of the rank operator under certain condition. However, most nuclear norm minimization based approaches involve numbers of singular value decomposition (SVD) operations. Given a matrix X ∈ R m × n , the time complexity of SVD operation is O(mn 2 ), which brings prohibitive computational burden to apply these methods in real applications. However, the problem is non-convex, and the proximal mapping associated with non-convex regularization is not easy to compute. It is always solved by the Linearized Alternating Direction Method of Multipliers (LADMM). Despite the success of LADMM in practice, it remains unknown if LADMM is convergent in solving such non-convex compositely regularized optimization. In this paper, we firstly present a detailed convergence analysis of the LADMM algorithm for solving non-convex compositely regularized optimization with a large class of non-convex penalties. Furthermore, we propose a new efficient and scalable algorithm for matrix principal component analysis called Proximal Linearized Alternating Direction Method of Multipliers for Principal Component Analysis(PLADMPCA). Different from traditional matrix factorization methods, PLADMPCA utilizes the linearization technique to formulate the matrix as an outer product of vectors, which greatly improves the computational efficacy compared to matrix factorization method. We empirically evaluate the proposed algorithm PLADMPCA on synthetic tensor data with different order. Results have shown that PLADMPCA have much better computational

关键词： Tensile stress Principal component analysis Algorithm design and analysis Convergence Matrix decomposition Optimization Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Hierarchical routing algorithm for ad hoc networks using mobile VMN

引用

International Journal of Autonomous and Adaptive Communications Systems 2016年第1-2期9卷 40-56页

作者： Yan, Guofeng Peng, Yuxing Liu, Junyi Chen, Shuhong School of Computer and Communication Hunan Institute of Engineering Xiangtan411101 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China School of Computer National University of Defense Technology Changsha410073 China School of Information Science and Engineering Central South University Changsha410083 China

One of the most significant challenges introduced by routing protocol in mobile networks is coping with the unpredictable motion and the unreliable behaviour of mobile nodes. In this paper, we present a hierarchical routing algorithm based on virtual mobile node (VMN). A routing path can be found rapidly by exchanging path information between VMNs without accurate topology information. We discuss the routing process and the implementing details of the proposed routing algorithm. Finally, we evaluate the performance of our hierarchical routing algorithm through simulations, and the results show that the number of mobile WAVE generated by routing algorithm is well satisfied with the quality of service (QoS) requirements of all source and destination nodes. Furthermore, we compare the performance on VMN failure and message delivery ratio using hierarchical and non-hierarchical routing approaches, the results show that we can obtain magnitude better performance by HRA-VMN than hierarchical state routing (HSR) and non-hierarchical routing approach. Copyright © 2016 Inderscience Enterprises Ltd.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Deadline-oriented task scheduling for mapreduce environments 15th

Deadline-oriented task scheduling for mapreduce environments

引用

15th International Conference on Algorithms and Architectures for parallel processing, ICA3PP 2015

作者： Hu, Minghao Wang, Changjian You, Pengfei Huang, Zhen Peng, Yuxing National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha410072 China

ISBN: (纸本)9783319271217

To provide timely results for ‘Big Data Analytics’, it is crucial to satisfy deadline requirements for MapReduce jobs in production environments. In this paper, we propose a deadline-oriented task scheduling approach, named Dart, to meet the given deadline and maximize the input size if only part of the dataset can be processed before the time limit. Dart uses an iterative estimation method which is based on both historical data and job running status to precisely estimate the realtime job completion time. By comparing the estimated time with the deadline constraint, a YARN-based task scheduler dynamically decides whether continuing or terminating the map *** have validated our approach using workloads from OpenCloud and Facebook on a cluster of 60 virtual machines. The results show that Dart can not only effectively meet the deadline but also process near-maximal data volumes even when the deadline is set to be extremely small and limited resources are allocated. © Springer International Publishing Switzerland 2015.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Partial clones for stragglers in MapReduce

Partial clones for stragglers in MapReduce

引用

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

作者： Li, Jia Wang, Changjian Li, Dongsheng Huang, Zhen National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9783662462478

Stragglers can temporize jobs and reduce cluster efficiency seriously. Many researches have been contributed to the solution, such as Blacklist[8], speculative execution[1, 6], Dolly[8]. In this paper, we put forward a new approach for mitigating stragglers in MapReduce, name Hummer. It starts task clones only for high-risk delaying tasks. Related experiments have been carried and results show that it can decrease the job delaying risk with fewer resources consumption. For small jobs, Hummer also improves job completion time by 48% and 10% compared to LATE and Dolly. © Springer-Verlag Berlin Heidelberg 2015.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：