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

International Conference on Networking, Architecture, and Storage (NAS)

作者： Zhaoning Zhang Kui Wu Huiba Li Jinghua Feng Yuxing Peng Xicheng Lu National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology China Computer Science Department University of Victoria B.C. Canada National Super Computing Center Tianjin China

Virtualization is the foundation for cloud computing, and the virtualization can not be achieved without software defined, elastic, flexible and scalable virtual layers. Unfortunately, if multiple virtual storage devices are chained together, the system may be subject to severe performance degradation. While the read-ahead (RA) mechanism in storage devices plays a very important role to improve I/O performance, RA may not be effective as expected for multiple virtualization layers, since it is originally designed for one layer only. When I/O requests are passed through a long I/O path, they may trigger a chain reaction and lead to unnecessary data transmission and thus bandwidth waste. In this paper, we study the dynamic behavior of RA through multiple I/O layers and demonstrate that if controlled well, RA can greatly accelerate I/O speed. We present RAFlow, a RA control mechanism, to effectively improve I/O performance by strategically expanding RA window at each layer. Our real-world experiments show that it can achieve 20% to 50% performance improvement in I/O paths with up to 8 virtualized storage devices.

关键词： Radio access networks Acceleration distributed databases Performance evaluation Synchronization Benchmark testing Degradation

来源：评论

学校读者我要写书评

暂无评论

Power and performance analysis of the Graph 500 benchmark on the Single-chip Cloud Computer

Power and performance analysis of the Graph 500 benchmark on...

引用

International Conference on Cloud Computing and Internet of Things (CCIOT)

作者： Zhiquan Lai King Tin Lam Cho-Li Wang Jinshu Su College of Computer National University of Defense Technology Changsha China Department of Computer Science The University of Hong Kong Hong Kong China National Key Laboratory of Parallel and Distributed Processing (PDL) Changsha China

ISBN: (纸本)9781479947638

The concerns of data-intensiveness and energy awareness are actively reshaping the design of high-performance computing (HPC) systems nowadays. The Graph500 is a widely adopted benchmark for evaluating the performance of computing systems for data-intensive workloads. In this paper, we introduce a data-parallel implementation of Graph500 on the Intel Single-chip Cloud Computer (SCC). The SCC features a non-coherent many-core architecture and multi-domain on-chip DVFS support for dynamic power management. With our custom-made shared virtual memory programming library, memory sharing among threads is done efficiently via the shared physical memory (SPM) while the library has taken care of the coherence. We conduct an in-depth study on the power and performance characteristics of the Graph500 workloads running on this system with varying system scales and power states. Our experimental results are insightful for the design of energy-efficient many-core systems for data-intensive applications.

关键词： Kernel Benchmark testing Computer architecture Programming Power measurement Computational modeling Runtime

来源：评论

学校读者我要写书评

暂无评论

Effective hierarchical routing algorithm for large-scale wireless mobile networks

引用

Journal of Networks 2014年第2期9卷 344-352页

作者： Yan, Guofeng Peng, Yuxing Hu, Ying Liu, Junyi School of Computer and Communication Hunan Institute of Engineering Hunan 411104 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China School of Computer National University of Defense Technology Changsha 410073 China

The growing interest in wireless mobile network techniques has resulted in many routing protocol proposals. The unpredictable motion and the unreliable behavior of mobile nodes is one of the key issues in wireless mobile network. Virtual mobile node (VMN) consists of robust virtual nodes that are both predictable and reliable. Based on VMN, in this paper, we present a hierarchical routing algorithm, i.e., EHRA-WAVE, for large-scale wireless mobile networks. By using mobile WAVE technology, a routing path can be found rapidly between VMNs without accurate topology information. We introduce the routing algorithm and the implementation issues of the proposed EHRA-WAVE routing algorithm. Finally, we evaluate the performance of EHRA-WAVE through experiments, and compare the performance on VMN failure and message delivery ratio using hierarchical and non-hierarchical routing methods. However, due to the large amounts WAVE flooding, EHRA-WAVE results in too large load which would impede the application of the EHRA-WAVE algorithm. Therefore, the further routing protocol focuses on minimizing the number of WAVE using hierarchical structures in large-scale wireless mobile networks. © 2014 Academy Publisher.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Soft-Constrained Nonnegative Matrix Factorization via Normalization

Soft-Constrained Nonnegative Matrix Factorization via Normal...

引用

International Joint Conference on Neural Networks

作者： Long Lan Naiyang Guan Xiang Zhang Dacheng Tao Zhigang Luo Science and Technology on Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology Centre for Quantum Computation & Intelligent Systems and the Faculty of Engineering and Information Technology University of Technology

ISBN: (纸本)9781479914821

Semi-supervised clustering aims at boosting the clustering performance on unlabeled samples by using labels from a few labeled samples. Constrained NMF (CNMF) is one of the most significant semi-supervised clustering methods, and it factorizes the whole dataset by NMF and constrains those labeled samples from the same class to have identical encodings. In this paper, we propose a novel soft-constrained NMF (SCNMF) method by softening the hard constraint in CNMF. Particularly, SCNMF factorizes the whole dataset into two lower-dimensional factor matrices by using multiplicative update rule (MUR). To utilize the labels of labeled samples, SCNMF iteratively normalizes both factor matrices after updating them with MURs to make encodings of labeled samples close to their label vectors. It is therefore reasonable to believe that encodings of unlabeled samples are also close to their corresponding label vectors. Such strategy significantly boosts the clustering performance even when the labeled samples are rather limited, e.g., each class owns only a single labeled sample. Since the normalization procedure never increases the computational complexity of MUR, SCNMF is quite efficient and effective in practices. Experimental results on face image datasets illustrate both efficiency and effectiveness of SCNMF compared with both NMF and CNMF.

关键词： Matrix decomposition Encoding Vectors Clustering methods Clustering algorithms Time complexity Face

来源：评论

学校读者我要写书评

暂无评论

Box-constrained Projective Nonnegative Matrix Factorization via Augmented Lagrangian Method

Box-constrained Projective Nonnegative Matrix Factorization ...

引用

International Joint Conference on Neural Networks

作者： Xiang Zhang Naiyang Guan Long Lan Dacheng Tao Zhigang Luo Science and Technology on Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology Centre for Quantum Computation & Intelligent Systems and the Faculty of Engineering and Information Technology University of Technology

ISBN: (纸本)9781479914821

Projective non-negative matrix factorization (PNMF) projects a set of examples onto a subspace spanned by a non-negative basis whose transpose is regarded as the projection matrix. Since PNMF learns a natural parts-based representation, it has been successfully used in text mining and pattern recognition. However, it is non-trivial to analyze the convergence of the optimization algorithms for PNMF because its objective function is non-convex. In this paper, we propose a Box-constrained PNMF (BPNMF) method to overcome this deficiency of PNMF. In particular, BPNMF introduces an auxiliary variable, i.e., the coefficients of examples, and incorporates the following two types of constraints: 1) each entry of the basis is non-negative and upper-bounded, i.e., box-constrained, and 2) the coefficients equal to the projected points of the examples. The first box constraint makes the basis to be bound and the second equality constraint keeps its equivalence to PNMF. Similar to PNMF, BPNMF is difficult because the objective function is non-convex. To solve BPNMF, we developed an efficient algorithm in the frame of augmented Lagrangian multiplier (ALM) method and proved that the ALM-based algorithm converges to local minima. Experimental results on two face image datasets demonstrate the effectiveness of BPNMF compared with the representative methods.

关键词： Accuracy Linear programming Training Convergence Optimization Face Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Array receiving scheme for ultra-wideband WSN OFDM signals

引用

Ruan Jian Xue Bao/Journal of Software 2014年 25卷 30-38页

作者： Du, Xiao-Li Lü, Shao-He Wang, Xiao-Dong Zhou, Xing-Ming Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

This paper proposes an array receiving scheme for ultra-wideband (UWB) OFDM signals in WSN networks. The major feature of the proposed scheme is recovering the UWB OFDM signal by frequency stitching. Firstly, the UWB OFDM signal is divided into multiple sub-bands. Every two adjacent sub-bands share at least one overlapped subcarrier(s), which is used for time alignment later. A sub-signal of the UWB OFDM signal is received on each sub-band by a narrow-band receiver. The received data sets of narrow-band receivers are time aligned by performing peak value alignment retrieval (PVAR) on the shared subcarriers. Then the UWB OFDM signal is recovered by fusing the received data sets according to the result of PVAR. As the implementation of narrow-band receivers only needs low-speed ADCs, the challenge of high-speed ADC in traditional UWB OFDM receiver is addressed. Extensive simulations are performed to demonstrate the validity of the proposed scheme and further look into three performance metrics: (1) synchronization error-tolerance, (2) extensibility, (3) performance under different SNR values. ©2014 ISCAS.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

distributed Relation Discovery in Internet of Things

Distributed Relation Discovery in Internet of Things

引用

International Conference on Cloud Computing and Big Data (CCBD)

作者： Weiping Zhu Hongliang Lu Xiaohui Cui International School of Software Wuhan University China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology China Department of Computing Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9781479966226

Internet of things is an emerging technology that aims to connect various smart objects in our daily life. It facilitates the information exchange and control among objects. In the Internet of things, it is important to discover various relations among objects for analyzing and mining useful knowledge. Existing works on relation discovery mainly focus on centralized processing. It is not suitable for Internet of things due to unavailable of server, one-point failure, computation bottleneck, and security and business concerns. In this paper, we propose a distributed approach to discover the relations among objects in Internet of things. We first build the distritbuted system model which may include multiple relation discovery tasks. Based on that, we design an approach utilizing distributed spanning tree to extract the relations. Rather than sending all the information to the server, the objects only need to send the information to a local leader object in our algorithm. We also discuss more about how to improve the performance of the proposed approach and how to relax the system constraints. Extensive simulation have been done and the results show that the proposed approach outperforms existing approaches in terms of the data amount of transmission.

关键词： Internet of things Synchronization Buildings Servers Algorithm design and analysis Delays

来源：评论

学校读者我要写书评

暂无评论

A Runtime Verification Based Trace-Oriented Monitoring Framework for Cloud Systems

A Runtime Verification Based Trace-Oriented Monitoring Frame...

引用

IEEE International Conference on Software Reliability Engineering Workshops (ISSRE Wksp)

作者： Jingwen Zhou Zhenbang Chen Ji Wang Zibin Zheng Wei Dong 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 Shenzhen Research Institute The Chinese University of Hong Kong Shenzhen China

Cloud computing provides a new paradigm for resource utilization and sharing. However, the reliability problems, like system failures, often happen in cloud systems and bring enormous loss. Trace-oriented monitoring is an important runtime method to improve the reliability of cloud systems. In this paper, we propose to bring runtime verification into trace-oriented monitoring, to facilitate the specification of monitoring requirements and to improve the efficiency of monitoring cloud systems. Based on a data set collected from a cloud storage system in a real environment, we validate our approach by monitoring the critical properties of the storage system. The preliminary experimental results indicate the promise of our approach.

关键词： Monitoring Runtime Cloud computing Educational institutions Reliability Google Computers

来源：评论

学校读者我要写书评

暂无评论

Translation Non-negative Matrix Factorization with Fast Optimization

Translation Non-negative Matrix Factorization with Fast Opti...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Yuanyuan Wang Naiyang Guan Bin Mao Xuhui Huang Zhigang Luo Department of Basic Courses Army Officer Academy Science and Technology on Parallel and Distributed Processing Laboratory College of Computer Science National University of Defense Technology College of Science National University of Defense Technology College of Computer Science National University of Defense Technology

ISBN: (纸本)9781479938414

Non-negative matrix factorization (NMF) reconstructs the original samples in a lower dimensional space and has been widely used in pattern recognition and data mining because it usually yields sparse representation. Since NMF leads to unsatisfactory reconstruction for the datasets that contain translations of large magnitude, it is required to develop translation NMF (TNMF) to first remove the translation and then conduct a decomposition. However, existing multiplicative update rule based algorithm for TNMF is not efficient enough. In this paper, we reformulate TNMF and show that it can be efficiently solved by using the state-of-the-art solvers such as NeNMF. Experimental results on face image datasets confirm both efficiency and effectiveness of the reformulated TNMF.

关键词： Non-negative matrix factorization (NMF) Translation transformation NeNMF

来源：评论

学校读者我要写书评

暂无评论

Data storage optimization of application-level checkpointing on heterogeneous systems

Data storage optimization of application-level checkpointing...

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Jia, Jia Song, Wei National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781479916603

General purpose GPU's (GPGPU) appearance made it possible that heterogeneous computing can be used by human beings. And it's also produce a reform for GPU's general purpose computing and parallel computing. Heterogeneous Systems has been adopted by large-scale of high-performance computers. Nowadays, fault tolerance technique is necessary among these large-scale kinds of scientific computing, but in a few years of GPGPU and heterogeneous system appearance, there is not an effective fault tolerance method come out, therefore, towards this situation, this paper will apply the traditional fault tolerance technique - application-level checkpointing to heterogeneous system. Cause the main solution of reducing overhead of the application-level checkpointing is reducing checkpoint data size, so after analyzing the heterogeneous system and GPGPU program, we propose a method to optimize the data storage of application-level checkpointing technique and validate its optimization by experiments. © 2013 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：