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

GNNRL-Smoothing: A Prior-Free Reinforcement Learning Model for Mesh Smoothing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Zhichao C. Chen, Xinhai C. Gong, Chunye Y. Yang, Bo Deng, Liang Sun, Yufei F. Pang, Yufei F. Liu, Jie National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory China National University of Defense Technology Laboratory of Digitizing Software for Frontier Equipment China China Aerodynamics Research and Development Center China Nankai University College of Software China

Mesh smoothing methods can enhance mesh quality by eliminating distorted elements, leading to improved convergence in simulations. To balance the efficiency and robustness of traditional mesh smoothing process, previous approaches have employed supervised learning and reinforcement learning to train intelligent smoothing models. However, these methods heavily rely on labeled dataset or prior knowledge to guide the models’ learning. Furthermore, their limited capacity to enhance mesh connectivity often restricts the effectiveness of smoothing. In this paper, we first systematically analyze the learning mechanisms of recent intelligent smoothing methods and propose a prior-free reinforcement learning model for intelligent mesh smoothing. Our proposed model integrates graph neural networks with reinforcement learning to implement an intelligent node smoothing agent and introduces, for the first time, a mesh connectivity improvement agent. We formalize mesh optimization as a Markov Decision Process and successfully train both agents using Twin Delayed Deep Deterministic Policy Gradient and Double Dueling Deep Q-Network in the absence of any prior data or knowledge. We verified the proposed model on both 2D and 3D meshes. Experimental results demonstrate that our model achieves feature-preserving smoothing on complex 3D surface meshes. It also achieves state-of-the-art results among intelligent smoothing methods on 2D meshes and is 7.16 times faster than traditional optimization-based smoothing methods. Moreover, the connectivity improvement agent can effectively enhance the quality distribution of the mesh. © 2024, CC BY.

关键词： Deep reinforcement learning

ST-PINN: A Self-Training Physics-Informed Neural Network for Partial Differential Equations

学校读者我要写书评

暂无评论

ST-PINN: A Self-Training Physics-Informed Neural Network for...

International Joint Conference on Neural Networks (IJCNN)

作者： Junjun Yan Xinhai Chen Zhichao Wang Enqiang Zhoui Jie Liu Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha China

Partial differential equations (PDEs) are an essential computational kernel in physics and engineering. With the advance of deep learning, physics-informed neural networks (PINNs), as a mesh-free method, have shown great potential for fast PDE solving in various applications. To address the issue of low accuracy and convergence problems of existing PINNs, we propose a self-training physics-informed neural network, ST-PINN. Specifically, ST-PINN introduces a pseudo label based self-learning algorithm during training. It employs governing equation as the pseudo-labeled evaluation index and selects the highest confidence examples from the sample points to attach the pseudo labels. To our best knowledge, we are the first to incorporate a self-training mechanism into physics-informed learning. We conduct experiments on five PDE problems in different fields and scenarios. The results demonstrate that the proposed method allows the network to learn more physical information and benefit convergence. The ST-PINN outperforms existing physics-informed neural network methods and improves the accuracy by a factor of 1.33x-2.54x.

关键词：

Fast and scalable in-network lock management using lock fission 24

学校读者我要写书评

暂无评论

Fast and scalable in-network lock management using lock fiss...

Proceedings of the 18th USENIX Conference on Operating Systems Design and Implementation

作者： Hanze Zhang Ke Cheng Rong Chen Haibo Chen Institute of Parallel and Distributed Systems SEIEE Shanghai Jiao Tong University and Shanghai AI Laboratory and MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Institute of Parallel and Distributed Systems SEIEE Shanghai Jiao Tong University and Engineering Research Center for Domain-specific Operating Systems Ministry of Education China Institute of Parallel and Distributed Systems SEIEE Shanghai Jiao Tong University and Shanghai AI Laboratory and Engineering Research Center for Domain-specific Operating Systems Ministry of Education China Institute of Parallel and Distributed Systems SEIEE Shanghai Jiao Tong University and Engineering Research Center for Domain-specific Operating Systems Ministry of Education China and Key Laboratory of System Software (Chinese Academy of Sciences)

ISBN: (纸本)9781939133403

distributed lock services are extensively utilized in distributed systems to serialize concurrent accesses to shared resources. The need for fast and scalable lock services has become more pronounced with decreasing task execution times and expanding dataset scales. However, traditional lock managers, reliant on server CPUs to handle lock requests, experience significant queuing delays in lock grant latency. Advanced network hardware (e.g. programmable switches) presents an avenue to manage locks without queuing delays due to their high packet processing power. Nevertheless, their constrained memory capacity restricts the manageable lock scale, thereby limiting their effect in large-scale *** paper presents FISSLOCK, a fast and scalable distributed lock service that exploits the programmable switch to improve (tail) latency and peak throughput for millions of locks. The key idea behind FISSLOCK is the concept of lock fission, which decouples lock management into grant decision and participant maintenance. FISSLOCK leverages the programmable switch to decide lock grants synchronously and relies on servers to maintain participants (i.e., holders and waiters) asynchronously. By using the programmable switch for routing, FISSLOCK enables on-demand fine-grained lock migration, thereby reducing the lock grant and release delays. FISSLOCK carefully designs and implements grant decision procedure on the programmable switch, supporting over one million locks. Evaluation using various benchmarks and a real-world application shows the efficiency of FISSLOCK. Compared to the state-of-the-art switch-based approach (NetLock), FISSLOCK cuts up to 79.1% (from 43.0%) of median lock grant time in the microbenchmark and improves transaction throughput for TATP and TPC-C by 1.76× and 2.28×, respectively.

关键词：

Sparse Matrix Reordering Method Selection with parallel Computing and Deep Learning

学校读者我要写书评

暂无评论

Sparse Matrix Reordering Method Selection with Parallel Comp...

International Joint Conference on Neural Networks (IJCNN)

作者： Rui Xia Jihu Guo Huajian Zhang Shun Yang Qinglin Wang Jie Liu College of Computer Science and Techonology National University of Defense Technology Changsha China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Sparse matrix reordering is an important step in Cholesky decomposition. By reordering the rows and columns of the matrix, the time of computation and storage cost can be greatly reduced. With the proposal of various reordering algorithms, the selection of suitable reordering methods for various matrices has become an important research topic. In this paper, we propose a method to predict the optimal reordering method by visualizing sparse matrices in chunks in a parallel manner and feeding them into a deep convolutional neural network. The results show that the theoretical performance can reach 95% of the optimal performance, the prediction accuracy of the method can reach up to 85%, the parallel framework achieves an average speedup ratio of 11.35 times over the serial framework, and the performance is greatly improved compared with the traversal selection method on large sparse matrices.

关键词： Deep learning Visualization Accuracy Costs Neural networks parallel processing Prediction algorithms

Feature and Performance Comparison of FaaS Platforms 14

学校读者我要写书评

暂无评论

Feature and Performance Comparison of FaaS Platforms

14th IEEE International Conference on software Engineering and Service Science, ICSESS 2023

作者： Ma, Penghui Shi, Peichang Yi, Guodong College of Computer Science National University of Defense Technology National Key Laboratory of Parallel and Distributed Processing Changsha410073 China College of Computer Science National University of Defense Technology Key Laboratory of Software Engineering for Complex Systems Changsha410073 China Xiangjiang Lab Changsha410073 China School of Advanced Interdisciplinary Studies Hunan University of Technology and Business Changsha410073 China

ISBN: (纸本)9798350336269

With serverless computing offering more efficient and cost-effective application deployment, the diversity of serverless platforms presents challenges to users, including platform lock-in and costly migration. Moreover, due to the black box nature of function computing, traditional performance benchmarking methods are not applicable, necessitating new studies. This article presents a detailed comparison of six major public cloud function computing platforms and introduces a benchmarking framework for function computing performance. This framework aims to help users make comprehensive comparisons and select the most suitable platform for their specific needs. © 2023 IEEE.

关键词： Benchmarking

AUXILIARY-TASKS LEARNING FOR PHYSICS-INFORMED NEURAL NETWORK-BASED PARTIAL DIFFERENTIAL EQUATIONS SOLVING

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yan, Junjun Chen, Xinhai Wang, Zhichao Zhou, Enqiang Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China

Physics-informed neural networks (PINNs) have emerged as promising surrogate modes for solving partial differential equations (PDEs). Their effectiveness lies in the ability to capture solution-related features through neural networks. However, original PINNs often suffer from bottlenecks, such as low accuracy and non-convergence, limiting their applicability in complex physical contexts. To alleviate these issues, we proposed auxiliary-task learning-based physics-informed neural networks (ATL-PINNs), which provide four different auxiliary-task learning modes and investigate their performance compared with original PINNs. We also employ the gradient cosine similarity algorithm to integrate auxiliary problem loss with the primary problem loss in ATL-PINNs, which aims to enhance the effectiveness of the auxiliary-task learning modes. To the best of our knowledge, this is the first study to introduce auxiliary-task learning modes in the context of physics-informed learning. We conduct experiments on three PDE problems across different fields and scenarios. Our findings demonstrate that the proposed auxiliary-task learning modes can significantly improve solution accuracy, achieving a maximum performance boost of 96.62% (averaging 28.23%) compared to the original single-task PINNs. The code and dataset are open source at https://***/junjun-yan/ATL-PINN. Copyright © 2023, The Authors. All rights reserved.

关键词： Partial differential equations

Bi-Objective Scheduling Algorithm for Hybrid Workflow in JointCloud

学校读者我要写书评

暂无评论

Bi-Objective Scheduling Algorithm for Hybrid Workflow in Joi...

IEEE International Conference on Joint Cloud Computing (JCC)

作者： Rui Li Huaimin Wang Peichang Shi National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China State Key Laboratory of Complex & Critica Software Environment College of Computer Science National University of Defense Technology Changsha China

ISBN: (数字)9798350387339

ISBN: (纸本)9798350387346

Big data workflows are widely used in IoT, recommended systems, and real-time vision applications, and they continue to grow in complexity. These hybrid workflows consist of both resource-intensive batch jobs and latency-sensitive stream jobs. Examples include the data analytics workflow, which incorporates batch data transformations and low-latency querying, and the machine learning workflow, which processes stream data feature extraction before performing batch training and low-latency inference. However, existing research on workflow scheduling primarily focuses on either stream or batch workflows, neglecting the efficient scheduling of hybrid workflows that respect their diverse resource requirements and the costly data transfers between *** this article, we propose a hybrid workflow model that defines the optimal placement of hybrid workflows (OHWP) as a bi-objective optimization problem. Our proposed model takes into account parameters related to inter-communication between stream and batch jobs, as well as the heterogeneous resources in JointCloud environment. Additionally, we present OHWP-PS (OHWP on a Pruned Space), a scheduling algorithm for hybrid workflows that minimizes both cost and latency by improving the initial population and dynamically updating the search space. The results demonstrate that the proposed OHWP-PS algorithm is effective and competitive across all experiments.

关键词： Training Scheduling algorithms Machine vision Heuristic algorithms Machine learning Feature extraction Remote working

ST-PINN: A Self-Training Physics-Informed Neural Network for Partial Differential Equations

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yan, Junjun Chen, Xinhai Wang, Zhichao Zhoui, Enqiang Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China

关键词： Learning algorithms

Proposing an intelligent mesh smoothing method with graph neural networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Zhichao Chen, Xinhai Yan, Junjun Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology National University of Defense Technology Changsha410073 China

In CFD, mesh smoothing methods are commonly utilized to refine the mesh quality to achieve high-precision numerical simulations. Specifically, optimization-based smoothing is used for high-quality mesh smoothing, but it incurs significant computational overhead. Pioneer works improve its smoothing efficiency by adopting supervised learning to learn smoothing methods from high-quality meshes. However, they pose difficulty in smoothing the mesh nodes with varying degrees and also need data augmentation to address the node input sequence problem. Additionally, the required labeled high-quality meshes further limit the applicability of the proposed method. In this paper, we present GMSNet, a lightweight neural network model for intelligent mesh smoothing. GMSNet adopts graph neural networks to extract features of the node's neighbors and output the optimal node position. During smoothing, we also introduce a fault-tolerance mechanism to prevent GMSNet from generating negative volume elements. With a lightweight model, GMSNet can effectively smoothing mesh nodes with varying degrees and remain unaffected by the order of input data. A novel loss function, MetricLoss, is also developed to eliminate the need for high-quality meshes, which provides a stable and rapid convergence during training. We compare GMSNet with commonly used mesh smoothing methods on two-dimensional triangle meshes. The experimental results show that GMSNet achieves outstanding mesh smoothing performances with 5% model parameters of the previous model, and attains 13.56 times faster than optimization-based smoothing. © 2023, CC BY.

关键词： Graph neural networks