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

Proceedings of the 20th international conference companion on World wide web

作者： Tang, Jintao Wang, Ting Wang, Ji Lu, Qin Li, Wenjie School of Computer National University of Defense Technology Changsha China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong National Laboratory for Parallel and Distributed Processing Changsha China

ISBN: (纸本)9781450305181

Applying graph clustering algorithms in real world networks needs to overcome two main challenges: the lack of prior knowledge and the scalability issue. This paper proposes a novel method based on the topological features of complex networks to optimize the clustering algorithms in real-world networks. More specifically, the features are used for parameter estimation and performance optimization. The proposed method is evaluated on real-world networks extracted from the web. Experimental results show improvement both in terms of Adjusted Rand index values as well as runtime efficiency. © 2011 Authors.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

A unique vertex deleting algorithm for graph isomorphism

A unique vertex deleting algorithm for graph isomorphism

引用

2011 International Symposium on Image and Data Fusion, ISIDF 2011

作者： Zhang, Baida Tang, Yuhua Wu, Junjie Huang, Linqi National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 China School of Resources and Safety Engineering Central South University Changsha 410083 China

ISBN: (纸本)9781457709692

Graph isomorphism problem has applications in many fields, such as chemistry, computer science, electronics, and network theory. But the exponential complexity of the algorithm makes the testing is time consuming. In this paper, a new algorithm named Unique Vertex Delete (UVD for short) is presented to speed up the process of isomorphic testing. The main idea of UVD algorithm is deleting vertex continuously to reduce the scale of the problem, and new field is added for each vertex to indicate the information of deleted neighbor vertices. Theoretical analysis and experiments show that the UVD algorithm consistently and significantly outperforms existing state-of-the-art approaches. © 2011 IEEE.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

不确定Skyline查询技术研究

不确定Skyline查询技术研究

引用

第29届中国数据库学术会议

作者： Wang Yijie 王意洁 Li Xiaoyong 李小勇 Yang Yongtao 杨永滔 Qi Yafei 祁亚斐 Wang Guangdong 王广东 National Key Laboratory for Parallel and Distributed Processing College of Computer National Unive 国防科学技术大学计算机学院并行与分布处理国家重点实验室长沙 410073

当前不确定数据广泛存在于诸如传感器网络、RFID网络、基于位置服务、移动对象管理网上购物和市场监控等各种实际应用中。不确定Skyline查询作为不确定数据管理的一个重要方面，由于其在决策制定、市场分析、环境监控和数据挖掘等方面... 详细信息

当前不确定数据广泛存在于诸如传感器网络、RFID网络、基于位置服务、移动对象管理网上购物和市场监控等各种实际应用中。不确定Skyline查询作为不确定数据管理的一个重要方面，由于其在决策制定、市场分析、环境监控和数据挖掘等方面的重要作用，近年来在数据库和网络计算领域受到广泛关注。首先，概述了各种不确定数据类型上的Skyline查询定义，包括离散、连续概率分布模型以及不完全数据上的Skyline查询定义;其次，分析了不确定Skyline查询的特点，并在此基础上综述了现有的各种不确定数据集上的集中式和分布式Skyline查询方法，重点分析了各种算法的原理和优缺点;再次，介绍了不确定数据流上的Skyline查询定义并综述了各种不确定数据流上的Skyline查询方法;最后，基于最新研究动态指出了未来不确定Skyline查询研究的趋势。

关键词：数据查询不确定数据分布式技术

来源：评论

学校读者我要写书评

暂无评论

基于移动云计算的大规模上下文流处理框架研究

基于移动云计算的大规模上下文流处理框架研究

引用

第九届中国通信学会学术年会

作者： XIAO You 肖友 SHI Dian-xi 史殿习 National Key Laboratory for Parallel and Distributed Processing School of Computer ScienceNational 国防科技大学计算机学院并行与分布处理国家重点实验室长沙410073

随着移动云计算的兴起，有关于大规模移动设备上下文信息处理的研究成为了热点。目前比较流行的解决方案是采用基于MapReduce计算模型的Hadoop框架，它虽能解决大规模数据处理的吞吐量问题但是却不能很好的解决数据处理的时效问题。因... 详细信息

随着移动云计算的兴起，有关于大规模移动设备上下文信息处理的研究成为了热点。目前比较流行的解决方案是采用基于MapReduce计算模型的Hadoop框架，它虽能解决大规模数据处理的吞吐量问题但是却不能很好的解决数据处理的时效问题。因此，本文针对存在的问题，提出了移动云计算与流处理技术相结合的解决方案，并构建与实现了一个实时处理大规模上下文的流处理框架。最后通过此框架对本文的研究内容进行了验证，且以一个道路实况监测的实例验证了框架的可行性及有效性。

关键词：移动云计算上下文信息流处理框架可行性分析

来源：评论

学校读者我要写书评

暂无评论

Component model supporting trustworthiness-oriented software evolution

引用

Ruan Jian Xue Bao/Journal of Software 2011年第1期22卷 17-27页

作者： Ding, Bo Wang, Huai-Min Shi, Dian-Xi Li, Xiao School of Computer National University of Defense Technology Changsha 410073 China National Defense Laboratory for Parallel and Distributed Processing Changsha 410073 China

Environment-Driven adaptation is an important means ensuring software integrity. Confronted with scenarios not anticipated during the developmental stage, the predefined adaptability of the software should be adjusted to ensure that its behavior agree with the users' expectation. The premise of this kind of adjustment are efficient software engineering mechanisms. Based on the principles of the Separation of Concerns and the Dynamic Software Architecture (DSA) technology, this paper proposes a component model named ACOE (adaptive component model for open environment) that supports the online fine-grained adjustment to software adaptability. ACOE encapsulates adaptation concerns, such as sensing, decision, and execution into components, and connectors, and then supports their dynamic configuration with the DSA technology. As a result, a third-party can adjust the adaptability by selectively upgrading it when necessary. An ACOE container prototype and experimental applications are implemented to validate this approach. © Copyright 2011, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Communication-Aware Task Partition and Voltage Scaling for Energy Minimization on Heterogeneous parallel Systems

Communication-Aware Task Partition and Voltage Scaling for E...

引用

IEEE International Conference on parallel and distributed Computing, Applications and Technologies (PDCAT)

作者： Guibin Wang Wei Song National Laboratory for Parallel and Distributed Processing National University of Defense Technology China

Heterogeneous parallel systems have become popular in general purpose computing and even high performance computing fields. There are many studies focused on harnessing heterogeneous parallel processing for better performance. However the energy optimization for heterogeneous system has not been well studied. Owing to the differences in performance and energy consumption, the energy optimization technique for heterogeneous system is different from the existing methods designed for homogeneous system. Besides typical voltage scaling method, reasonable task partitioning is also an essential method for optimizing energy consumption on heterogeneous systems. Through partitioning a data parallel task and mapping sub-tasks onto several processors, one could achieve better performance and reduced energy consumption. As the computation cost reduces with specific accelerators, the communication overhead becomes more prominent. Therefore, the task partition optimization should holistically consider the computation improvement and communication overhead to achieve higher energy efficiency. Typically, task partition and voltage scaling are not orthogonal and influence the effect of each other in the energy optimization problem. In order to harness both two knobs efficiently, this paper proposes an integer linear programming (ILP) based energy-optimal solution designed for heterogeneous system. We present a case study of optimizing MGRID benchmark on a typical CPU-GPU heterogeneous system. The experimental results demonstrate that the proposed method could exploit the heterogeneity in different processors and achieve improved energy efficiency.

关键词： Graphics processing unit Energy consumption Power demand Optimization Kernel Schedules

来源：评论

学校读者我要写书评

暂无评论

Heterogeneity-Aware Peak Power Management for Accelerator-Based Systems

Heterogeneity-Aware Peak Power Management for Accelerator-Ba...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Guibin Wang Yisong Lin National Laboratory for Parallel and Distributed Processing National University of Defense Technology China

Power management has become one of the first-order considerations in high performance computing field. Many recent studies focus on optimizing the performance of a computer system within a given power budget. However, most existing solutions adopt fixed period control mechanism and are transparent to the running applications. Although the application-transparent control mechanism has relatively good portability, it exhibits low efficiency in accelerator-based heterogeneous parallel systems. In typical accelerator-based parallel systems, different processing units have largely different processing speeds and power consumption. Under a given power constraint, how to choose the processor to be slowed down and how to schedule a parallel task onto different processors for the maximum performance are different from those in homogeneous systems and have not been well studied. From the motivating example in this paper, we could find that in order to efficiently harness the heterogeneous parallel processing, one should not only perform dynamic voltage/frequency scaling (DVFS) to meet the power budget, but also tune the parallel task scheduling to adapt to the changes. In this paper, we propose a heterogeneity-aware peak power management, which extends existing application-transparent power controller with an application-aware power controller. Firstly, we theoretically analyze the conditions for the maximum performance given a power budget for heterogeneous systems. Based on this result, we provide a power-constrained parallel task partition algorithm, which coordinates parallel task partition and voltage scaling for heterogeneous processing units to achieve the optimal performance given a system power budget. Finally, we evaluate the proposed method on a typical CPU-GPU heterogeneous system, and validate the superiority of application-aware power controller over the existing method.

关键词： Graphics processing unit Power demand Partitioning algorithms Schedules Kernel Monitoring Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

基于物理轨迹数据和社会网络的泛化行程推荐

基于物理轨迹数据和社会网络的泛化行程推荐

引用

第六届中国传感器网络学术会议(CWSN 2012)

作者： MENG Xiang-Xu 孟祥旭 WANG Xiao-Dong 王晓东 ZHOU Xing-Ming 周兴铭 National Key Laboratory of Parallel and Distributed Processing(College of Computer Science National 并行与分布处理国家重点实验室(国防科学技术大学计算机学院) 湖南长沙410073

人类活动行程的制定往往基于宽泛的最初意向，通过综合考虑各种约束条件加以优化而完成。当前，基于位置点名称查找的行程制定方法，不支持用户一次性提交多个具有时序关系的宽泛出行意向，更不能同时为多个地理位置点提供详细的最优驾... 详细信息

人类活动行程的制定往往基于宽泛的最初意向，通过综合考虑各种约束条件加以优化而完成。当前，基于位置点名称查找的行程制定方法，不支持用户一次性提交多个具有时序关系的宽泛出行意向，更不能同时为多个地理位置点提供详细的最优驾车方案。基于位置社交网络信息和车辆历史轨迹数据，探索了支持用户多个模糊意向输入的泛化行程推荐框架，主要工作包括：(1)对泛化的行程推荐问题进行建模;(2)设计并实现了基于分类树的地理位置点(POI)查询策略和算法;(3)提出了基于Voronoi图的GPS轨迹分析模型，并实现了任意两个位置点间最优行驶路径计算方法;(4)联合社会网络和语义交通信息图，基于蚁群算法进行行程的推荐，并实现了原型系统。实验及问卷调查结果表明，推荐结果的用户满意度可达80％。

关键词：行程规划泛化模型优化设计物理轨迹数据社会网络

来源：评论

学校读者我要写书评

暂无评论

LoGPX: A new communication model for message-passing programs

LoGPX: A new communication model for message-passing program...

引用

International Symposium on Performance Evaluation of Computer & Telecommunication Systems SPECTS

作者： Yufei Lin Yuhua Tang Xiaowei Guo Xinhai Xu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

Message Passing Interface (MPI) is a de facto standard for writing high-performance message-passing applications on distributed memory systems. To design effective applications and predict the performance of future systems, an accurate communication model is needed. In this paper, we discuss the characteristics of current systems and MPI implementations, then propose a more complete communication model, named LoGPX, which synthetically captures the influences of MPI communication protocol, the invoking time of communication primitive, hardware resource and network contention. Based on the model, we obtain the condition that the message transmission cost reaches the infimum, and we show that if ignoring some factors of LoGPX model, it can be degenerated to several popular models such as LogP, LogGP, LoGPC and LogGPO.

关键词： Protocols Receivers Message passing Network interfaces Hardware Analytical models Routing

来源：评论

学校读者我要写书评

暂无评论

BIIP:Application Behavior-Aware Insertion Policies for Managing Shared Cache in CMPs

BIIP:Application Behavior-Aware Insertion Policies for Manag...

引用

2011 International Conference on Computers, Communications, Control and Automation

作者： Xiaomin Jia Ping Huang Tianlei Zhao Shubo Qi Guitao Fu Minxuan Zhang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology

Conventional replacement policy LRU(Least Recently Used) can significantly degrade the overall performance of shared cache of Chip Multi-Processors(CMPs), when the aggregate working set of multiple co-scheduled applications can not fit in cache. Different applications have different inherent cache access behavior characteristics. Replacement policy should take into account that fact so as to derive more performance benefit. This paper proposes application cache Behavior Identification based Insertion Policy(BIIP)replacement policies for managing shared cache in CMPs. BIIP seeks to make use of the cache access behavior characteristics of each co-scheduled application to smartly choose replacement policy. Our evaluation using a full system CMP simulator shows that BIIP improves the overall throughput by 14.8%,11.2%, 5.6% and 7.2% on average over baseline LRU policy,the prevailing cache partitioning scheme UCP and two other shared cache replacement policies PIPP, TADIP, respectively on a 4-core CMP with 16 SPEC CPU2006 workloads. Moreover,BIIP requires a total storage overhead of no more than several counters per core, and does not require changes to the current cache structure.

关键词： chip multi-processors(CMPs),application cache behaviors,last-level caches(LLC),insertion,replacement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：