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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Context-Aware Scheduling in Wireless Networks with Successive Interference Cancellation

Context-Aware Scheduling in Wireless Networks with Successiv...

引用

IEEE International Conference on Communications Workshops

作者： Shaohe Lv Weihua Zhuang Xiaodong Wang Xingming Zhou National Laboratory of Parallel and Distributed Processing National University of Defense Technology Department of Electrical and Computer Engineering University of Waterloo

ISBN: (纸本)9781612842325

We consider the greedy scheduling based on the physical model in wireless networks with successive interference cancellation (SIC). There are two major stages in a scheduling scheme, link selection (to decide which link is scheduled next) and time slot selection (to deciding which slot is allocated to a given link). Most available schemes take a first-fit policy in the latter and strive to achieve good performance by careful selection of link ordering with respect to interference. Due to the accumulation effect and sequential detection nature of SIC, however, it is difficult to evaluate the interference of a link. As a result, many existing scheduling schemes become less efficient. In this paper, we take a new look on the problem and focus to the time slot selection stage. We define tolerance margin to measure the saturation of a link set and present two heuristic policies: one is to schedule a link to a slot such that the resulting set of links has a maximum tolerance margin;the other is to choose a slot such that the increase of tolerance margin is minimum. Simulation results show that the performance of the proposed schemes is better than the first-fit policy and is close to the optimal solution.

关键词： Link scheduling Successive interference cancellation Physical interference model

来源：评论

学校读者我要写书评

暂无评论

The prediction model based on RBF network in achieving elastic cloud

引用

Advances in Information Sciences and Service Sciences 2011年第11期3卷 67-78页

作者： Shi, Peichang Wang, Huaimin Ding, Bo Liu, Ran Wang, Tianzuo National Laboratory for Parallel and Distributed Processing School of Computer and Science National University of Defense Technology China Department of Electronics and Information Engineering Huazhong University of Science Technology China

Cloud needs to have rapid and elastic resources supply capability, because of the fluctuant resources demand of end-users. Multi-scale resources elastic binding is an important method to provide cloud services with rapid and elastic service capability. The most challenging problem in multi-scale resources elastic binding is how to predict the dynamic resource demand of end-users, and then decide when and to what extent multi-scale resources need elastic binding based on the prediction. In this paper, we present the prediction model based on RBF (Radial Basis Function) Network, which is used to predict end-users resource demand in advance. Compared with current prediction methods, it has faster prediction speed and higher prediction accuracy. Then we use traces data (the bandwidth demand of Web type of cloud services) collected from a real-world cloud provider: ChinaCache, as the training and testing data set to validate the method. Finally, we evaluate the predicted results using general prediction accuracy metrics. The results prove that the prediction model based on RBF network is able to resolve the decision problem in multi-scale resources elastic binding.

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

An effective control scheme to ensure real-time causal order in large-scale distributed interactive simulations

An effective control scheme to ensure real-time causal order...

引用

2011 IEEE 3rd International Conference on Communication Software and Networks, ICCSN 2011

作者： Zhou, Hangjun Fu, Sha Department of Information Management Hunan University of Finance and Economics Chang Sha Hu Nan China Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Chang Sha Hu Nan China

ISBN: (纸本)9781612844855

When a large-scale distributed interactive simulation system is running on WAN, the sites usually disperse over a wide area in geography, which results in the simulation clock of each site is hardly to be accurately synchronized with that of other sites. The asynchronous clocks and large transmission latency on WAN bring on a problem for the large-scale simulations to preserve the real-time causal order delivery of received events at each site. In this article, we analyze the indirect way to compare the values of asynchronous simulation clocks at first, and then propose a novel scheme which can select the reconstructible causal control information for each message so as to ensure the causal ordering of events in real time. Experiments demonstrate that the scheme can weaken the effect of network latency, reduce the overhead of the transmission amount of control information and improve the causal order consistency in asynchronous distributed simulations. © 2011 IEEE.

关键词： Real time control

来源：评论

学校读者我要写书评

暂无评论

A causality based dynamic message ordering for DVEs on Wide Area Network

A causality based dynamic message ordering for DVEs on Wide ...

引用

IEEE International Conference on Communication Software and Networks

ISBN: (纸本)9781612844855

Due to the large message transmission latency in distributed Virtual Environments(DVEs) on Wide Area Net-work(WAN), the effectiveness of causality consistency control of message ordering is determined by not only causal order of messages but also the real-timeness. If merely causal order is considered, the real-time property of DVEs may not be ensured because of the unlimited waiting time for the delayed messages. While if only real-timeness is emphasized, there may be too many delayed messages, which have to be discarded, to maintain the quality of causal message ordering. Therefore, a trade-off between the quality of causal order delivery and real-timeness is necessary for DVEs. In this article, a novel causality based message ordering approach is presented. In general, this new approach dynamically balances the demands of causal order delivery and real-timeness. Experiment results demonstrate the approach can enhance the quality of causality, while simultaneously keep the real-time property of DVEs. © 2011 IEEE.

关键词： Wide area networks

来源：评论

学校读者我要写书评

暂无评论

A multi-layered emulation platform to verify the effectiveness of consistency control approaches about message ordering

A multi-layered emulation platform to verify the effectivene...

引用

IEEE International Conference on Communication Software and Networks

ISBN: (纸本)9781612844855

It is an important issue to preserve the consistent delivering order of messages at each site in distributed Virtual Environments(DVEs). Currently, the violations of message delivery order are inclined to happen in the large-scale and frequently interactive DVEs running on Wide Area Network(WAN). The inconsistent anomalies are characterized as unpredictable, unrepeatable and uncontrollable, which results in the severe problem for the development of the consistency control approaches. Meanwhile, it is also highly expensive to directly verify the proposed approaches on WAN. Therefore, in this paper, we design and establish an original multi-layered emulation platform in LAN, which can emulate the network latency of WAN and repeat the scenarios of violations. On the platform, the designers of consistency approaches don't have to spend efforts to realize the fundamental functions of the verification, but could pay more attention to the development and optimization of the control algorithms, which is very beneficial for the improvement of message ordering approaches. © 2011 IEEE.

关键词： Wide area networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Accelerating MatLab code using GPU: A review of tools and strategies

Accelerating MatLab code using GPU: A review of tools and st...

引用

2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce, AIMSEC 2011

作者： Zhang, Baida Xu, Shuai Zhang, Feng Bi, Yuan Huang, Linqi National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China Department of Information Engineering Academy of Armored Force Engineering Beijing 100000 China Electronic Information Industry Co. Ltd Beijing 100085 China Naval Academy of Armament Beijing 100036 China School of Resources and Safety Engineering Central South University Changsha 410083 China

ISBN: (纸本)9781457705366

Lots of toolboxes of accelerating MatLab using GPU are available now[1], but, users are confused by which toolbox is best suitable for a particular task. Three toolboxes-Jacket, GPUmat, and parallel Computing Toolbox of MatLab are selected. For each toolbox, its advantages and pitfalls are reviewed, with an aim to allow the reader to identify which toolbox is appropriate for a given task. Strategies of whether a function should execute on GPU are given after a formula analysis. The analysis is also a framework for program automatically decides which function is cost-efficient to execute on GPU. A series of benchmark of different types of computing, including data transfer between GPU and CPU, data matrix Generation, matrix operation and GPU functions were tested in all three toolboxes. And the results show that Jacket is the best one. Some advices to improve the performance of toolboxes are given in the end. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：