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

Proceedings of the 23rd USENIX Conference on File and Storage Technologies

作者： Zhuohui Duan Hao Feng Haikun Liu Xiaofei Liao Hai Jin Bangyu Li National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781939133458

The key-value separation is renowned for its significant mitigation of the write amplification inherent in traditional LSM trees. However, KV separation potentially increases performance overhead in the management of Value region, especially for garbage collection (GC) operation that is used to reduce the redundant space occupation. In response, many efforts have been made to optimize the GC mechanism for KV separation. However, our analysis indicates that such solution based on trade-offs between CPU and I/O overheads cannot simultaneously satisfy the three requirements of KV separated systems in terms of throughput, tail latency, and space usage. This limitation hinders their real-world *** this paper, we introduce AegonKV, a "three-birds-one-stone" solution that comprehensively enhances the throughput, tail latency, and space usage of KV separated systems. AegonKV first proposes a SmartSSD-based GC offloading mechanism to enable asynchronous GC operations without competing with LSM read/write for bandwidth or CPU. AegonKV leverages offload-friendly data structures and hardware/ software execution logic to address the challenges of GC offloading. Experiments demonstrate that AegonKV achieves the largest throughput improvement of 1.28-3.3 times, a significant reduction of 37%-66% in tail latency, and 15%-85% in space overhead compared to existing KV separated systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LibAMM: Empirical Insights into Approximate Computing for Accelerating Matrix Multiplication 38

LibAMM: Empirical Insights into Approximate Computing for Ac...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zeng, Xianzhi Jiang, Wenchao Zhang, Shuhao National Engineering Research Center for Big DataTechnology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Nanyang Technological University Singapore Singapore University of Technology and Design Singapore

Matrix multiplication (MM) is pivotal in fields from deep learning to scientific computing, driving the quest for improved computational efficiency. Accelerating MM encompasses strategies like complexity reduction, parallel and distributed computing, hardware acceleration, and approximate computing techniques, namely AMM algorithms. Amidst growing concerns over the resource demands of large language models (LLMs), AMM has garnered renewed focus. However, understanding the nuances that govern AMM's effectiveness remains incomplete. This study delves into AMM by examining algorithmic strategies, operational specifics, dataset characteristics, and their application in real-world tasks. Through comprehensive testing across diverse datasets and scenarios, we analyze how these factors affect AMM's performance, uncovering that the selection of AMM approaches significantly influences the balance between efficiency and accuracy, with factors like memory access playing a pivotal role. Additionally, dataset attributes are shown to be vital for the success of AMM in applications. Our results advocate for tailored algorithmic approaches and careful strategy selection to enhance AMM's effectiveness. To aid in the practical application and ongoing research of AMM, we introduce LibAMM -a toolkit offering a wide range of AMM algorithms, benchmarks, and tools for experiment management. LibAMM aims to facilitate research and application in AMM, guiding future developments towards more adaptive and context-aware computational solutions. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scenario, Role, and Persona: A Scoping Review of Design Strategies for Socially Intelligent AI Agents

Scenario, Role, and Persona: A Scoping Review of Design Stra...

引用

2025 CHI Conference on Human Factors in Computing Systems, CHI EA 2025

作者： Niu, Ruowen Hu, Jiaxiong Peng, Siyu Cao, Caleb Chen Liu, Chengzhong Han, Sirui Guo, Yike Hong Kong Generative AI Research and Development Center Hong Kong Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong The Hong Kong University of Science and Technology Hong Kong Big Data Institute Hong Kong University of Science and Technology Hong Kong

ISBN: (纸本)9798400713958

As artificial intelligence (AI) agents have often been perceived as social actors, there is a growing expectation for them to demonstrate social intelligence. Social intelligence encompasses the ability of AI agents to align their actions with human intentions and behave in socially and culturally appropriate ways. This study conducts a scoping review to analyze the design strategies employed in current AI agent designs that support the exhibition of social intelligence. Our findings reveal three design strategy themes that interdependently and collectively shape the capabilities and behaviors of AI agents: scenario, role, and persona. These findings provide a structured perspective and actionable insights for designing AI agents that effectively integrate social intelligence into human-AI interactions. © 2025 Copyright held by the owner/author(s).

关键词： AI Agents Design Strategy Scoping Review Social Intelligence

来源：评论

学校读者我要写书评

暂无评论

A Real-time Demonstration of Bidirectional Multiformat/Rate-adjustable Integrated Laser Communication/Ranging for Satellite Communication

A Real-time Demonstration of Bidirectional Multiformat/Rate-...

引用

CLEO: science and Innovations in CLEO 2024, CLEO: S and I 2024 - Part of Conference on Lasers and Electro-Optics

作者： Wang, Yizhou Wang, Yuanxiang Luo, Zhen Zhong, Linsheng Zou, Yang Ao, Xueyuan Liu, Jiale Fan, Feng Li, Xiaoliang Dai, Xiaoxiao Yang, Qi Liu, Deming National Engineering Laboratory for Next Generation Internet Access System School of Optical and Electronic Information Huazhong University of Science and Technology Wuhan430074 China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science andEngineering Huazhong University of Science and Technology Wuhan430074 China Beijing Research Institute of Telemetry Beijing100094 China Jinyinhu Laboratory Wuhan430040 China

A multi-format/rate-adjustable integrated laser communication/ranging system is proposed, achieving adjustable rates between 0.625-10Gbit/s. Real-time experiment shows that at 1e-4 BER the ranging error is only 0.29% ... 详细信息

关键词： Satellite communication systems

来源：评论

学校读者我要写书评

暂无评论

TERMS: Task management policies to achieve high performance for mixed workloads using surplus resources

引用

Journal of Parallel and Distributed Computing 2022年第0期170卷 74-85页

作者： Yu, Jinyu Tong, Wei Lv, Pengze Feng, Dan Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology School of Computer Science and Technology Huazhong University of Science and Technology Ministry of Education of China Hubei Wuhan China

Resource contentions and performance interferences can lead to workload performance degradation in mixed-workload deployment clusters. Previous work guarantees the resource requirements of latency-sensitive tasks and reduces performance losses to batch jobs by reclaiming surplus resources from over-provisioned tasks. While the fragmentation of resources leads to a mismatch between provisioned resources and task requirements, resulting in high operation overheads and losses of task fairness. This paper proposes TERMS, the task management policies based on task relevance, resource distribution, and task fairness to achieve efficient and low-cost task management. TERMS mainly includes three types of management policies. The task scheduling policy can schedule new tasks according to task relevance. Task selection strategies select tasks for resource provisioning and task resumption based on resource requirements and task fairness. If necessary, the node selection strategy can be used to choose befitting target nodes based on task relevance and node resource information for task migration when eliminating straggler tasks. Evaluation results show that TERMS can further improve the performance of latency-sensitive services and batch jobs, reduce management overheads, and avoid operation failures. © 2022 Elsevier Inc.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

FedEdge: Accelerating Edge-Assisted Federated Learning 23

FedEdge: Accelerating Edge-Assisted Federated Learning

引用

2023 World Wide Web Conference, WWW 2023

作者： Wang, Kaibin He, Qiang Chen, Feifei Jin, Hai Yang, Yun School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computing Technologies Swinburne University of Technology Australia School of Information Technology Deakin University Australia National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781450394161

Federated learning (FL) has been widely acknowledged as a promising solution to training machine learning (ML) model training with privacy preservation. To reduce the traffic overheads incurred by FL systems, edge servers have been included between clients and the parameter server to aggregate clients' local models. Recent studies on this edge-assisted hierarchical FL scheme have focused on ensuring or accelerating model convergence by coping with various factors, e.g., uncertain network conditions, unreliable clients, heterogeneous compute resources, etc. This paper presents our three new discoveries of the edge-assisted hierarchical FL scheme: 1) it wastes significant time during its two-phase training rounds;2) it does not recognize or utilize model diversity when producing a global model;and 3) it is vulnerable to model poisoning attacks. To overcome these drawbacks, we propose FedEdge, a novel edge-assisted hierarchical FL scheme that accelerates model training with asynchronous local federated training and adaptive model aggregation. Extensive experiments are conducted on two widely-used public datasets. The results demonstrate that, compared with state-of-the-art FL schemes, FedEdge accelerates model convergence by 1.14 × -3.20 ×, and improves model accuracy by 2.14% - 6.63%. © 2023 ACM.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

PSMiner: A Pattern-Aware Accelerator for High-Performance Streaming Graph Pattern Mining 23

PSMiner: A Pattern-Aware Accelerator for High-Performance St...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Hao Qi Yu Zhang Ligang He Kang Luo Jun Huang Haoyu Lu Jin Zhao Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China and Zhejiang-HUST Joint Research Center for Graph Processing Zhejiang Lab China Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)9798350323481

Streaming Graph Pattern Mining (GPM) has been widely used in many application fields. However, the existing streaming GPM solution suffers from many unnecessary explorations and isomorphism tests, while the existing static GPM ones require many repetitive operations to compute the full graph. In this paper, we propose a pattern-aware incremental execution approach and design the first streaming GPM accelerator called PSMiner, which integrates multiple optimizations to reduce redundant computation and improve computing efficiency. We have conducted extensive experiments. The results show that compared with the state-of-the-art software and hardware solutions, PSMiner achieves the average speedups of 770.9× and 60.4×, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Client Selection Method Based on Loss Function Optimization for Federated Learning

引用

computer Modeling in engineering & sciences 2023年第10期137卷 1047-1064页

作者： Yan Zeng Siyuan Teng Tian Xiang Jilin Zhang Yuankai Mu Yongjian Ren Jian Wan School of Computer Science and Technology Hangzhou Dianzi UniversityHangzhou310018China Key Laboratory of Complex System Modeling and Simulation Ministry of EducationHangzhou310018China Zhejiang Engineering Research Center of Data Security Governance Hangzhou310018China Intelligent Robotics Research Center Zhejiang LabHangzhou311100China HDU-ITMO Joint Institute Hangzhou Dianzi UniversityHangzhou310018China

Federated learning is a distributedmachine learningmethod that can solve the increasingly serious problemof data islands and user data privacy,as it allows training data to be kept locally and not shared with other *** trains a globalmodel by aggregating locally-computedmodels of clients rather than their ***,the divergence of local models caused by data heterogeneity of different clients may lead to slow convergence of the global *** this problem,we focus on the client selection with federated learning,which can affect the convergence performance of the global model with the selected local *** propose FedChoice,a client selection method based on loss function optimization,to select appropriate local models to improve the convergence of the global *** firstly sets selected probability for clients with the value of loss function,and the client with high loss will be set higher selected probability,which can make them more likely to participate in ***,it introduces a local control vector and a global control vector to predict the local gradient direction and global gradient direction,respectively,and calculates the gradient correction vector to correct the gradient direction to reduce the cumulative deviationof the local gradient causedby *** experiments to verify the validity of FedChoice on CIFAR-10,CINIC-10,MNIST,EMNITS,and FEMNIST datasets,and the results show that the convergence of FedChoice is significantly improved,compared with FedAvg,FedProx,and FedNova.

关键词： Federated learning model aggregation Non-IID

来源：评论

学校读者我要写书评

暂无评论

Opportunistic Network Routing Strategy Based On Node Sleep Mechanism

Opportunistic Network Routing Strategy Based On Node Sleep M...

引用

IEEE Annual International computer Software and Applications Conference (COMPSAC)

作者： Zhuoyuan Li Danjie Bao Xiaodong Xu Feng Zhang Gang Xu College of Computer Science Inner Mongolia University Hohhot China The Engineering Research Center of Ecological Big Data Ministry of Education China School of Computer and Information Technology Shanxi University Taiyuan China

ISBN: (数字)9798350376968

ISBN: (纸本)9798350376975

Opportunity networks are wireless AD-hoc networks deployed in complex and harsh environments. To mitigate energy loss in opportunistic network routing, we propose a model called Nodes Sleep Scheduling based on Q-learning (NSQ) by combining the node sleep mechanism with classical opportunistic network routing algorithms when the nodes in the network have sufficient buffer space. In the NSQ model, the node sleep scheduling process is modeled as a Markov decision process, the corresponding state set, action set and reward function are defined, and the Q-learning algorithm iterates the value function. The model continuously iterates and converges through the self-learning process of the value function in the nodes, autonomously learns, and ultimately obtains an optimal sleep scheduling strategy. The experimental results show that the NSQ model can effectively reduce nodes' energy consumption and has certain self-learning abilities compared with other node sleep scheduling strategies.

关键词： Wireless communication Energy consumption Q-learning Processor scheduling Markov decision processes Software algorithms Routing

来源：评论

学校读者我要写书评

暂无评论

SymILO: A Symmetry-Aware Learning Framework for Integer Linear Optimization

arXiv

引用

arXiv 2024年

作者： Chen, Qian Zhang, Tianjian Yang, Linxin Han, Qingyu Wang, Akang Sun, Ruoyu Luo, Xiaodong Chang, Tsung-Hui School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data China School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen International Center For Industrial And Applied Mathematics Shenzhen Research Institute of Big Data China

Integer linear programs (ILPs) are commonly employed to model diverse practical problems such as scheduling and planning. Recently, machine learning techniques have been utilized to solve ILPs. A straightforward idea is to train a model via supervised learning, with an ILP as the input and an optimal solution as the label. An ILP is symmetric if its variables can be permuted without changing the problem structure, resulting in numerous equivalent and optimal solutions. Randomly selecting an optimal solution as the label can introduce variability in the training data, which may hinder the model from learning stable patterns. In this work, we incorporate the intrinsic symmetry of ILPs and propose a novel training framework called SymILO. Specifically, we modify the learning task by introducing solution permutation along with neural network weights as learnable parameters and then design an alternating algorithm to jointly optimize the loss function. We conduct extensive experiments on ILPs involving different symmetries and the computational results demonstrate that our symmetry-aware approach significantly outperforms three existing methods—-achieving 50.3%, 66.5%, and 45.4% average improvements, respectively. Copyright © 2024, The Authors. All rights reserved.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：