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

IEEE Conference Anthology

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

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.

关键词： Fault tolerance Fault tolerant systems Hardware Software Computers Multicore processing

来源：评论

学校读者我要写书评

暂无评论

A novel anycast-based integrated routing protocol for wireless sensor networks: Design and implementation

引用

Journal of Computational Information Systems 2013年第21期9卷 8611-8618页

作者： Yan, Guofeng Peng, Yuxing Chen, Shuhong School of Computer and Communication Hunan Institute of Engineering 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 School of Information Science and Engineering Central South University Changsha 410083 China

In this paper, we consider novel anycast-based integrated routing protocol (AIRP) to reduce the cost in delay performance of communications in multihop WSNs. Without tight time synchronization or known geographic information, AIRP provides low-delay cost route. We implement a low-overhead AIRP module in TinyOS kernel by modifying BLIP protocol stack, i. e., the Berkeley Low-power IP stack;as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. We describe the format of AIRP message, the dynamic updating process of MAP table information, and anycast data flow in detail under TinyOS. And then, we present the anycast group management system. Finally, we show the performance of AIRP where AIRP communication is used to distribute load among a set of servers through a study case. © 2013 Binary Information Press.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Random Walk Based Inverse Influence Research in Online Social Networks

Random Walk Based Inverse Influence Research in Online Socia...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Zhaoyan Jin Quanyuan Wu Dianxi Shi Huining Yan National Key Laboratory for Parallel and Distributed Processing NUDT Changsha Hunan P.R.China

ISBN: (纸本)9781479909735

In online social networks, social influence of a user reflects his or her reputation or importance in the whole network or to a personalized user. Social influence analysis can be used in many real applications, such as link prediction, friend recommendation and personalized searching. Personalized Page Rank, which ranks nodes according to the probabilities that a random walk starting from a personalized node stops at all nodes, is one of the most popular metrics for influence analysis. In this paper, we study the problem of inverse influence in online social networks. Different from Personalized Page Rank, the inverse influence for a personalized node ranks nodes according to the probabilities that all nodes stop at the personalized node in limited steps. We propose two computation models for inverse influence, i.e., the random walk based and the path based. Both of the models have high computation complexity, and cannot be used in large graphs, so we propose a Monte Carlo based approximation algorithm. Experiments from synthetic and real world datasets show that, our algorithm has equivalent or even better accuracy than related researches in link prediction, and thus can be used in friend recommendation in online social networks.

关键词： Prediction algorithms Social network services Equations Mathematical model Accuracy Approximation algorithms Measurement

来源：评论

学校读者我要写书评

暂无评论

Device View Redundancy: an adaptive low-overhead fault tolerance mechanism for many-core system

Device View Redundancy: an adaptive low-overhead fault toler...

引用

International Workshop on Intelligent Communication and Social Networks

作者： Wentao Jia Chunyuan Zhang Jian Fu National Key Laboratory of Parallel and Distributed Processing College of Computer National University of Defense Technology Institute for Informatics University of Amsterdam

ISBN: (纸本)9781479909735

Continued increasing of fault rate in integrate circuit makes processors more susceptible to errors, especially many-core processor. Meanwhile, most systems or applications do not need full fault coverage, which has excessive overhead. So on-demand fault tolerance is desired for these applications. In this paper, we propose an adaptive low-overhead fault tolerance mechanism for many-core system, called Device View Redundancy (DVR). It treats fault tolerance as a device that can be configured and used by application when high reliability is needed. Nevertheless, DVR exploits the idle resources for low-overhead fault tolerance, which is based on the observation that the utilization of many-core system is low due to lack of parallelism in application. Finally, the experiment shows that the performance overhead of DVR is reduced by 16% to 98% compared with full Dual Modular Redundancy (DMR).

关键词： On-demand redundancy Idle resource exploitation Dynamic coupling Low-overhead Many core system

来源：评论

学校读者我要写书评

暂无评论

Skew-Aware Task Scheduling in Clouds

Skew-Aware Task Scheduling in Clouds

引用

2013 IEEE Seventh International Symposium on Service-Oriented System Engineering

作者： Dongsheng Li Yixing Chen Richard Hu Hai National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China Raffles Business Institute Singapore

ISBN: (纸本)9781467356596

Data skew is an important reason for the emergence of stragglers in MapReduce-like cloud systems. In this paper, we propose a Skew-Aware Task Scheduling (SATS) mechanism for iterative applications in MapReduce-like systems. The mechanism utilizes the similarity of data distribution in adjacent iterations of iterative applications to reduce the straggle problem caused by data skew. It collects the data distribution information during the execution of tasks for the current iteration, and uses the information to guide data partitioning in tasks for the next iteration. We implement the mechanism in the HaLoop system and deploy it in a cluster. Experiments show that the proposed mechanism could deal with the data skew and improve the load balancing effectively.

关键词： Load management distributed databases File systems Processor scheduling Computational modeling Data models Data structures

来源：评论

学校读者我要写书评

暂无评论

GPS: A General Framework for parallel Queries over Data Streams in Cloud

GPS: A General Framework for Parallel Queries over Data Stre...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Xiaoyong Li Yijie Wang Yu Zhao Yuan Wang Xiaoling Li Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Hunan P. R. China

parallel query processing over data streams in cloud computing environments has attracted considerable attention recently in various fields, due to the huge potential value of analyzing massive data or big data in a large number of streaming applications. Nevertheless, existing studies on queries primarily focus on the algorithms for the specific query types with the lack of the general framework for processing various queries. Moreover, existing parallel frameworks in cloud such as MapReduce and its variations are not suitable for many complex queries over complex data streams. In this paper, we extensively discuss the problem of designing the general framework for parallel queries over data streams in cloud. Particularly, we propose and implement a framework called GPS, which can be well adapted to various queries over complex data streams like the uncertain data streams. Furthermore, we further propose a hierarchical and general parallel model for queries over data streams based on the proposed framework, which is more flexible than the MapReduce model. The skyline queries over uncertain data streams based on our proposed framework with real deployment are conducted as an example to verify the performances of our proposals.

关键词： Peer-to-peer computing parallel processing Data models Query processing Global Positioning System Object oriented modeling distributed databases

来源：评论

学校读者我要写书评

暂无评论

Structure and method for hardware acceleration of variable data set management

引用

Hunan Daxue Xuebao/Journal of Hunan University Natural Sciences 2013年第11 SUPPL.期40卷 68-73页

作者： Xu, Jin-Bo Dou, Yong Sun, Cai-Xia Dong, Ya-Zhuo Wang, Shao-Gang Lu, Ping-Jing Zhang, Jun College of Computer National Univ of Defense Technology Changsha Hunan 410073 China National Laboratory for Parallel and Distributed Processing National Univ of Defense Technology Changsha Hunan 410073 China Unit 91655 People's Liberation Army Beijing 100036 China

A general hardware structure was proposed to accelerate variable data set management, which was designed to accept instructions flexibly and accomplish the commonly used functions and some more complicated functions of the linked-list data structure .The structure can access the data based on both pointer and address mechanism. In order to fully utilize the limited memory resources, we proposed a memory recycle scheme to reuse the memory space where the data have been deleted. Experimental results on FPGA show that our proposal can accelerate the variable data set management. Only few hardware resources were used and it consumed pretty low power. Compared with the software linked-list structure in PC, our proposal in FPGA achieved high speedups.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

The influences of model parameters on the characteristics of memristors

引用

Chinese Physics B 2012年第4期21卷 576-585页

作者：周静黄达 National Laboratory for Parallel and Distributed Processing School of ComputerNational University of Defense TechnologyChangsha 410073China

As the fourth passive circuit component, a memristor is a nonlinear resistor that can ＂remember＂ the amount of charge passing through it. The characteristic of ＂remembering＂ the charge and non-volatility makes memristors great potential candidates in many fields. Nowadays, only a few groups have the ability to fabricate memristors, and most researchers study them by theoretic analysis and simulation. In this paper, we first analyse the theoretical base and characteristics of memristors, then use a simulation program with integrated circuit emphasis as our tool to simulate the theoretical model of memristors and change the parameters in the model to see the influence of each parameter on the characteristics. Our work supplies researchers engaged in memristor-based circuits with advice on how to choose the proper parameters.

关键词： memristor I-V characteristics simulation program with integrated circuit emphasis

来源：评论

学校读者我要写书评

暂无评论

Mining Software Profile across Multiple Repositories for Hierarchical Categorization

Mining Software Profile across Multiple Repositories for Hie...

引用

International Conference on Software Maintenance (ICSM)

作者： Tao Wang Huaimin Wang Gang Yin Charles X. Ling Xiang Li Peng Zou National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Department of Computer Science The University of Western Ontario London Ontario Canada Academy of Equipment Beijing China

ISBN: (纸本)9781467352185

The large amounts of software repositories over the Internet are fundamentally changing the traditional paradigms of software maintenance. Efficient categorization of the massive projects for retrieving the relevant software in these repositories is of vital importance for Internet-based maintenance tasks 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, which are only verified on relatively small collections of projects with coarse-grained categories or clusters. However, Internet-based software maintenance 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 across multiple repositories. We design a SVM-based categorization framework to classify the massive number of software hierarchically. To improve the categorization performance, we aggregate different types of profile attributes from multiple repositories and design a weighted combination strategy which assigns greater weights to more important attributes. Extensive experiments are carried out on more than 18,000 projects across three repositories. The results show that our approach achieves significant improvements by using weighted combination, and the overall precision, recall and F-Measure can reach 71.41%, 65.60% and 68.38% in appropriate settings. Compared to the previous work, our approach presents competitive results with 123 finer-grained and multi-layered categories. In contrast to those using source code or byte code, our approach is more effective for large-scale and language-independent software categorization.

关键词： Databases Collaboration Servers Software maintenance Internet Data mining

来源：评论

学校读者我要写书评

暂无评论

NR-MPI: A Non-stop and Fault Resilient MPI

NR-MPI: A Non-stop and Fault Resilient MPI

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Guang Suo Yutong Lu Xiangke Liao Min Xie Hongjia Cao State Key Laboratory of High Performance Computing National University of Defense Technology Changsha Hunan Province China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Hunan Province China

Fault resilience has became a major issue for HPC systems, in particular in the perspective of future E-scale systems, which will consist of millions of CPU cores and other components. Fault tolerant MPI was proposed to offer support of software level fault tolerance approaches. However, the widely used MPI implementations, such as MPICH and Mvapich2, provide limited support for fault tolerance. This paper proposes NR-MPI, a Non-stop and Fault Resilient MPI. NR-MPI implements the semantics of FT-MPI based on MPICH. Specifically, this paper focuses on failure detection in MPI library, online failure recovery of communicators for multiple failures, friendly programming interface extending for NR-MPI. Furthermore, to support failure recovery of applications, NR-MPI implements data backup and restore interfaces based on double in-memory checkpoint/restart. We conduct experiments with NPB benchmarks on TH-1A supercomputer. Experimental results show that NR-MPI based fault tolerant programs can recover from failures online without restarting, and the overhead is small even for applications with tens of thousands of cores.

关键词： Fault tolerance Fault tolerant systems Libraries Resource management Context Programming Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：