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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Simulation of Nuclear Reactor Accident Scenarios using Physics-Informed Neural Networks and Transfer-Learning 4

Simulation of Nuclear Reactor Accident Scenarios using Physi...

引用

4th International Conference on Electronic Information Engineering and Computer Science, EIECS 2024

作者： Yu, Yang Xie, Yufei Wang, Wenlin Wu, Guohua Lan, Haitao Lin, Enbo An, Ping Sun, Zibin Zhang, Haichuan Wu, Yixian National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing Changsha China Nuclear Power Institute of China Science and Technology on Reactor System Design Technology Laboratory Chengdu China School of Automation Wuhan University of Technology Wuhan China Sino-German College of Intelligent Manufacturing Shenzhen Technology University Shenzhen China Institute of Automotive Engineers Hubei University of Automotive Technology Shiyan China Nuclear Power Institute of China Chengdu China

ISBN: (纸本)9798331531409

In a Loss of Coolant Accident (LOCA), reactor core temperatures can rise rapidly, leading to potential fuel damage and radioactive material release. This research presents a groundbreaking method that combines the power of Monte Carlo Sampling and Physics-Informed Neural Networks (PINNs) to simulate and effectively address the challenging Loss of Coolant Accidents (LOCA) in nuclear reactors. In the event of a LOCA, reactor core temperatures can soar rapidly, posing a significant threat to fuel integrity and potentially leading to the release of radioactive materials. By leveraging the strengths of both Monte Carlo Sampling and PINNs, this approach aims to provide a comprehensive and accurate simulation framework for assessing and mitigating the consequences of such accidents. The method yields high prediction accuracy (MAE: 0.033, RMSE: 0.098, R2: 0.814) and demonstrates robustness through transfer learning, maintaining strong performance (MAE: 0.064, RMSE: 0.163, R2: 0.735). © 2024 IEEE.

关键词： Coolants

来源：评论

学校读者我要写书评

暂无评论

Optimizing Batched Small Matrix Multiplication on Multi-core DSP Architecture

Optimizing Batched Small Matrix Multiplication on Multi-core...

引用

International Symposium on parallel and distributed Processing with Applications, ISPA

作者： Xiaohan Zuo Chunhua Xiao Qinglin Wang Chen Shi College of Computer Science Chongqing University China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education China National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology Changsha China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

General Matrix Multiplication (GEMM) is a critical computational operation in scientific computing and machine learning domains. While traditional GEMM performs well on large matrices, it is inefficient in terms of data transfer and computation for small matrices. Many High-Performance computing (HPC) tasks can be decomposed into large batches of small matrix multiplication operations. Multi-core Digital Signal Processors (DSPs) are commonly used to accelerate high-performance computing. We present a design for batched fusion small matrix multiplication (BFMM) tailored for multi-core DSP architecture. To address the inefficiencies and redundancy in storage and computational operations associated with batch small matrix multiplications, we designed several strategies. We design a matrix fusion concatenation strategy, an access coordination mechanism, and a mechanism for fragment aggregation. BFMM supports an efficient K-dimension multi-core parallelization strategy. The parameter constraint model makes BFMM highly portable. BFMM also includes a performance evaluation model that facilitates assessment and verification. Experimental results demonstrate that, compared to traditional GEMM (TGEMM) on multi-core DSP and traditional GEMM with concatenated data access (TGEMM Op), BFMM exhibits superior performance. For large batches of small matrices, our design achieves 1.21x to 18x higher performance than TGEMM Op on single-core DSP, while on multi-core DSP, it outperforms TGEMM Op by 1.14x to 18.1x.

关键词： Performance evaluation Scientific computing High performance computing Digital signal processors Redundancy Batch production systems Signal processing algorithms Computer architecture Machine learning Matrix decomposition

来源：评论

学校读者我要写书评

暂无评论

Data management for large‐scale scientific computations in high performance distributed systems

引用

Cluster computing 2000年第1期3卷 45-60页

作者： Choudhary, A. Kandemir, M. No, J. Memik, G. Shen, X. Liao, W. Nagesh, H. More, S. Taylor, V. Thakur, R. Stevens, R. Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston USA Department of Computer Science and Engineering The Pennsylvania State University University Park USA Mathematics and Computer Science Division Argonne National Laboratory Argonne USA

With the increasing number of scientific applications manipulating huge amounts of data, effective high-level data management is an increasingly important problem. Unfortunately, so far the solutions to the high‐level data management problem either require deep understanding of specific storage architectures and file layouts (as in high-performance file storage systems) or produce unsatisfactory I/O performance in exchange for ease-of-use and portability (as in relational DBMSs). In this paper we present a novel application development environment which is built around an active meta-data management system (MDMS) to handle high-level data in an effective manner. The key components of our three-tiered architecture are user application, the MDMS, and a hierarchical storage system (HSS). Our environment overcomes the performance problems of pure database-oriented solutions, while maintaining their advantages in terms of ease-of-use and portability. The high levels of performance are achieved by the MDMS, with the aid of user-specified, performance-oriented directives. Our environment supports a simple, easy-to-use yet powerful user interface, leaving the task of choosing appropriate I/O techniques for the application at hand to the MDMS. We discuss the importance of an active MDMS and show how the three components of our environment, namely the application, the MDMS, and the HSS, fit together. We also report performance numbers from our ongoing implementation and illustrate that significant improvements are made possible without undue programming effort.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Isolation Forest for Anomaly Detection

arXiv

引用

arXiv 2022年

作者： Xu, Hongzuo Pang, Guansong Wang, Yijie Wang, Yongjun The College of Computer National University of Defense Technology Changsha410073 China The Science and Technology on Parallel and Distributed Processing Laboratory China The School of Computing and Information Systems Singapore Management University 178902 Singapore

Isolation forest (iForest) has been emerging as arguably the most popular anomaly detector in recent years due to its general effectiveness across different benchmarks and strong scalability. Nevertheless, its linear axis-parallel isolation method often leads to (i) failure in detecting hard anomalies that are difficult to isolate in high-dimensional/non-linear-separable data space, and (ii) notorious algorithmic bias that assigns unexpectedly lower anomaly scores to artefact regions. These issues contribute to high false negative errors. Several iForest extensions are introduced, but they essentially still employ shallow, linear data partition, restricting their power in isolating true anomalies. Therefore, this paper proposes deep isolation forest. We introduce a new representation scheme that utilises casually initialised neural networks to map original data into random representation ensembles, where random axis-parallel cuts are subsequently applied to perform the data partition. This representation scheme facilitates high freedom of the partition in the original data space (equivalent to non-linear partition on subspaces of varying sizes), encouraging a unique synergy between random representations and random partition-based isolation. Extensive experiments show that our model achieves significant improvement over state-of-the-art isolation-based methods and deep detectors on tabular, graph and time series datasets;our model also inherits desired scalability from iForest. © 2022, CC BY.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

RuleRAG: Rule-Guided Retrieval-Augmented Generation with Language Models for Question Answering

arXiv

引用

arXiv 2024年

作者： Chen, Zhongwu Xu, Chengjin Wang, Dingmin Huang, Zhen Dou, Yong Jiang, Xuhui Guo, Jian National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology National University of Defense Technology China IDEA Research International Digital Economy Academy Department of Computer Science University of Oxford United Kingdom

Retrieval-augmented generation (RAG) has shown promising potential in knowledge intensive question answering (QA). However, existing approaches only consider the query itself, neither specifying the retrieval preferences for the retrievers nor informing the generators of how to refer to the retrieved documents for the answers, which poses a significant challenge to the QA performance. To address these issues, we propose Rule-guided Retrieval-Augmented Generation with LMs, which explicitly introduces rules for in-context learning (RuleRAG-ICL) to guide retrievers to recall related documents in the directions of rules and uniformly guide generators to reason attributed by the same rules. The combination of queries and rules can be used as fine-tuning data to update retrievers and generators, achieving better rule-based instruction-following ability (RuleRAG-FT). Moreover, most existing RAG datasets were constructed without considering rules and Knowledge Graphs (KGs) are recognized as providing high-quality rules. Therefore, we construct five rule-aware RAG benchmarks for QA, RuleQA, based on KGs to stress the significance of retrieval and reasoning with rules. Experiments on RuleQA demonstrate RuleRAG-ICL improves the retrieval quality of +89.2% in Recall@10 and answer accuracy of +103.1% in Exact Match, and RuleRAG-FT yields more enhancement. In addition, experiments on four existing RAG datasets show RuleRAG is also effective by offering rules in RuleQA to them, further proving the generalization of rule guidance in RuleRAG. Code and RuleQA are at https://***/r/RuleRAG. Copyright © 2024, The Authors. All rights reserved.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

distributed Relation Discovery in Internet of Things

Distributed Relation Discovery in Internet of Things

引用

International Conference on Cloud computing and Big Data (CCBD)

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

ISBN: (纸本)9781479966226

Internet of things is an emerging technology that aims to connect various smart objects in our daily life. It facilitates the information exchange and control among objects. In the Internet of things, it is important to discover various relations among objects for analyzing and mining useful knowledge. Existing works on relation discovery mainly focus on centralized processing. It is not suitable for Internet of things due to unavailable of server, one-point failure, computation bottleneck, and security and business concerns. In this paper, we propose a distributed approach to discover the relations among objects in Internet of things. We first build the distritbuted system model which may include multiple relation discovery tasks. Based on that, we design an approach utilizing distributed spanning tree to extract the relations. Rather than sending all the information to the server, the objects only need to send the information to a local leader object in our algorithm. We also discuss more about how to improve the performance of the proposed approach and how to relax the system constraints. Extensive simulation have been done and the results show that the proposed approach outperforms existing approaches in terms of the data amount of transmission.

关键词： Internet of things Synchronization Buildings Servers Algorithm design and analysis Delays

来源：评论

学校读者我要写书评

暂无评论

Improving unsupervised domain adaptation by reducing bi-level feature redundancy

arXiv

引用

arXiv 2020年

作者： Wang, Mengzhu Zhang, Xiang Lan, Long Wang, Wei Tan, Huibin Luo, Zhigang Science and Technology on Parallel and Distributed Laboratory College of Computer National University of Defense Technology Changsha China Institute for Quantum State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China DUT-RU International School of Information Science & Engineering Dalian University of Technology DalianLiaoning116000 China Department of Science and Technology on Parallel and Distributed Processing National University of Defense Technology Changsha China

Reducing feature redundancy has shown beneficial effects for improving the accuracy of deep learning models, thus it is also indispensable for the models of unsupervised domain adaptation (UDA). Nevertheless, most recent efforts in the field of UDA ignore this point. Moreover, main schemes realizing this in general independent of UDA purely involve a single domain, thus might not be effective for cross-domain tasks. In this paper, we emphasize the significance of reducing feature redundancy for improving UDA in a bi-level way. For the first level, we try to ensure compact domain-specific features with a transferable decorrelated normalization module, which preserves specific domain information whilst easing the side effect of feature redundancy on the sequel domain-invariance. In the second level, domain-invariant feature redundancy caused by domain-shared representation is further mitigated via an alternative brand orthogonality for better generalization. These two novel aspects can be easily plugged into any BN-based backbone neural networks. Specifically, simply applying them to ResNet50 has achieved competitive performance to the state-of-the-arts on five popular benchmarks. Our code will be available at https://***/dreamkily/gUDA. © 2020, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

FedHybrid: Hierarchical Hybrid Training for High-Performance Federated Learning

FedHybrid: Hierarchical Hybrid Training for High-Performance...

引用

IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON)

作者： Tao Chang Li Li Meihan Wu Wei Yu Xiaodong Wang National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology China State Key Laboratory of Internet of Things for Smart City University of Macau China The 30th Research Institute of China Electronics Technology Group Corporation China

Federated Learning coordinates multiple devices to train a shared model while preserving data privacy. Despite its potential benefit, the increasing number of participating devices poses new challenges to the deployment in real-world cases. The highly limited amount of data located on each device coupled with significantly unbalanced data across different devices severely impede the performance of the shared model and the overall training progress at the same *** this paper, we propose FedHybrid, a hierarchical hybrid training framework for high-performance Federated Learning on a wide scale. Unlike the existing work that mainly focuses on the statistical challenge, FedHybrid establishes a hierarchical hybrid training framework that effectively utilizes the fragmented and unbalanced data located on the participating devices on a wide scale. Specifically, FedHybrid consists of the following two core components, a global coordinator deployed on the central server and a local coordinator deployed on each participating device. The global coordinator organizes the participating devices into different groups through jointly considering the system heterogeneity and unbalanced training data in order to accelerate the overall training progress while guaranteeing the model performance. Within each group, a novel device-to-device (D2D) sequential training procedure is coordinated by the local coordinator to effectively utilize the fragmented and unbalanced training data in order to intelligently update the local models. At the same time, we provide the theoretical analysis of FedHybrid and conduct extensive experiments to evaluate its effectiveness. The results show that FedHybrid effectively improves model accuracy up to 27% and accelerates the whole training process by 20% on average.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：