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

2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications, PACIIA 2009

作者： Zhang, Wei Zhou, Hangjun Peng, Yuxing Li, Sikun Xi, Min National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Department of Computer Science Xi'an Jiaotong University Xi'an 710049 China

ISBN: (纸本)9781424446070

distributed Virtual Environment (DVE) systems have become more and more important both in academic communities and the industries. To guarantee the load constrain, the physical world integrity and the virtual world integrity, the virtual environment should be divided into several parts and mapped to multiple servers, which are located in geographically different places. Many centralized algorithms based on regular cutting method are proposed to solve this problem. However, the dynamic property of clients and distributed property of the system make the existing algorithms unable to undertake it. In this paper, we propose a metric to measure the cutting quality and design a distributed mapping algorithm based on an irregular cutting. Simulation results show that our algorithm greatly decreases the costs of DVE systems for migration of clients and effectively improves the satisfaction degree of users. ©2009 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Overlay technologies for internet-based virtual computing environment

引用

Jisuanji Xuebao/Chinese Journal of Computers 2008年第9期31卷 1516-1524页

作者： Lu, Xi-Cheng Li, Dong-Sheng National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

Internet resources have the natural characteristics of growth, autonomy and diversity, which have brought great challenges to the efficient aggregation of these resources. Utilizing overlay to organize resources and support efficient resource discovery is an important approach to aggregate resources on-demand in Internet-based Virtual Computing Environment (iVCE). This paper gives an overview of research advances on overlay technologies in iVCE. To adapt to the growth and autonomy of Internet resources, an overlay topology construction mechanism based on Kautz graph is first introduced, and it is extended to a universal method for constructing overlay topologies based on arbitrary regular graphs. To adapt to the diversity of Internet resources, a grouped overlay topology construction mechanism is then proposed. Based on the overlay constructed above, an efficient range query scheme is presented, and the optimization methods of overlay topology as well as other complex query techniques are discussed.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Succinct representations in collaborative filtering: A case study using wavelet tree on 1,000 cores 20

Succinct representations in collaborative filtering: A case ...

引用

20th International Conference on parallel and distributed Computing, Applications and Technologies, PDCAT 2019

作者： Peng, Xiangjun Wang, Qingfeng Sun, Xu Gong, Chunye Wang, Yaohua User-Centric Computing Group University of Nottingham Ningbo China China Department of Computer Science and Technology National University of Defense Technology China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology China

ISBN: (纸本)9781728126166

User-Item (U-I) matrix has been used as the dominant data infrastructure of Collaborative Filtering (CF). To reduce space consumption in runtime and storage, caused by data sparsity and growing need to accommodate side information in CF design, one needs to go beyond the U-I Matrix. In this paper, we took a case study of Succinct Representations in Collaborative Filtering, rather than using a U-I Matrix. Our key insight is to introduce Succinct Data Structures as a new infrastructure of CF. Towards this, we implemented a User-based K-Nearest-Neighbor CF prototype via Wavelet Tree, by first designing a Accessible Compressed Documents (ACD) to compress U-I data in Wavelet Tree, which is efficient in both storage and runtime. Then, we showed that ACD can be applied to develop an efficient intersection algorithm without decompression, by taking advantage of ACD's characteristics. We evaluated our design on 1,000 cores of Tianhe-II supercomputer, with one of the largest public data set ml-20m. The results showed that our prototype could achieve 3.7 minutes on average to deliver the results. © 2019 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Optimizing Depthwise Convolutions on ARMv8 Architecture 23rd

Optimizing Depthwise Convolutions on ARMv8 Architecture

引用

23rd International Conference on parallel and distributed Computing, Applications, and Technologies, PDCAT 2022

作者： Hao, Ruochen Wang, Qinglin Yin, Shangfei Zhou, Tianyang Zhang, Qingyang Mei, Songzhu Shen, Siqi Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China College of Computer National University of Defense Technology Changsha410073 China Xiamen University Xiamen China

ISBN: (纸本)9783031299261

Depthwise convolutions are widely used in lightweight convolutional neural networks (CNNs). The performance of depthwise convolutions is mainly bounded by the memory access rather than the arithmetic operations for classic convolutions so that direct algorithms are often more efficient than indirect ones (matrix multiplication-, Winograd-, and FFT-based convolutions) with additional memory accesses. However, the existing direct implementations of depthwise convolutions on ARMv8 architectures feature a bad trade-off between register-level reuse of different tensors, which usually leads to sub-optimal performance. In this paper, we propose a new direct implementation of depthwise convolutions by means of implicit padding, register tiling, etc. Compared to the existing ones, our new implementations can incur much less communication overhead between registers and cache. Experimental results on two ARMv8 CPUs show that our implementation can averagely deliver 4.88 × performance improvement over the existing direct ones in open-source libraries. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

High-performance Network Traffic Classification Based on Graph Neural Network 6

High-performance Network Traffic Classification Based on Gra...

引用

6th IEEE Information technology, Networking, Electronic and Automation Control Conference, ITNEC 2023

作者： Pang, Bo Fu, Yongquan Ren, Siyuan Jia, Yan Harbin Institute of Technology College of Computer Science and Technology Shenzhen China National University of Defense Technology National Key Laboratory for Parallel and Distributed Processing College of Computer Changsha China Peng Cheng Laboratory Shen Zhen China

ISBN: (纸本)9781665460033

Network traffic classification is crucial for network security and network management and is one of the most important network tasks. Current state-of-the-art traffic classifiers are based on deep learning models to automatically extract features from packet streams. Unfortunately, current approaches fail to effectively combine the structural information of traffic packets with the content features of the packets, resulting in limited classification accuracy. In this paper, we propose a graph neural network model for network traffic classification, which can well perceive the interaction feature of packets in traffic. Firstly, we design a graph structure for packets' flows to hold the interaction information between packets, which embeds both packet contents and sequence relationships into a unified graph. Secondly, we propose a graph neural network framework for graph classification to automatically learn the structural features of the packets' flows together with the packets' features. Extensive evaluation results on real-world traffic data show that the proposed model improves the prediction accuracy of improves the prediction accuracy by 2% to 37% for malicious traffic classification. © 2023 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A simple model for the energy-efficient optimal real-time multiprocessor scheduling

A simple model for the energy-efficient optimal real-time mu...

引用

2012 IEEE International Conference on Computer science and Automation Engineering, CSAE 2012

作者： Wu, Fei Jin, Shiyao Wang, Yuming College of Electronic and Electrical Engineering Shanghai University of Engineering Science Shanghai 201620 China National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781467300865

As the energy consumption of embedded multiprocessor systems becomes increasingly prominent, it becomes an urgent problem of real-time energy-efficient scheduling in multiprocessor systems to reduce system energy consumption while meeting real-time constraints. In this paper, we introduce a unifying energy-efficient real-time scheduling theory with the Deadline Partitioning Fair Dynamic Voltage Frequency Scaling (DPF-DVFS) policy for multiprocessor systems. The proposed model can offer a unifying, extendable, on-line and simple method to realize energy-efficient real-time scheduling with low scheduling overhead. We then present an optimal energy-efficient scheduling algorithm DPF-DVFS-WRAP for periodic tasks. © 2012 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Efficient social network approximate analysis on blogosphere based on network structure characteristics

Efficient social network approximate analysis on blogosphere...

引用

3rd Workshop on Social Network Mining and Analysis, SNA-KDD '09

作者： Tang, Jintao Wang, Ting Wang, Ji Wei, Dengping School of Computer National University of Defense Technology ChangSha Hunan 410073 China National Laboratory for Parallel and Distributed Processing ChangSha Hunan 410073 China

ISBN: (纸本)9781605586762

As a typical social media in Web 2.0, blogs have attracted a surge of researches. Unlike the traditional studies, the social networks mined from Internet are very large, which makes a lot of social network analyzing algorithms to be intractable. According to this phenomenon, this paper addresses the novel problem of efficient social networks analyzing on blogs. This paper turns to account the structural characteristics of real large-scale complex networks, and proposes a novel shortest path approximate algorithm to calculate the distance and shortest path between nodes efficiently. The approximate algorithm then is incorporated with social network analysis algorithms and measurements for large-scale social networks analysis. We illustrate the advantages of the approximate analysis through the centrality measurements and community mining algorithms. The experiments demonstrate the effectiveness of the proposed algorithms on blogs, which indicates the necessity of taking account of the structural characteristics of complex networks when optimizing the analysis algorithms on large-scale social networks. Copyright 2009 ACM.

关键词： Blogs

来源：评论

学校读者我要写书评

暂无评论

Reducing repair traffic in P2P backup systems: Exact regenerating codes on hierarchical codes

Reducing repair traffic in P2P backup systems: Exact regener...

引用

作者： Huang, Zhen Biersack, Ernst Peng, Yuxing Department of Computer National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan 410073 China Eurecom Sophia Antipolis France

Peer to peer backup systems store data on "unreliable" peers that can leave the system at any moment. In this case, the only way to assure durability of the data is to add redundancy using either replication or erasure codes. Erasure codes are able to provide the same reliability as replication requiring much less storage space. Erasure coding breaks the data into blocks that are encoded and then stored on different nodes. However, when storage nodes permanently abandon the system, new redundant blocks must be created, which is referred to as repair. For "classical" erasure codes, generating a new block requires the transmission of k blocks over the network, resulting in a high repair traffic. Recently, two new classes of erasure codes, Regenerating Codes and Hierarchical Codes, have been proposed that significantly reduce the repair traffic. Regenerating Codes reduce the amount of data uploaded by each peer involved in the repair, while Hierarchical Codes reduce the number of nodes participating in the repair. In this article we propose to combine these two codes to devise a new class of erasure codes called ER-Hierarchical Codes that combine the advantages of both. © 2011 ACM.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

Accelerating Embarrassingly parallel Algorithm on Intel MIC

Accelerating Embarrassingly Parallel Algorithm on Intel MIC

引用

2014 IEEE International Conference on Progress in Informatics and Computing

作者： Qinglin Wang Jie Liu XiantuoTang Feng Wang Guitao Fu Zuocheng Xing Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

The Embarrassingly parallel(EP) algorithm which is typical of many Monte Carloapplications provides an estimate of the upper achievable limits for double precision performance of parallel supercomputers. Recently, Intel released Many Integrated Core(MIC) architecture as a many-core co-processor. MIC often offers more than 50 cores each of which can run four hardware threads as well as 512-bit vector instructions. In this paper,we describe how the EP algorithm is accelerated effectively on the platforms containing MIC using the offload execution model. The result shows that the efficientimplementation of EP algorithm on MIC can take full advantage of MIC's computational resources and achieves a speedup of 3.06 compared with that on Intel Xeon E5-2670 CPU. Based on the EP algorithm on MIC and an effective task distribution model, the implementation of EP algorithm on a CPU-MIC heterogeneous platform achieves the performance of up to2134.86 Mop/s and 4.04 times speedup compared with that on Intel Xeon E5-2670 CPU.

关键词： NPB embarrassingly parallel algorithm heterogeneous platform many integrated core architecture

来源：评论

学校读者我要写书评

暂无评论

Routing with uncertainty in wireless mesh networks

Routing with uncertainty in wireless mesh networks

引用

2010 IEEE 18th International Workshop on Quality of Service, IWQoS 2010

作者： Chen, Fajun Liu, Jiangchuan Li, Zongpeng Wang, Yijie Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer National University of Defense Technology China School of Computing Science Simon Fraser University Canada Department of Computer Science University of Caglary Canada

ISBN: (纸本)9781424459889

Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP) [1]. Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51:15∼73:02%) and improvement on packet delivery ratio (99:76%) are observed.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：