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

2008 Conference on Computing Frontiers, CF'08

作者： Du, Jing Yang, Xuejun Wang, Zhiyuan National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)9781605580777

Current high performance computing systems all rely on parallel processing techniques to achieve high performance. With the parallel computer systems scaling up, the new generation of high performance computers puts more emphasis on "high productivity" [1], rather than "high performance" as in the past. These new systems will not only meet the traditional requirements of computing performance, but also address the ongoing technical challenges in the current high-end computing domain regarding energy consumption, reliability, etc. For energy consumption, with the computer system scaling up, it increases dramatically [2]. High energy consumption means high maintenance cost and low system stability. For example, the peak energy consumption of the Earth Simulator and BlueGene/L is 18MW and 1.6MW respectively. For reliability, with the complexity of a computer system increasing, its meantimebetween-failure (MTBF) is becoming significantly shorter than what is required by many current high performance computing applications [3], such as BlueGene/L. Therefore, energy optimization techniques and fault tolerance techniques should be introduced to computer systems to achieve low energy consumption and high reliability. To improve the productivity of high performance computing systems, we need to find a proper way to measure it. Unfortunately, traditional measurement models can not evaluate the system productivity comprehensively and effectively [4]. To address this issue, this paper proposes an effective scalability metric for high performance computing systems based on Gustafson speedup law. The metric makes a good balance among runtime productivity factors including computing performance, energy consumption and reliability. The contribution of our work lies in the following three aspects. First, in order to measure the scalability of an energyconsumption optimized parallel program, we should consider not only whether the program computing performance is scalable, but also w

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

parallel Implementation of SHA256 on Multizone Heterogeneous Systems 21

Parallel Implementation of SHA256 on Multizone Heterogeneous...

引用

21st IEEE International Symposium on parallel and distributed processing with Applications, 13th IEEE International Conference on Big Data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Luo, Yongtao Liu, Jie Xiao, Tiaojie Gong, Chunye National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Digitizing Program for Frontier Equipment Changsha China National Supercomputer Center in Tianjin Tianjin China

ISBN: (纸本)9798350329223

SHA-256 plays an important role in widely used applications, such as data security, data integrity, digital signatures, and cryptocurrencies. However, most of the current optimized implementations of SHA-256 are based on CPUs or dedicated hardware, such as ASICs and FPGAs. Consequently, there is a need to explore whether new heterogeneous parallel framework can improve the computational performance of the hash function. To address this issue, we conducted a study on the MT-3000 platform, which is a special architecture processor for the next-generation exascale prototype supercomputer. We proposed MT-SHA256, a heterogeneous multistage parallel implementation for hashing multiple messages on the MT-3000. Combining the architectural features of this processor, we developed an effective solution that significantly improved the computational performance of SHA-256. As a result, MT-SHA256 achieved a maximum throughput of 1045.68 MB/s on a single acceleration core of MT-3000. This is 9.84x higher than the C code implementation on one CPU core of MT-3000. We also performed a scalability test and found that MT-SHA256 achieved a throughput of 98.04 GB/s on a computing node, and extended to 512 nodes (2048 acceleration clusters) on this system with good scalability. © 2023 IEEE.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

A mobile recommendation system based on logistic regression and Gradient Boosting Decision Trees

A mobile recommendation system based on logistic regression ...

引用

2016 International Joint Conference on Neural Networks, IJCNN 2016

作者： Wang, Yaozheng Feng, Dawei Li, Dongsheng Chen, Xinyuan Zhao, Yunxiang Niu, Xin National Lab for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha410003 China

ISBN: (纸本)9781509006199

Real-life behaviors shown by the mobile users typically exhibit plenty noises, making it hard to construct an effective recommendation engine. In this paper, we present a fused model based on the LR algorithm and the GBDT algorithm to recommend vertical industry commodities in a mobile setting. A set of specifically designed methods are proposed to deal with the data preprocessing and feature extraction problem for the mobile recommendation scenario. The proposed method is evaluated on a large scale real-world dataset provided by the Alibaba mobile shopping department. Result on the F1 score has seen an improvement of 2%-36% compared with the baseline. © 2016 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Meeting deadlines for approximation processing in MapReduce environments

引用

Frontiers of Information technology & Electronic Engineering 2017年第11期18卷 1754-1772页

作者： Ming-hao HU Chang-jian WANG Yu-xing PENG National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

To provide timely results for big data analytics, it is crucial to satisfy deadline requirements for MapReduce jobs in today＇s production environments. Much effort has been devoted to the problem of meeting deadlines, and typically there exist two kinds of solutions. The first is to allocate appropriate resources to complete the entire job before the specified time limit, where missed deadlines result because of tight deadline constraints or lack of resources; the second is to run a pre-constructed sample based on deadline constraints, which can satisfy the time requirement but fail to maximize the volumes of processed data. In this paper, we propose a deadline-oriented task scheduling approach, named ＇Dart＇, to address the above problem. Given a specified deadline and restricted resources, Dart uses an iterative estimation method, which is based on both historical data and job running status to precisely estimate the real-time job completion time. Based on the estimated time, Dart uses an approach-revise algorithm to make dynamic scheduling decisions for meeting deadlines while maximizing the amount of processed data and mitigating stragglers. Dart also efficiently handles task failures and data skew, protecting its performance from being harmed. We have validated our approach using workloads from OpenCloud and Facebook on a cluster of 64 virtual machines. The results show that Dart can not only effectively meet the deadline but also process near-maximum volumes of data even with tight deadlines and limited resources.

关键词： MapReduce Approximation jobs Deadline Task scheduling Straggler mitigation

来源：评论

学校读者我要写书评

暂无评论

Tree-structured bloom filters for joint optimization of false positive probability and transmission bandwidth

Tree-structured bloom filters for joint optimization of fals...

引用

ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2015

作者： Fu, Yongquan Biersack, Ernst Science and Technology Laboratory of Parallel and Distributed Processing School of Computer National Univ. of Defense Technology China Www.e-biersack.eu France

ISBN: (纸本)9781450334860

Bloom filters are frequently used to perform set queries that test the existence of some items. 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 BloomTree that consists of a tree-structured organization of smaller Bloom filters, each one using a set of independent hash functions. BloomTree spreads items across levels that are compressed to reduce the transmission bandwidth need. We investigate in detail under which conditions BloomTree performs better than the compressed Bloom filter and the standard Bloom filter. © Copyright 2015 ACM.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

A knowledge graph embedding method based on neural network 5

A knowledge graph embedding method based on neural network

引用

5th IEEE International Conference on Data science in Cyberspace, DSC 2020

作者： Li, Chenchen Li, Aiping Tu, Hongkui Wang, Ye Wang, Changhai National University of Defense Technology College of Computer ChangSha China National University of Defense Technology College of Computer Science and Technology on Parallel and Distributed Processing Laboratory ChangSha China

ISBN: (数字)9781728195582

ISBN: (纸本)9781728195582

As the basis of many knowledge graph completion tasks, the embedding representation of entities and relations in knowledge graph (KG) is an important task in the fields of Natural Language processing (NLP) and Artificial Intelligence (AI). While most of the existing knowledge graph embedding (KGE) models based on convolutional neural network (CNN) can obtain abundant feature embedding, they may ignore an important fact that the triples in the KG come from the text, as they simply learn about the feature embedding of entities and relations without considering contextual information. Therefore, in this paper, we propose an effective KGE model based on neural network. First of all, we convert the triple (h, r, t) of the KG into a sentence [h r t]. Then, the LSTM neural network is used to learn the long-term dependence of sentences from the input feature vectors. Then, on this basis, the two-layer convolutional neural network with several different filters is used to extract different local features. Finally, the obtained feature vectors are connected together, and the inner product is carried out with the weight vectors to obtain the score of the triple, so as to judge the validity of the given triple. We evaluate our model on two benchmark datasets FB15k-237 and WN18RR, the experimental results show that the model can effectively improve the accuracy of link prediction, achieving better results compared with other baseline models. © 2020 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Tree-Structured parallel Regeneration for Multiple Data Losses in distributed Storage Systems Based on Erasure Codes

引用

China Communications 2013年第4期10卷 113-125页

作者：孙伟东王意洁裴晓强 National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology

To reduce the time required to complete the regeneration process of erasure codes, we propose a Tree-structured parallel Regeneration (TPR) scheme for multiple data losses in distributed storage systems. Under the scheme, two algorithms are proposed for the construction of multiple regeneration trees, namely the edge-disjoint algorithm and edge-sharing algorithm. The edge-disjoint algorithm constructs multiple independent trees, and is simple and appropriate for environments where newcomers and their providers are distributed over a large area and have few intersections. The edge-sharing algorithm constructs multiple trees that compete to utilize the bandwidth, and make a better utilization of the bandwidth, although it needs to measure the available band-width and deal with the bandwidth changes; it is therefore difficult to implement in practical systems. The parallel regeneration for multiple data losses of TPR primarily includes two optimizations: firstly, transferring the data through the bandwidth optimized-paths in a pipe-line manner; secondly, executing data regeneration over multiple trees in parallel. To evaluate the proposal, we implement an event-based simulator and make a detailed comparison with some popular regeneration methods. The quantitative comparison results show that the use of TPR employing either the edge-disjoint algorithm or edge-sharing algorithm reduces the regeneration time significantly.

关键词： distributed storage system erasure code replication regeneration tree

来源：评论

学校读者我要写书评

暂无评论

Multi-class contour preserving classification

Multi-class contour preserving classification

引用

13th International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2012

作者： Fuangkhon, Piyabute Tanprasert, Thitipong Distributed and Parallel Computing Research Laboratory Faculty of Science and Technology Assumption University Bangkok Thailand

ISBN: (纸本)9783642326387

The original contour preserving classification technique was proposed to improve the robustness and weight fault tolerance of a neural network applied with a two-class linearly separable problem. It was recently found to be improving the level of accuracy of two-class classification. This paper presents an augmentation of the original technique to improve the level of accuracy of multi-class classification by better preservation of the shape or distribution model of a multi-class problem. The test results on six real world multi-class datasets from UCI machine learning repository present that the proposed technique supports multi-class data and can improve the level of accuracy of multi-class classification more effectively. © 2012 Springer-Verlag.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：