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

IEEE International Conference on Joint Cloud Computing (JCC)

作者： Jiacheng Yang Guodong Yi Fei Gao Peichang Shi Huaimin Wang National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China Xiangjiang Lab Changsha China School of Advanced Interdisciplinary Studies Hunan University Of Technology and Business Changsha China

ISBN: (数字)9798350387339

ISBN: (纸本)9798350387346

With the rapid growth of large language models, cloud computing has become an indispensable component of the AI industry. Cloud service providers(CSPs) are establishing AI data centers to service AI workloads. In the face of this surging need for AI computing power, building a connected computing environment across various clouds and forming a JointCloud presents an attractive solution. However, scheduling AI tasks across multiple AI data centers within a JointCloud environment presents a significant challenge: how to balance users’ demands while ensuring CSPs’ fairness in scheduling. Existing research primarily focuses on optimizing scheduling quality with limited consideration for fairness. Therefore, this paper proposes a Fairness-Aware AI-Workloads Allocation method (F3A), a fair cross-cloud allocation technique for AI tasks. F3A utilizes Point and Token to reflect both the resource status and historical task allocations of AI data centers, enabling the consideration of users’ multidimensional demands and facilitating fair task allocation across multiple centers. In order to better assess the fairness of scheduling, we also devised a fairness indicator(FI), based on the Gini coefficient to measure the fairness of task allocation. The experimental results demonstrate that F3A consistently maintains FI within 0.1 across various cluster sizes and different task quantities, representing an improvement of 76.45% compared to classical fair scheduling algorithms round-robin. F3A exhibits commendable performance in ensuring fairness in task allocation while also demonstrating effectiveness in cost reduction and enhancing user satisfaction.

关键词： Industries Data centers Cloud computing Job shop scheduling Costs Scheduling algorithms Large language models

来源：评论

学校读者我要写书评

暂无评论

DCSA: The Deployment Mechanism of Chained Serverless Applications in JointCloud Environment

DCSA: The Deployment Mechanism of Chained Serverless Applica...

引用

IEEE International Conference on Joint Cloud Computing (JCC)

作者： Yaojie Li Peichang Shi Jianfei Liu Rui Li Fei Gao Penghui Ma Dong Xie Guodong Yi National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China Xiangjiang Lab Changsha China School of Advanced Interdisciplinary Studies Hunan University Of Technology and Business Changsha China

ISBN: (数字)9798350387339

ISBN: (纸本)9798350387346

Serverless computing, comprised of Function as a Service (FaaS) and Backend as a Service (BaaS), has garnered widespread attention owning to its features such as maintenance-free operations, pay-per-use pricing, and automatic scalability. However, practical usage encounters several challenges: 1) The diversity of user applications makes comprehensive performance evaluation difficult, as benchmark and application tests only reflect performance under specific conditions and cannot fully capture users’ actual experiences across different serverless platforms. 2) Disparities in performance and costs across different serverless platforms make it challenging to achieve optimal performance and cost efficiency through single-cloud deployment, thereby underutilizing the advantages of each platform. 3) Vendor lock-in issues restrict the migration of user applications and exacerbate dependence on a single cloud *** address these challenges, this paper proposes a collaborative mechanism, referred to as DCSA, which integrates FaaS and storage services to achieve automatic cross-cloud deployment of user applications while considering both performance and cost comprehensively. Firstly, we adapt the interfaces of different serverless platforms, effectively reducing the complexity of cross-cloud deployment. Secondly, we develop cost and latency models for the cross-cloud deployment of chained serverless applications and propose a deployment scheduling algorithm that simultaneously considers both latency and cost. Finally, we conduct experiments to evaluate the performance of the proposed algorithm. Results demonstrate that our method can effectively reduce latency (up to 2.3%) and lower costs (up to 9.9%).

关键词： Performance evaluation Adaptation models Costs Scheduling algorithms Scalability Serverless computing Collaboration

来源：评论

学校读者我要写书评

暂无评论

Development Progress of SWLBM a Framework Based on Lattice Boltzmann Method for Fluid Dynamics Simulation 1

引用

18th International Symposium on Applied Reconfigurable Computing, ARC 2022

作者： Xuesen, Chu Xiang, He Fang, Li Zhao, Liu Guangwen, Yang Department of Computer Science and Technology Tsinghua University Beijing100084 China China Ship Scientific Research Center Wuxi214082 China Taihu Laboratory of DeepSea Technological Science Wuxi214082 China Jiangnan Institute of Computing Technology Wuxi214083 China National Research Center of Parallel Computer Engineering and Technology Beijing100084 China National Supercomputing Center in Wuxi Wuxi214072 China

ISBN: (数字)9783031199837

ISBN: (纸本)9783031199820

SWLBM is a software framework based on Lattice Boltzmann Method (LBM) for Computational Fluid Dynamic (CFD) running on Sunway many-core processors. In this paper, we review the achievements of code developing in early stage and introduce the development progress recently of this software, including the development of parallel optimization for Sunway new-generation supercomputing system, functional extensions of the software like pre-process function for mesh generation from a geometry file with STL file and BMP file, Immersed boundary condition for moving subject simulation. Some applications with SWLBM will be introduced to show the advantage of this software over other CFD code in large-scale simulations. SWLBM is still under development, with the continuous improvement of functions, it will play a greater role in the field of fluid simulation. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

A Distributed Computing Framework Based on Lightweight Variance Reduction Method to Accelerate Machine Learning Training on Blockchain

引用

China Communications 2020年第9期17卷 77-89页

作者： Zhen Huang Feng Liu Mingxing Tang Jinyan Qiu Yuxing Peng Science and Technology on Parallel and Distributed Laboratory National University of Defense TechnologyChangsha 410000China H.R.Support Center PLABeijing 100000China

To security support large-scale intelligent applications,distributed machine learning based on blockchain is an intuitive solution ***,the distributed machine learning is difficult to train due to that the corresponding optimization solver algorithms converge slowly,which highly demand on computing and memory *** overcome the challenges,we propose a distributed computing framework for L-BFGS optimization algorithm based on variance reduction method,which is a lightweight,few additional cost and parallelized scheme for the model training *** validate the claims,we have conducted several experiments on multiple classical *** show that our proposed computing framework can steadily accelerate the training process of solver in either local mode or distributed mode.

关键词： machine learning optimization algorithm blockchain distributed computing variance reduction

来源：评论

学校读者我要写书评

暂无评论

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

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Proposing an intelligent mesh smoothing method with graph neural networks

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

A Class of Fast and Accurate Multi-layer Block Summation and Dot Product Algorithms 18th

A Class of Fast and Accurate Multi-layer Block Summation a...

引用

18th IFIP WG 10.3 International Conference on Network and parallel Computing, NPC 2021

作者： He, Kang Barrio, Roberto Chen, Lin Jiang, Hao Liu, Jie Gu, Tongxiang Qi, Jin Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Department of Applied Mathematics University of Zaragoza ZaragozaE50009 Spain College of Computer National University of Defense Technology Changsha410073 China Institute of Applied Physics and Computational Mathematics Beijing100000 China

ISBN: (纸本)9783030935702

Basic recursive summation and common dot product algorithm have a backward error bound that grows linearly with the vector dimension. Blanchard [1] proposed a class of fast and accurate summation and dot product algorithms respectively called FABsum and FABdot, which trades off the calculation accuracy and speed by the block size. Castaldo [2] proposed a multi-layer block summation and dot product algorithm called SuperBlocksum and SuperBlockdot that can increase the accuracy while adding almost no additional calculations. We combine the idea of [1] with the multi-layer block structure to propose SuperFABsum (for "super fast and accurate block summation") and SuperFABdot (for "super fast and accurate block dot product"). Our algorithms have two variants, one is SuperFAB(within), the other is SuperFAB(outside). Our algorithms further improve accuracy and speed compared with FAB and SuperBlock. We conducted accuracy and speed tests on the high-performance FT2000+ processor. Experimental results show that SuperFABdot(within) algorithm is more accurate than FABdot and SuperBlockdot. Compared with FABdot, SuperFABdot(outside) algorithm can achieve up to 1.2 × performance speedup while ensuring similar accuracy. © 2022, IFIP International Federation for Information Processing.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

DFBuffer: High-performance data forwarding software optimized for single-process I/O scenarios

DFBuffer: High-performance data forwarding software optimize...

引用

International Conference on parallel and Distributed Systems (ICPADS)

作者： Xiaobin He Wei Xiao Xun Deng Qi Chen Bin Yang Zuoning Chen National Research Center of Parallel Computer Engineering & Technology Beijing China Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology Wuhan China Department of Computer Science and Technology Tsinghua University Beijing China Chinese Academy of Engineering Beijing China

Most supercomputers adopt a data forwarding architecture to achieve storage scalability. However, it results in a significant reduction in single-process bandwidth compared to direct file system access. Moreover, considering that a majority of applications uses only a single process for writing and reading data, the low single-process performance also leads to a time overhead for these applications. This paper proposes an userspace forwarding mechanism DFBUFFER with two performance optimization methods: user-space multi-thread request processing and data write buffer in a unit of file. The client of DFBUFFER is embedded in the application as a library reducing the software overhead, and the server implements multi-thread I/O request processing to improve bandwidth efficiency. The data write buffer can asynchronously handle write requests, which accelerates the write bandwidth of compute nodes. We evaluate DFBUFFER on the Sunway exascale prototype system. The results indicate that in the regular mode of DFBUFFER, both the write and read latency are reduced, and the write bandwidth and large-block read bandwidth of single-process are increased by 1.8 times and 2.8 times respectively. The DFBUFFER buffer mode increases the write bandwidth of a single process by 0.8 times over the regular mode. Although the performance advantage of the regular mode of DFBUFFER gradually weakens with the increase of concurrent processes, the DFBUFFER buffer mode has the effect of improving the write bandwidth, the 64-IO-processes application is increased by 0.2 times.

关键词： Spectral efficiency Scalability Prototypes Bandwidth Computer architecture Writing Software

来源：评论

学校读者我要写书评

暂无评论

A Study on a Novel Type of 2R1T parallel Mechanisms with Completely Separated Drive and Constraint Branches 24th

A Study on a Novel Type of 2R1T Parallel Mechanisms with Com...

引用

24th IFToMM China International Conference on Mechanism and Machine science and Engineering, IFToMM CCMMS 2024

作者： Qiu, Can Wang, Yu He, Xiaoyu Xu, Yundou Yao, Jiantao Zhao, Yongsheng Parallel Robot and Mechatronic System Laboratory of Hebei Province Yanshan University Qinhuangdao 066004 China Key Laboratory of Advanced Forging and Stamping Technology and Science of Ministry of National Education Yanshan University Qinhuangdao 066004 China

ISBN: (纸本)9789819614660

The drive branches only subjected to axial loads, while the external loads beyond the end-constrained space are collectively borne by multiple constraint branches. This type of 2R1T parallel mechanisms (PMs), compared to traditional counterparts, exhibit superior force and load-bearing performance, particularly in eccentric heavy-load conditions. This paper introduces a novel type of 2R1T PMs with completely separated drive and constraint branches, along with its type synthesis method. A kinematic and static analysis is conducted on the typical 3UPS-3SS PM, and a comparison is made between the force performance of the 3UPS-3SS PM and traditional 3RPS PM under eccentric heavy -load conditions. These mechanisms hold extensive application prospects in situations requiring pose adjustment under eccentric heavy-load force conditions. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Motion principle parallel mechanism Velocity mapping

来源：评论

学校读者我要写书评

暂无评论

An in-depth exploration of LAMOST Unknown spectra based on density clustering

arXiv

引用

arXiv 2023年

作者： Yang, Hai-Feng Yin, Xiao-Na Cai, Jiang-Hui Yang, Yu-Qing Luo, A-Li Bai, Zhong-Rui Zhou, Li-Chan Zhao, Xu-Jun Xun, Ya-Ling Shanxi Key Laboratory of Big Data Analysis and Parallel Computing Taiyuan University of Science and Technology Taiyuan030024 China School of Computer Science and Technology North University of China Taiyuan030051 China National Astronomical Observatories Chinese Academy of Sciences Beijing100101 China School of Computer Science and Technology Taiyuan University of Science and Technology Taiyuan030024 China

LAMOST (Large Sky Area Multi-Object Fiber Spectroscopic Telescope) has completed the observation of nearly 20 million celestial objects, including a class of spectra labeled ‘Unknown’. Besides low signal-to-noise ratio, these spectra often show some anomalous features that do not work well with current templates. In this paper, a total of 638,000 ‘Unknown’ spectra from LAMOST DR5 are selected, and an unsupervised-based analytical framework of ‘Unknown’ spectra named SA-Frame (Spectra Analysis-Frame) is provided to explore their origins from different perspectives. The SA-Frame is composed of three parts: NAPC-Spec clustering, characterization and origin analysis. First, NAPC-Spec(Nonparametric density clustering algorithm for spectra) characterizes different features in the"unknown" spectrum by adjusting the influence space and divergence distance to minimize the effects of noise and high dimensionality, resulting in 13 types. Second, characteristic extraction and representation of clustering results are carried out based on spectral lines and continuum, where these 13 types are characterized as regular spectra with low S/Ns, splicing problems, suspected galactic emission signals, contamination from city light and un-gregarious type respectively. Third, a preliminary analysis of their origins is made from the characteristics of the observational targets, contamination from the sky, and the working status of the instruments. These results would be valuable for improving the overall data quality of large-scale spectral surveys. Copyright © 2023, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：