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

International Conference on Information Science and Technology (ICIST)

作者： Yong Lu Shaohe Lv Xiaodong Wang Xingming Zhou National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha Hunan China

Traditional wireless relay networks have large end-to-end time delay and low throughput because of the limit that it can't receive and forward at the same time. In this paper, we proposed IWFR: Immediate Wireless Full-Duplex Relay which exploits the advantages of full-duplex to shorten the end-to-end time delay and improve the throughput. At the same time, we designed a new implicit acknowledgement mechanism, which can eliminate the ACK overheads and evidently improve the throughput of the relay. To implement IWFR, we also modified the full-duplex node architecture to make it support for immediate relay. Simulation shows that IWFR shortens the end-to-end time delay by 60% on average and improves the throughput to 240% of the original relay.

关键词： Wireless communication Throughput Delay effects Wireless sensor networks Interference Relay networks (telecommunications)

来源：评论

学校读者我要写书评

暂无评论

DLSM: Decoupled Live Storage Migration with distributed Device Mapper Storage

DLSM: Decoupled Live Storage Migration with Distributed Devi...

引用

2014 IEEE 8th International Symposium on Service Oriented System Engineering

作者： Zhaoning Zhang Ziyang Li Kui Wu Huiba Li Yuxing Peng Xicheng Lu National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology China University of Victoria Victoria BC CA

As a key technique in cloud computing, live virtual machine (VM) migration makes cloud computing elastic and renders more efficient resource scheduling. In many cases, live storage migration is also desirable. Compared to live VM migration, however, live storage migration is relatively slow. The speed gap between live VM migration and live storage migration may lead to poor Quality of Service (QoS) for cloud users. In this paper, we present a new resource migration scheme, called Decoupled Live Storage Migration (DLSM), which decouples the live storage migration from the live VM migration. DLSM can migrate the VM immediately, while data blocks actually required by the VM are moved on demand at later times. It achieves the on-demand data migration at the storage level without the need of modifying the hypervisor. The key contribution of DLSM is that it reduces the network traffic and speeds up the live storage migration, by completely eliminating iterative copy of dirty data over the network. This good property is achieved without relying on any tracking mechanism for dirty data blocks. Experimental evaluation demonstrates the efficiency and effectiveness of DLSM.

关键词： Data transfer Switches Virtual machine monitors Convergence Linux Kernel Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Hierarchical categorization of open source software by online profiles

Hierarchical categorization of open source software by onlin...

引用

作者： Wang, Tao Wang, Huaimin Yin, Gang Yang, Cheng Li, Xiang Zou, Peng Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China Department of Computer Science University of Western Ontario London ON N6A 5B7 Canada Academy of Equipment Beijing 100000 China

The large amounts of freely available open source software over the Internet are fundamentally changing the traditional paradigms of software development. Efficient categorization of the massive projects for retrieving relevant software is of vital importance for Internet-based software development such as solution searching, best practices learning and so on. Many previous works have been conducted on software categorization by mining source code or byte code, but were verified on only relatively small collections of projects with coarse-grained categories or clusters. However, Internet-based software development requires finer-grained, more scalable and language-independent categorization approaches. In this paper, we propose a novel approach to hierarchically categorize software projects based on their online profiles. We design a SVMbased categorization framework and adopt a weighted combination strategy to aggregate different types of profile attributes from multiple repositories. Different basic classification algorithms and feature selection techniques are employed and compared. Extensive experiments are carried out on more than 21,000 projects across five repositories. The results show that our approach achieves significant improvements by using weighted combination. Compared to the previous work, our approach presents competitive results with more finer-grained and multi-layered category hierarchy with more than 120 categories. Unlike approaches that use source code or byte code, our approach is more effective for large-scale and languageindependent software categorization. In addition, experiments suggest that hierarchical categorization combined with general keyword-based searching improves the retrieval efficiency and accuracy. Copyright © 2014 The Institute of Electronics, Information and Communication Engineers.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

DKNNS:Scalable and accurate distributed K nearest neighbor search for latency-sensitive applications

引用

Science China(Information Sciences) 2013年第3期56卷 123-139页

作者： FU YongQuan WANG YiJie National Key Laboratory for Parallel and Distributed Processing School of Computer ScienceNational University of Defense Technology

To reduce the access latencies of end hosts,latency-sensitive applications need to choose suitably close service machines to answer the access requests from end *** K nearest neighbor search locates K service machines closest to end hosts,which can efficiently optimize the access latencies for end *** work has weakness in terms of the accuracy and *** to the scalable and accurate K nearest neighbor search problem,we propose a distributed K nearest neighbor search method called DKNNS in this *** machines are organized into a locality-aware multilevel *** first locates a service machine that starts the search process based on a farthest neighbor search scheme,then discovers K nearest service machines based on a backtracking approach within the proximity region containing the target in the latency *** analysis,simulation results and deployment experiments on the PlanetLab show that,DKNNS can determine K approximately optimal service machines,with modest completion time and query ***,DKNNS is also quite stable that can be used for reducing frequent searches by caching found nearest neighbors.

关键词： latency sensitive network applications K nearest neighbor search network coordinate

来源：评论

学校读者我要写书评

暂无评论

A Discrete Data Dividing Approach for Erasure-Code-Based Storage Applications

A Discrete Data Dividing Approach for Erasure-Code-Based Sto...

引用

2014 IEEE 8th International Symposium on Service Oriented System Engineering

作者： Weidong Sun Yijie Wang Yongquan Fu Xiaoqiang Pei Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Hunan P. R. China

Erasure codes are promising for improving the reliability of the storage system due to its space efficiency compared to the replication methods. Traditional erasure codes split data into equalsized data blocks and encode strips in different data blocks. This brings heavy repairing traffic when clients read parts of the data, since most strips read for repairing are not in the expected blocks. This paper proposes a novel discrete data dividing method to completely avoid this problem. The key idea is to encode strips from the same data block. We could see that for repairing failed blocks, the strips to be read are either in the same data block with corrupted strips or from the encoded strips. Therefore, no data is wasted. We design and implement this data layout into a HDFS-like storage system. Experiments over a small-scale testbed shows that the proposed discrete data divided method avoids downloading data blocks that are not needed for clients during the repairing operations.

关键词： Strips Decoding Encoding distributed databases Writing Reliability Magnetic heads

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel implementation of morphological operation on GPU and FPGA

Efficient parallel implementation of morphological operation...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Teng Li Yong Dou Jingfei Jiang Jing Gao National Laboratory for Parallel & Distributed Processing National University of Defense and Technology Changsha China Information Management Department AIR CHINA LIMITED Beijing China

Morphological operation constitutes one of a powerful and versatile image and video applications applied to a wide range of domains, from object recognition, to feature extraction and to moving objects detection in computer vision where real-time and high-performance are required. However, the throughput of morphological operation is constrained by the convolutional characteristic. In this paper, we analysis the parallelism of morphological operation and parallel implementations on the graphics processing unit (GPU), and field programming gate array (FPGA) are presented. For GPU platform, we propose the optimized schemes based on global memory, texture memory and shared memory, achieving the throughput of 942.63 Mbps with 3×3 structuring element. For FPGA platform, we present an optimized method based on the traditional delay-line architecture. For 3×3 structuring element, it achieves a throughput of 462.64 Mbps.

关键词： Graphics processing units Morphological operations Field programmable gate arrays Throughput Optimization Instruction sets Random access memory

来源：评论

学校读者我要写书评

暂无评论

Flexible Virtual Channel Power-Gating for High-Throughput and Low-Power Network-on-Chip

Flexible Virtual Channel Power-Gating for High-Throughput an...

引用

Euromicro Symposium on Digital System Design

作者： Feng Wang Xiantuo Tang Qinglin Wang Zuocheng Xing Hengzhu Liu Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Hunan P. R. China

Power-gating is a representative circuit level technique to mitigate leakage power. While in low-power Network-on-Chip (NoC) design, the former fine-grained power-gating methods will decrease network performance due to serial wake-up latency and head-of-line blocking. Therefore, we propose a flexible Virtual Channel (VC) management scheme for fine-grained power-gating to achieve high throughput and low-power. The proposed power-gating method with the early wake-up is evaluated by using some synthetic workloads. When compared with an optimized early wake-up power-gating technique, it can improve performance effectively in medium and high network loads, and increases the network throughput by 15.7%~44.1% for different synthetic loads, while keeps network power consumption as low as the optimized method. For the PARSEC application traces of token based protocol, it can significantly decrease packet latency by 20.3% on average, however only increases less than 3.6% peak power when compared with the optimized method.

关键词： Throughput Radiation detectors Routing Process control Pipelines Power demand Ports (Computers)

来源：评论

学校读者我要写书评

暂无评论

Synchronization Error Detection of MPI Programs by Symbolic Execution

Synchronization Error Detection of MPI Programs by Symbolic ...

引用

Asia-Pacific Conference on Software Engineering

作者： Xianjin Fu Zhenbang Chen Chun Huang Wei Dong Ji Wang College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9781479974276

Asynchrony based overlapping of computation and communication is commonly used in MPI applications. However, this overlapping introduces synchronization errors frequently in asynchronous MPI programming. In this paper, we propose a symbolic execution based method for detecting input-related synchronization errors. The path space of an MPI program is systematically explored, and the related operations of the synchronization errors in the program are checked specifically. In addition, two optimizations are proposed to improve the efficiency. We have implemented our method as a prototype tool based on the symbolic executor Cloud9. The results of the extensive experiments indicate the effectiveness of our method.

关键词： Synchronization Data communication Libraries Optimization Buffer storage Prototypes Schedules

来源：评论

学校读者我要写书评

暂无评论

Accuracy evaluation of deep belief networks with fixed-point arithmetic

引用

Computer Modelling and New Technologies 2014年第6期18卷 7-14页

作者： Jiang, Jingfei Hu, Rongdong Mikel, Lujan Dou, Yong Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology ChangSha Hunan China University of Manchester Manchester United Kingdom

Deep Belief Networks (DBNs) are state-of-art Machine Learning techniques and one of the most important unsupervised learning algorithms. Training DBNs is computationally intensive which naturally leads to investigate FPGA acceleration. Fixed-point arithmetic can be used when implementing DBNs in FPGAs to reduce execution time, but it is not clear the implications for accuracy. Previous studies have focused only on accelerators using some fixed bit-widths. A contribution of this paper is to demonstrate the bit-width effect on various configurations of DBNs in a comprehensive way by experimental evaluation. Explicit performance changing points are found using various bit-widths. The impact of sigmoid function approximation, required part of DBNs, is evaluated. A solution of mixed bit-widths DBN is proposed, fitting the bit-widths of FPGA primitives and gaining similar performance to the software implementation. Our results provide a guide to inform the design choices on bit-widths when implementing DBNs in FPGAs documenting clearly the trade-off in accuracy.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Automatic Detecting Performance Bugs in Cloud Computing Systems via Learning Latency Specification Model

Automatic Detecting Performance Bugs in Cloud Computing Syst...

引用

2014 IEEE 8th International Symposium on Service Oriented System Engineering

作者： Haibo Mi Huaimin Wang Zhenbang Chen Yangfan Zhou Science and Technology on Parallel & Distributed Processing Laboratory National Univ. of Defense Technology Shenzhen Research Institute The Chinese Univ. of Hong Kong

Performance bugs that don't cause fail-stop errors but degradation of system performance have been one of the most fundamental issues in the production platform. How to effectively online detect bugs becomes more and more urgent for engineers. Performance bugs usually manifest themselves as the anomalous call structures of request traces or anomalous latencies of invoked methods. In this paper, we propose an automatic performance bug online detecting approach, CloudDoc. CloudDoc maintains a performance model mined from execution traces that are collected in the normal period. The performance model captures the characteristics of call structures of request traces together with corresponding latencies. With the performance model, CloudDoc periodically detects whether performance bugs occur or not. All suspicious call structures or latency-abnormal invoked methods are presented to engineers. We report two case studies to demonstrate the effectiveness of CloudDoc in helping engineers identify performance bugs.

关键词： Computer bugs Computational modeling Cloud computing Electronic mail Merging System performance Servers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：