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

Fault recovery based on parallel recomputing in transactional memory system

Lecture Notes in Electrical Engineering 2011年 98卷 995-1002页

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

ISBN: (纸本)9783642217647

This paper addresses the issue of fault recovery in transactional memory, and proposes a method of fault recovery based on parallel recomputing in transactional memory system. This method utilizes the dataversioning mechanism of transactional memory system to avoid the extra cost of state saving, rolls back a single transaction to avoid wasting the computing time of the fault-free transactions, and adopts the parallel recomputing method to reduce the cost of fault recovery. This paper applies this method to OpenTM programs, and proposes the implementation method of parallel recomputing in OpenTM. At last, this paper tests the performance of this method through a test program. The experimental results show that, compared with the fault recovery method of rolling back a single transaction, the parallel recomputing method in transactional memory system can execute the fault recovery quickly and accurately and the method has a well scalability. © Springer-Verlag Berlin Heidelberg 2011.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Coordinate strip-mining and kernel fusion to lower power consumption on GPU

Coordinate strip-mining and kernel fusion to lower power con...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Guibin Wang National Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781612842080

Although general purpose GPUs have relatively high computing capacity, they also introduce high power consumption compared with general purpose CPUs. Therefore low-power techniques targeted for GPUs will be one of the most hot topics in the future. On the other hand, in several application domains, users are unwilling to sacrifice performance to save power. In this paper, we propose an effective kernel fusion method to reduce the power consumption for GPUs without performance loss. Different from executing multiple kernels serially, the proposed method fuses several kernels into one larger kernel. Owing to the fact that most consecutive kernels in an application have data dependency and could not be fused directly, we split large kernel into multiple slices with strip-mining method, then fuse independent sliced kernels into one kernel. Based on the CUDA programming model, we propose three different kernel fusion implementations, with each one targeting for a special case. Based on the different strip-ming methods, we also propose two fusion mechanisms, which are called invariant-slice fusion and variant-slice fusion. The latter one could be better adapted to the requirements of the kernels to be fused. The experimental results validate that the proposed kernel fusion method could effectively reduce the power consumption for GPU.

关键词： Kernel Energy consumption Graphics processing unit Power demand Instruction sets Programming Optimization

来源：评论

学校读者我要写书评

暂无评论

parallelization of the Training for Face Detection with Transactional Memory

Parallelization of the Training for Face Detection with Tran...

引用

The International Conference on Automation and Robotics(ICAR 2011)

作者： Kun Zeng Key Laboratory and technology for National Defence of Parallel and Distributed Processing School of Computer National Univiersity of Defense Technology

The development of multi-core processor makes the parallelization of traditional sequential algorithms increasingly important. Meanwhile, transactional memory serves a good parallel programming model. This paper takes the advantage of software transactional memory to parallelize the Multi-Exit Asymmetric Adaboost algorithm for face detection. The parallel version is evaluated on three different implementations of software transactional memory. The experiment results show that the transactional memory based parallelization outperforms the traditional lock based approach. A speedup of nearly seven is achieved on a eight-core machine on an eight-core system.

关键词： Transactional Memory Face Detection Machine Learning Optimistic Algorithm Pessimistic Algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficient two-level bitmap index for cloud data management

An efficient two-level bitmap index for cloud data managemen...

引用

International Conference on Communication Software and Networks, ICCSN

作者： Huang Bin Peng Yu-Xing School of Computer Science Wuhan University of China Wuhan China National Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. To fully harness the power of the Cloud, efficient data management is needed to handle huge volumes of data and support a large number of concurrent end users. To achieve that, a scalable and high-throughput indexing scheme is generally required. Such an indexing scheme must support parallel search to improve scalability. In this paper, we present a bitmap based indexing scheme for efficient data processing in the Cloud. Our approach can be summarized as follows. First, we build a local bitmap index for each compute node which only indexes data residing on the node. Second, we organize the compute nodes as a structured overlay and each node maintains a portion of the global index for the whole different data. The global index is also bitmap index to indicate the node each data resides in. Third, all bitmaps are compressed by adopting run-length coding for reducing storage requirement. We conduct extensive experiments on a LAN, and the results demonstrate that our indexing scheme is dynamic, efficient and scalable.

关键词： TV

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient scheduling algorithm for sporadic real-time tasks in multiprocessor systems

An energy-efficient scheduling algorithm for sporadic real-t...

引用

13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011

作者： Zhang, Dong-Song Chen, Fang-Yuan Li, Hong-Hua Jin, Shi-Yao Guo, De-Ke National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China School of Computing Science Simon Fraser University 8888 University Drive Burnaby BC V5A 1S6 Canada National Laboratory for Information System Engineering School of Information Systems and Management National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769545387

As the energy consumption of embedded multiprocessor systems becomes increasingly prominent, the real-time energy-efficient scheduling in multiprocessor systems becomes an urgent problem to reduce the system energy consumption while meeting real-time constraints. For a multiprocessor with independent DVFS and DPM at each processor, this paper proposes an energy-efficient real-time scheduling algorithm named LRE-DVFS-EACH, based on LRE-TL which is an optimal real-time scheduling algorithm for sporadic tasks. LRE-DVFS-EACH utilizes the concept of TL plane and the idea of fluid scheduling to dynamically scale the voltage and frequency of processors at the initial time of each TL plane as well as the release time of a sporadic task in each TL plane. Consequently, LRE-DVFS-EACH can obtain a reasonable tradeoff between the real-time constraints and the energy saving. LRE-DVFS-EACH is also adaptive to the change of workload caused by the dynamic release of sporadic tasks, which can obtain more energy savings. The experimental results show that compared with existing algorithms, LRE-DVFS-EACH can not only guarantee the optimal feasibility of sporadic tasks, but also achieve more energy savings in all cases, especially in the case of high workloads. © 2011 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

An ordering-based approach to the evaluation of trust systems

An ordering-based approach to the evaluation of trust system...

引用

International Conference on Communication Software and Networks, ICCSN

作者： Wei Liu Yang-Bin Tang Huai-Min Wang Gang Lu School of Computer National University of Defense Technology Changsha Hunan China National Laboratory for Parallel and Distributed Processing Changsha Hunan China

Trust systems provide a promising way to build trust relationships among users in distributed and opening systems. However, it is difficult to make quantitatively comparative analysis on different trust systems because of the different application settings and the lack of effective measures. This paper constructs a framework of trust systems in terms of linear algebra, which helps us model and implement different systems in a uniform way. Besides, we propose an ordering-based approach to evaluating trust systems, then give two relevant ordering-base measures. The experiment results suggests that our method provides an effective way to analyze and evaluate trust systems.

关键词： Computational modeling Blogs

来源：评论

学校读者我要写书评

暂无评论

NBHU-based Method to Counter Quiet DDoS Attacks

NBHU-based Method to Counter Quiet DDoS Attacks

引用

2011 International Conference on computer science and Network Technology(2011计算机科学与网络技术国际会议 ICCSNT 2011)

作者： Jing Zhang Lin Chen Huaping Hu Hui Liu Computer School National University of Defense Technology Changsha China State Key Laboratory on Parallel and Distributed Processing National University of Defense Technolog

The Quiet DDoS attack becomes one of the most severely threat to the network safety, because this kind of attack completely adopts legal TCP flow while distributing its destination IP to evade various countermeasures deployed in the network. However, the high distributed degree of the destination IP becomes one characteristics of the attack. However, we think this characteristic make partially of the attack flow not match the behavior habit of network users. Inspired by this viewpoint, we propose a novel method to counter the Quiet DDoS attack based on the NBHU (network behavior habit of users). Furthermore, we carry on simulation of our method using NS2 platform, and the results show that this method can reduce the attack performance.

关键词： Quiet DDoS Attack Network Behavior Habit Counter

来源：评论

学校读者我要写书评

暂无评论

The dynamic allocation model for the resources of cloud services delivery networks

引用

Jisuanji Xuebao/Chinese Journal of computers 2011年第12期34卷 2305-2318页

作者： Shi, Pei-Chang Wang, Huai-Min Yin, Gang Liu, Xue-Ning Yuan, Xiao-Qun Shi, Dian-Xi National Laboratory for Parallel and Distributed Processing School of Computer and Science National University of Defense Technology Changsha 410073 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Department of Electronics and Information Engineering Huazhong Univ. of Sci. and Technol. Wuhan 430074 China

Cloud Services Delivery Networks (CSDN) constructs a layer distributed server overlay over the Internet, which uses the way to the nearest and on-demand approach providing services to end users. Facing the scale and diversification of the resource demand characteristics of the Internet cloud services, CSDN forms different logical sub-server overlay for different kinds of cloud services. However, most servers and bandwidth resources of CSDN are used to deliver the streaming and downloading kind of cloud services, and the dynamic allocation of their delivery resource is the main research emphasis in this paper. This paper first models the problem to be a multi-dimensional facility location problem, according to the two characteristics: the memory resource and bandwidth resource of this kind of application are the bottleneck resource;the hot contents of this kind of application can be delivered using the Peer-to-Peer mechanisms. After the model analyzed and its NP-Complete proved, we then propose a heuristic algorithm. Finally, using the service delivery cost savings as the performance metrics, while the actual system's operation trace is as the input, the effectiveness of the algorithm are comprehensively assessed.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Semantic web service composition using answer set planning

引用

International Journal of Advancements in Computing Technology 2011年第5期3卷 20-31页

作者： Qian, Jun-Yan Huang, Guo-Wang Zhao, Ling-Zhong National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Department of Computer science and engineering Guilin University of Electronic Technology Guilin 541004 China

This paper presents a method that adapting planning description to bring the semantic information into play for service composition through action language C. It shows how service descriptions can be expressed by preconditions and effects and the action language C provides a richer syntax and semantic for complex service descriptions. We also presents the algorithm of Translating semantic Web service described by OWL-S to action language C. Thanks to the structured description and the powerful expression of C, we only consider the initial Situation and the desired goal ignoring details of transition and planning. At last we use satisfiability planning to solve the planning problem by translating the action language into disjunctive logic program.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Toward Optimal Deployment of Communication-Intensive Cloud Applications

Toward Optimal Deployment of Communication-Intensive Cloud A...

引用

IEEE International Conference on Cloud Computing, CLOUD

作者： Pei Fan Ji Wang Zibin Zheng Michael R. Lyu National Laboratory for Parallel & Distributed Processing National University of Defense Technology Changsha China Department of Computer Science & Engineering Chinese University of Hong Kong Hong Kong China

Strongly promoted by the leading industrial companies, cloud computing becomes increasingly popular in re-cent years. The growth rate of cloud computing surpasses even the most optimistic predictions. A cloud application is a large-scale distributed system that consist a lot of distributed cloud nodes. How to make optimal deployment of cloud applications is a challenging research problem. When deploying a cloud application to the cloud environment, cloud node ranking is one of the most important approaches for selecting optimal cloud nodes for the cloud application. Traditional ranking methods usually rank the cloud nodes based on their QoS values, without considering the communication performance between cloud nodes. However, such kind of node relationship is very important for the communication-intensive cloud applications (e.g., Message Passing Interface (MPI) programs), which have a lot of communications between the selected cloud nodes. In this paper, we propose a novel clustering-based method for selecting optimal cloud nodes for deploying communication-intensive applications to the cloud environment. Our method not only takes into account the cloud node qualities, but also the communication performance between different nodes. We deploy several well-known MPI programs on a real-world cloud and compare our method with other methods. The experimental results show the effectiveness of our cluster-based method.

关键词： Time factors Cloud computing Benchmark testing Quality of service Servers Clustering algorithms Databases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：