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

2011 International Conference on Automation and Robotics, ICAR 2011

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

ISBN: (纸本)9783642256455

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. © 2011 Springer-Verlag.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

A Compact Model for Multi-Island Single Electron Transistors

A Compact Model for Multi-Island Single Electron Transistors

引用

3rd IEEE International NanoElectronics Conference (INEC)/Symposium on Nanoscience and Nanotechnology in China

作者： Chi, Yaqing Zhong, Haiqin Zhang, Chao Fang, Liang National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Hunan 410073 China

ISBN: (纸本)9781424435449

Multi-island single electron transistor is an important kind of the single electron transistor, which is convenient to realize the controllable room temperature operation. A novel semi-empirical compact model for the Multi-island single electron transistor is proposed. The new approach combines the orthodox theory of the single electron tunneling through single coulomb island and a novel empirical analysis procedure for the chain of multi coulomb islands to solve the current of the whole multi-island single electron transistor. The tunneling rates are calculated based on the orthodox theory for the single electron tunneling. The tunneling currents representing the first splitted peaks in the coulomb oscillation curves are calculated according to the assumption that the currents through all the coulomb islands are equal to each other at the stable states, while the currents representing the other splitted peaks are constructed and merged together according to the empirical analysis. The model is verified by the traditional SET simulator SIMON and shows much faster calculation speed than SIMON. Therefore, the novel compact model is suitable for the large scale MISET circuit simulation.

关键词： Single Electron Transistor Coulomb Island Coulomb Oscillation Splitted Peak

来源：评论

学校读者我要写书评

暂无评论

A construction technique of constant degree P2P systems towards efficient complex queries

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2011年第3期48卷 374-381页

作者： Wang, Xiaohai Peng, Yuxing Li, Dongsheng Key Laboratory of Science and Technology for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

Constant degree peer-to-peer (P2P) system is turning into the P2P domain's promising hotspot due to constant degree digraphs having good propertis. However, it is often hard to convert a stardard constant degree digraph to a DHT schema. Thus, most researches focus on DHT's construction and maintenance, while leaving optimization and supporting to complex query behind. Underlying topology affects upper-layers' character a lot. For constant degree P2P topologies, their inherent property makes a constant degree P2P system built using classical technique be poor in the data locality, and unfit for efficient, low-cost complex queries. Aiming at this shortage, a general-purpose construction technique towards efficient complex queries is proposed, which adds an embedding transformation layer between data layer and DHT overlay. In this way, adjacent data are stored in overlay's adjacent peers and the data locality is improved, so that the number of peers referred in complex queries can be minimized with a limited time overhead. To validate this technology, the first constant degree P2P system based on Kautz digraph FissionE is reconstructed as a typical example, which includes re-allocating of resources, query algorithm and locality maintenance strategies. Experimental results show that this construction technique can ensure data locality, reduce query cost and lead to systems' efficiency without changing the underlying DHT layer.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

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

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

来源：评论

学校读者我要写书评

暂无评论

Power Optimization for GPU Programs Based on Software Prefetching

Power Optimization for GPU Programs Based on Software Prefet...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Yisong Lin Tao Tang Guibin Wang Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defense and Technology Changsha China

GPUs render higher computing unit density than contemporary CPUs and thus exhibit much higher power consumption despite its higher power efficiency. The power consumption has become an important issue that impacts CPU's applications, thereby necessitating the low power optimization technology for GPUs. Software prefetching is an efficient way to alleviate the memory wall problem which overlaps the computing and memory access latencies. However, software prefetching will cause some power overhead because it increases the number and density of the instructions. Thus, we should consider the balance between the performance income and the power overhead when applying the optimization. To address this problem, in this paper we first analyze the multi-thread execution model of GPU and validate the potential space of software prefetching optimization. Then we give the software prefetching method for GPU programs to improve the performance. Aiming at two different objects: energy optimization under performance constraint and performance optimization under power constraint, we discuss the optimization methods based on software prefetching and dynamic voltage scaling technologies. The experimental results show that our method can efficiently optimize the energy consumption (performance) under the performance (power) constraint.

关键词： Prefetching Graphics processing unit Optimization Power demand Registers

来源：评论

学校读者我要写书评

暂无评论

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

作者： 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

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

来源：评论

学校读者我要写书评

暂无评论

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

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 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

来源：评论

学校读者我要写书评

暂无评论

Algorithm for distributed Constraint Optimization Problems with low constraint density

引用

Ruan Jian Xue Bao/Journal of Software 2011年第4期22卷 625-639页

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

Many challenges in multi-agent coordination can be modeled as distributed Constraint Optimization Problems (DCOPs). Aiming at DCOPs with low constraint density, this paper proposes a distributed algorithm based on the idea of greed and backjumping. In this algorithm, each agent makes decisions according to the greedy principle that the most assignment combinations in the problems with low constraint density occur at a zero cost, and the backjumping mechanism among the agents ensures the success of this algorithm, even when this greedy principle leads to a local optimum. In contrast with the existing mainstream DCOP algorithms, this algorithm can solve problems with low constraint density with fewer messages while keeping the polynomial message length and space complexity. The correctness of the key mechanisms in this algorithm has been proved, and those advantages in performance have been verified by experiments. © 2011 ISCAS.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：