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

5th Asia-Pacific Symposium on Internetware, Internetware 2013

作者： Yu, Yue Wang, Huaimin Yin, Gang Liu, Bo School of Computer Science National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781450323697

The Internetware" paradigm is fundamentally changing the traditional way of software development. More and more software projects are developed, maintained and shared on the Internet. However, a large quantity of heterogeneous software resources have not been organized in a reasonable and efficient way. Software feature is an ideal material to characterize software resources. The effectiveness of feature- related tasks will be greatly improved, if a multi-grained feature repository is available. In this paper, we propose a novel approach for organizing, analyzing and recommend- ing software features. Firstly, we construct a Hierarchical rEpository of Software feAture (HESA). Then, we mine the hidden affnities among the features and recommend relevant and high-quality features to stakeholders based on HESA. Finally, we conduct a user study to evaluate our approach quantitatively. The results show that HESA can organize software features in a more reasonable way compared to the traditional and the state-of-the-art approaches. The result of feature recommendation is effective and interesting. Categories and Subject Descriptors D.2.9 [Software Engineering]: Mining Software Reposi- tory;H.3.3 [Information Storage and retrieval]: Fea- ture Model, Clustering, Query formulation General Terms Algorithms, Human Factors.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

HESA: The construction and evaluation of hierarchical software feature repository 25

HESA: The construction and evaluation of hierarchical softwa...

引用

25th International Conference on Software Engineering and Knowledge Engineering, SEKE 2013

作者： Yu, Yue Wang, Huaimin Yin, Gang Li, Xiang Yang, Cheng National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)1891706330

Nowadays, the demand for software resources on different granularity is becoming prominent in software engineering field. However, a large quantity of heterogeneous software resources have not been organized in a reasonable and efficient way. Software features, a kind of important knowledge for software reuse, are ideal materials to characterize software resources. Our preliminary study shows that the effectiveness of feature-related tasks, such as software resource retrieval and feature location, will be greatly improved, if a multi-grained feature repository is available. In this paper, we construct a Hierarchical rEpository of Software feAture (HESA), in which a novel hierarchical clustering approach is proposed. For a given domain, we first aggregate a large number of feature descriptions from multiple online software repositories. Then we cluster these descriptions into a flexible hierarchy by mining their hidden semantic structures. Finally, we implement an online search engine on HESA and conduct a user study to evaluate our approach quantitatively. The results show that HESA can organize software features in a more reasonable way compared to the classic and the state-of-the-art approaches. Copyright © 2013 by Knowledge Systems Institute Graduate school.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

An integration framework of cloud computing with wireless sensor networks

An integration framework of cloud computing with wireless se...

引用

7th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2012

作者： You, Pengfei Li, Huiba Peng, Yuxing Li, Ziyang National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology 410073 Changsha China

ISBN: (纸本)9789400758568

Wireless sensor networks (WSN) is a key technology extensively applied in many fields, such as transportation, health-care and environment monitoring. Despite rapid development, the exponentially increasing data emanating from WSN is not efficiently stored and used. Besides, the data from multiple different types and locations of WSN needs to be well analyzed, fused and supplied to various types of clients, such as PC, workstation and smart phone. The emerging cloud computing technology provides scalable data process and storage power and some types of connectable services, which can helpfully utilize sensor data from WSN. In this paper, we propose an integration framework of cloud computing with WSN, in which sensor data is transmitted from WSN to cloud, and processed and stored in cloud, then mined and analyzed so as to be supplied to various clients. By applying virtualization and cloud storage technology, and Infrastructure as a Service (IaaS) and Software as a Service (SaaS) of cloud service model, the framework can fully process and store mass sensor data from multiple types of WSN. Besides, it efficiently mines and analyzes sensor data, based on which the data applications are well supplied to various types of clients in form of services. © 2013 Springer science+Business Media.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation with Dynamic Substrate Network in Data Centre Networks

引用

China Communications 2013年第9期10卷 130-142页

作者：李小玲王怀民丁博李小勇刘惠 National Key Laboratory for Parallel and Distributed Processing School of Computer ScienceNational University of Defense Technology

The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud *** studies consider the dynamic arrival and departure of the workloads,while the dynamics of the substrate are *** this paper,we first propose the resource allocation with the dynamic SN,and denote it as ***,we propose an efficient mapping algorithm for *** performance of the proposed algorithm is evaluated by performing simulation *** results show that the proposed algorithm can effectively solve the GraphMap-DS.

关键词： resource allocation data centrenetwork workload substrate algorithm

来源：评论

学校读者我要写书评

暂无评论

Realization and optimization DGEMM on ARMv8 64-bit multi-core processor

引用

Dongbei Daxue Xuebao/Journal of Northeastern University 2014年 35卷 37-43页

作者： Jiang, Hao Wang, Feng Zuo, Ke Li, Kuan Yang, Can-Qun College of Computer Science National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

The double-precision matrix-matrix multiplication (DGEMM) on ARMv8 64-bit multi-core processor architecture was realized and optimized, and the optimal model for the purpose of maximizing the compute-to-memory access ratio was built to design DGEMM kernel. The ARM 64-bit memory accessing instruction, Cache pre-fetching instruction and NEON vector FMA instruction were utilized through instruction reordering and loop unrolling to construct the kernel assembly codes. The blocking and packing algorithms and parallel methods from GotoBLAS (OpenBLAS) were chosen, and the results showed that the floating-point peak efficiency can achieve 82% with one thread and 80% with eight threads, respectively. As the fastest DGEMM implementation on ARMv8 64-bit processor, it improves the peak performance by 8.3% and 16.7% compared to ATLAS. ©, 2014, Northeastern University. All right reserved.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Detecting null dereference with a game

引用

2012 International Conference on Information technology and Software Engineering, ITSE 2012

作者： Chen, Jie National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology 410073 Changsha China

ISBN: (纸本)9783642345302

As one of the most dangerous and common software vulnerabilities, null dereference often leads to program crashes. In this chapter we propose a human computation method to detect null dereference in a "frog and bug" game. The purpose of the game is to utilize the rich distributed human resource to do the complex science work in a simple and pleasant way. Programs are transformed into visual puzzles first, and then the server collects information from the people playing the game. Finally the recorded metadata is translated back into the positions in the programs where null dereference may happen. The game has shown to be effective. © 2013 Springer-Verlag.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant Lu factorization in transactional memory system

Fault tolerant Lu factorization in transactional memory syst...

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

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

ISBN: (纸本)9781479916603

With the popularization of multi-core processors, transaction memory, as a concurrent control mechanism with easy programing and high scalability, has attracted more and more attention. As a result, the reliability problems of transactional memory become a concerning issue. This paper addresses a transactional implementation of the Lu benchmark of SPLASH-2, and proposes a fault-tolerant Lu algorithm for this transactionalize Lu algorithm. The fault-tolerant Lu uses the data-versioning mechanism of the transactional memory system, detects errors based on transactions and recovers the error by rolling back the error transaction. The experiments show that the fault-tolerant Lu can get a better fault tolerance effect under a smaller cost. © 2013 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Continuous probabilistic reverse skyline monitoring over uncertain data streams

Continuous probabilistic reverse skyline monitoring over unc...

引用

2013 International Conference on Vehicle and Mechanical Engineering and Information technology, VMEIT 2013

作者： Yang, Yong Tao Wang, Yi Jie Guo, Min Li, Xiao Yong National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9783037858202

Reverse skyline is useful for supporting many applications, such as marketing decision, environmental monitoring. Since the uncertainty of data is inherent in many scenarios, there is a need for processing probabilistic reverse skyline queries. In this paper, we study the problem of efficiently processing these queries on uncertain data streams. We first show the formal definitions of reverse skyline probability and probabilistic reverse skyline. Then we propose a new algorithm called CPRS to maintain the most recent N uncertain data elements and to process continuous queries on them. CPRS is based on R-tree, and efficient pruning techniques, one of which is based on a new structure named Characteristic Rectangle, are incorporated into it to handling the extra computing complexity arising from the uncertainty of data. Finally, extensive experiments demonstrate that our techniques are very efficient in handling uncertain data streams. © (2013) Trans Tech Publications, Switzerland.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Tree-Structured parallel Regeneration for Multiple Data Losses in distributed Storage Systems Based on Erasure Codes

引用

China Communications 2013年第4期10卷 113-125页

作者：孙伟东王意洁裴晓强 National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology

To reduce the time required to complete the regeneration process of erasure codes, we propose a Tree-structured parallel Regeneration (TPR) scheme for multiple data losses in distributed storage systems. Under the scheme, two algorithms are proposed for the construction of multiple regeneration trees, namely the edge-disjoint algorithm and edge-sharing algorithm. The edge-disjoint algorithm constructs multiple independent trees, and is simple and appropriate for environments where newcomers and their providers are distributed over a large area and have few intersections. The edge-sharing algorithm constructs multiple trees that compete to utilize the bandwidth, and make a better utilization of the bandwidth, although it needs to measure the available band-width and deal with the bandwidth changes; it is therefore difficult to implement in practical systems. The parallel regeneration for multiple data losses of TPR primarily includes two optimizations: firstly, transferring the data through the bandwidth optimized-paths in a pipe-line manner; secondly, executing data regeneration over multiple trees in parallel. To evaluate the proposal, we implement an event-based simulator and make a detailed comparison with some popular regeneration methods. The quantitative comparison results show that the use of TPR employing either the edge-disjoint algorithm or edge-sharing algorithm reduces the regeneration time significantly.

关键词： distributed storage system erasure code replication regeneration tree

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：