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

False-positive probability and compression optimization for tree-structured bloom filters

ACM Transactions on Modeling and Performance Evaluation of Computing Systems 2016年第4期1卷 1–39页

作者： Fu, Yongquan Biersack, Ernst National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Sanyi Road Changsha Hunan Province410073 China CAIPY Valbonne06560 France

Bloom filters are frequently used to to check the membership of an item in a set. However, Bloom filters face a dilemma: the transmission bandwidth and the accuracy cannot be optimized simultaneously. This dilemma is particularly severe for transmitting Bloom filters to remote nodes when the network bandwidth is limited. We propose a novel Bloom filter called BloomTree that consists of a tree-structured organization of smaller Bloom filters, each using a set of independent hash functions. BloomTree spreads items across levels that are compressed to reduce the transmission bandwidth need. We show how to find optimal configurations for BloomTree and investigate in detail by how much BloomTree outperforms the standard Bloom filter or the compressed Bloom filter. Finally, we use the intersection of BloomTrees to predict the set intersection, decreasing the false-positive probabilities by several orders of magnitude compared to both the compressed Bloom filter and the standard Bloom filter. © 2016 ACM 2376-3639/2016/09-ART19 $15.00

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A distributed Relation Detection Approach in the Internet of Things

引用

Mobile Information Systems 2017年第1期2017卷

作者： Zhu, Weiping Lu, Hongliang Cui, Xiaohui Cao, Jiannong International School of Software Wuhan University Wuhan China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong

In the Internet of Things, it is important to detect the various relations among objects for mining useful knowledge. Existing works on relation detection are based on centralized processing, which is not suitable for the Internet of Things owing to the unavailability of a server, one-point failure, computation bottleneck, and moving of objects. In this paper, we propose a distributed approach to detect relations among objects. We first build a system model for this problem that supports generic forms of relations and both physical time and logical time. Based on this, we design the distributed Relation Detection Approach (DRDA), which utilizes a distributed spanning tree to detect relations using in-network processing. DRDA can coordinate the distributed tree-building process of objects and automatically change the depth of the routing tree to a proper value. Optimization among multiple relation detection tasks is also considered. Extensive simulations were performed and the results show that the proposed approach outperforms existing approaches in terms of the energy consumption. © 2017 Weiping Zhu et al.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm for reconstructing singular connection in the multi-block cfd applications

arXiv

引用

arXiv 2017年

作者： Yong-Xian, Wang Li-Lun, Zhang Yong-Gang, Che Chuan-Fu, Xu Wei, Liu Hua-Yong, Liu Zheng-Hua, Wang College of Computer National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China State Key Laboratory of Aerodynamics Mianyang621000 China

In this paper, an improved algorithm is proposed for the reconstruction of singularity connectivity from the available pairwise connections during preprocessing phase. To evaluate the performance of our algorithm, an in-house CFD code, in which high-order finite-difference method for spatial discretization, running on the Tianhe-1A supercomputer is employed. Test cases with a varied amount of mesh points are chosen, and the test results indicate that the improved singular connection reconstruction algorithm can achieve a 2000× speedup at least compared with the naive search method adopt in the former version of our code. Moreover, the parallel efficiency can be benefited from the strategy of local communication based on the new algorithm. Copyright © 2017, The Authors. All rights reserved.

关键词： Finite difference method

来源：评论

学校读者我要写书评

暂无评论

An Efficient Label Routing on High-Radix Interconnection Networks

An Efficient Label Routing on High-Radix Interconnection Net...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Fei Lei Dezun Dong Xiangke Liao College of Computer National University of Defense Technology China National Laboratory for Parallel and Distributed Processing National University of Defense Technology China Collaborative Innovation Center of High Performance Computing National University of Defense Technology China

ISBN: (纸本)9781538632086

Cost-effective adaptive routing has a significant impact on overall performance for high-radix hierarchical topologies, such as Dragonfly, which achieve a lower network diameter than traditional topologies, Torus and Fat tree, but exhibit a lower degree of adaptiveness for shortest-path rout- ing. Existing adaptive routing methods for those hierarchical topologies improve the adaptiveness by increasing path length, i.e. local or global adaptive routing, and thus suffer from complex and costly deadlock avoidance. This work aims to maximize the routing adaptiveness at the minimum cost of deadlock avoidance. We propose a label routing method for high-radix hierarchical networks. This label routing utilizes a co-design methodology and coordinates the two pipelines, input queue and routing computation, in the router microarchitec- ture. Packets in the input buffer are labeled by our routing algorithm depending on network states. We reorganize the input buffer and develop a label routing algorithm, named Green-Red Routing, GRR. GRR relaxes the requirement of using virtual channels to eliminate routing deadlock, and mitigates buffer resources dedicated to deadlock avoidance. GRR manages the buffer resources and balance its utilization elaborately, and achieve fully adaptive routing efficiently. We conduct extensive experiments to evaluate the performance of GRR on Dragonfly and compare it with state-of-the-art works. The results show that GRR achieves 10%-35% higher performance than existing routing algorithms under most traffic patterns.

关键词： Routing System recovery Network topology Topology Resource management Adaptive systems Organizations

来源：评论

学校读者我要写书评

暂无评论

SinglA image super-resolution via classified sparse Representation 13

SinglA image super-resolution via classified sparse Represen...

引用

13th International Conference on Embedded Software and System, ICESS 2016

作者： Lai, Chao Li, Fangzhao Li, Bao Jin, Shiyao National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781509037261

Single image super-resolution reconstruction is a challenging ill-posed inverse problem currently. In this paper, we propose a method based on image classification and sparse representation for single image super-resolution reconstruction. Various images belong to different image category, and each category contains different contents and structures respectively, especially the high-frequency feature. Therefore, we extract the features of the input low-resolution image, and classify it into the corresponding category. Then the high-resolution image is reconstructed by sparse representation with the dictionary trained from the corresponding database, which consists of high-resolution and low-resolution image patch pairs. The experimental results demonstrate that our method achieves better performance in visual effect and qualitative analysis, by comparison with some well-known methods. © 2016 IEEE.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

An Energy Efficient Optimized Control Algorithm for Urban Rail Transit System 35

An Energy Efficient Optimized Control Algorithm for Urban Ra...

引用

第35届中国控制会议

作者： ZHANG Hongguang SONG Mengxiao ZHANG Minxuan College of Computer National University of Defense Technology College of Mechatronic Engineering and Automation National University of Defense Technology National Laboratory for Parallel and Distributed Processing National University of Defense Technology

ISBN: (纸本)9781509009107

The energy consumption of urban rail transit system involves train traction, air conditioning system, elevator, water supply and drainage equipment and so on, wherein the traction energy consumption accounts for more than 40% of the total energy consumption. With more concerning about low-carbon and environment protection, it has become a research hotspot that how to minimize the traction energy consumption during operation. Aiming at the optimized control of single train in complex line conditions, we design an algorithm based on recursion, by which we can obtain the most efficient control strategy with a set of constraints and effectively reduce the traction energy consumption. Meanwhile, we focus on the multiple-unit trains' cooperative control issue, and give the relevant solutions to improve the proportion of recovered renewable braking energy.

关键词： urban rail transit efficient algorithm recursion cooperative control

来源：评论

学校读者我要写书评

暂无评论

Unified weighted label propagation algorithm using connection factor 12th

Unified weighted label propagation algorithm using connectio...

引用

12th International Conference on Advanced Data Mining and Applications, ADMA 2016

作者： Wang, Xin Jian, Songlei Lu, Kai Wang, Xiaoping College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9783319495859

With the social networks getting increasingly larger, fast community detection algorithms like the label propagation algorithm, are attracting more attention. But the label propagation algorithm deals vertices with no proper weight, which leads to the loss in the performance. We propose the connection factor of the vertex to measure its influence on the local connectivity. The connection factor can reveal the topological structure feature, and we propose a unified weight to modify the original label propagation algorithm. Experiments show that our Unified Weighted LPA has an average performance promotion from 5% to 10 %, in the best case more than 30%. © Springer International Publishing AG 2016.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

Galaxyfly: A novel family of flexible-radix low-diameter topologies for large-scales interconnection networks 16

Galaxyfly: A novel family of flexible-radix low-diameter top...

引用

30th International Conference on Supercomputing, ICS 2016

作者： Lei, Fei Dong, Dezun Liao, Xiangke Su, Xing Li, Cunlu National Laboratory for Parallel and Distributed Processing Collaborative Innovation Center of High Performance Computing College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450343619

Interconnection network plays an essential role in the architecture of large-scale high performance computing (HPC) systems. In the paper, we construct a novel family of lowdiameter topologies, Galaxyfly, using techniques of algebraic graphs over finite fields. Galaxyfly is guaranteed to retain a small constant diameter while achieving a flexible tradeoff between network scale and bisection bandwidth. Galaxyfly lowers the demands for high radix of network routers and is able to utilize routers with merely moderate radix to build exascale interconnection networks. We present effective congestion-aware routing algorithms for Galaxyfly by exploring its algebraic property. We conduct extensive simulations and analysis to evaluate the performance, cost and power consumption of Galaxyfly against state-of-the-art topologies. The results show that our design achieves better performance than most existing topologies under various routing algorithms and traffic patterns, and is cost-effective to deploy for exascale HPC systems. © 2016 ACM.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

80GBaud time division multiplexing optical transceiver

80GBaud time division multiplexing optical transceiver

引用

Integrated Photonics Research, Silicon and Nanophotonics, IPRSN 2016

作者： Zhang, Luo Mingche, Lai Zhengbin, Pang Liquan, Xiao Weixia, Xu School of Computer Science National University of Defense Technology Changsha410073 China Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

High baud rate optical transceiver based on time division multiplexing technology is proposed. A communication channel at 80GBoud with 4 bit streams at 20Gbps is realized by 4-stage cascaded high speed switches with s... 详细信息

ISBN: (纸本)9781943580149

关键词： Photonics

来源：评论

学校读者我要写书评

暂无评论

Cross-clouds services autonomic management approach based on self-organizing multi-agent technology

Cross-clouds services autonomic management approach based on...

引用

作者： Hou, Fu Mao, Xinjun College of Computer National University of Defense Technology Changsha410073 China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

With the rapid development and application of cloud computing, there exist plenty of clouds that are distributed on the open Internet, decentralized in the management, evolving with various services providing diverse functionalities and QoS. Moreover, because of the potential correlativity of cloud services and the dynamic of tenants' requirements, these services in multiple clouds are expected to be effectively managed in an autonomic and transparent way so that tenants can obtain continuous and efficient services. To this end, this paper proposes an approach based on self-organizing multi-agent system to achieving cross-clouds services management, including the service provision at the tenant-end and services aggregation at the cloud-end. In this approach, the clouds services are managed by a series of autonomous agents that are capable of autonomously accessing managed services. They can interact with each other to obtain macro-level services aggregation in terms of self-organization to adapt to the changes of both tenants' requirements and cloud services. The paper details the architecture, mechanisms, and algorithms to implement the aggregation and provision of services in cross-clouds. We also develop relevant cross-clouds services management platform called as CCloudMan, with which several experiments based on the public data sets have been conducted and the experimental results show the efficiency and usability of our proposed approach. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：