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

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

来源：评论

学校读者我要写书评

暂无评论

Study on Landslide Susceptibility Evaluation Based on Improved Multivariable Weighted Model: A Case Study of Lushan County, China 3

Study on Landslide Susceptibility Evaluation Based on Improv...

引用

3rd IEEE International Conference on Software engineering and Artificial Intelligence, SEAI 2023

作者： Zhao, Li Duan, Gonghao Wuhan Institute of Technology School of Computer Science and Engineering Wuhan China Automation for Complex Systems Hubei Key Laboratory of Advanced Control and Intelligent Wuhan China

ISBN: (纸本)9798350337952

The evaluation of regional geological hazard susceptibility is of great significance to the prevention and control of geological hazard. In this paper, the "4-20"Lushan earthquake disaster area as the research area, combined with GIS and characteristics of the research area, through correlation analysis, selected 9 influencing factors as the evaluation factors. The study was conducted using a weighted information volume-logistic regression model (WI-LR). The results were classified into five sensitivity levels: very low, low, medium, high and very high. The results show that the landslide prone areas in Lushan County are concentrated in the area below the middle of the county seat, mostly near rivers, faults and areas with peak acceleration greater than 0.4. Among them, WI-LR model (AUC=0.918) > deterministic factor model (CF =0.908) > weighted information quantity model (WI) (AUC=0.896) > information quantity model I (AUC=0.853) > information quantity logistic regression model I-LR (AUC=0.799). It indicates that WI-LR model has high evaluation accuracy. © 2023 IEEE.

关键词： Hazards

来源：评论

学校读者我要写书评

暂无评论

Seastar: A Cache-Efficient and Load-Balanced Key-Value Store on Disaggregated Memory

Seastar: A Cache-Efficient and Load-Balanced Key-Value Store...

引用

2024 IEEE International Conference on Cluster Computing, CLUSTER 2024

作者： Du, Jingwen Wang, Fang Feng, Dan Zeng, Dexin Yi, Sheng Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System China School of Computer Science and Technology Huazhong University of Science and Technology China Shenzhen Huazhong University of Science and Technology Research Institute China

ISBN: (纸本)9798350358711

In modern datacenters, memory disaggregation un-packs monolithic servers to build independent network-connected compute and memory pools, greatly improving resource uti-lization. Existing memory-disaggregated key-value stores adopt ownership sharing or ownership partitioning for request scheduling and they all show poor performance and scalability. The former generates multiple cache misses and multiple network round trips due to poor cache locality, while the latter fails to fully use resources on all Compute Nodes (CNs) due to load imbalance. In this paper, we propose Seastar, a fast and scalable key-value store that achieves high cache locality as well as load balancing. To enable high concurrency and ensure linearizability, Seastar exploits a self-verification version chain to provide out-of-place atomic updates and ensure consistent reads. To improve cache locality, Seastar leverages a pair-based ownership assigning scheme to assign the processing permission of requests corre-sponding to each key to a CN pair through two independent hash functions. To ensure load balancing among CNs, Seastar proposes a decentralized power-of-two-choices routing scheme to route the requests to the less-loaded CNs in CN pairs for handling. Experimental results demonstrate that Seastar improves the throughput by up to 6.7x and significantly reduces the latency compared with state-of-the-art memory-disaggregated key-value stores. © 2024 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

A Saliency-Aware NR-IQA Method by Fusing Distortion Class Information 27th

A Saliency-Aware NR-IQA Method by Fusing Distortion Class I...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Chen, Menglong Wang, Jianming Xiao, Zhitao Sun, Yukuan School of Computer Science and Technology Tiangong University Tianjin China Tianjin Key Laboratory of Autonomous Intelligence Technology and Systems Tiangong University Tianjin China Tianjin Key Laboratory of Optoelectronic Detection Technology and Systems Tiangong University Tianjin China Center for Engineering Intership and Training Tiangong University Tianjin China

ISBN: (纸本)9783031781278

Blind image quality assessment (BIQA) is a crucial technique for selecting high quality images, which are vital for reliable diagnosis, effective algorithms, and ensuring an optimal visual experience for users. Due to full-reference and reduced-reference IQA methods require reference images, the demand for no-reference (NR-IQA) techniques is more pronounced in practical scenarios. In recent years, NR-IQA models based on Convolutional Neural Networks have achieved significant success. However, existing methods treat image regions uniformly, contradicting the trend of the human visual system to prioritize attention to salient areas. Inspired by the Human Visual System (HVS), we propose the hypothesis that different regions contribute differently to perceived image sharpness, with significant regions exerting a greater influence on quality assessment. To validate this hypothesis, we conducted subjective experiments, revealing that applying the same degree of blur to foreground and background regions results in different quality degradations. Based on this observation, we introduce A Saliency-Aware NR-IQA Method by Fusing Distortion Class Information(SADCIQA). A hierarchical saliency aware module is designed to obtain weighted fusion of features from different regions of the image. Additionally, we employ a self-supervised method to train a quality aware module to extract image quality features. SADCIQA emphasizes salient regions while reducing the contribution of background areas, aligning quality predictions with subjective judgments. We conducted experiments on six datasets, demonstrating that our approach achieved state-of-the-art performance in both synthetic and real distortions. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

DeepGCN based on variable multi‐graph and multimodal data for ASD diagnosis

引用

CAAI Transactions on Intelligence Technology 2024年第4期9卷 879-893页

作者： Shuaiqi Liu Siqi Wang Chaolei Sun Bing Li Shuihua Wang Fei Li College of Electronic and Information Engineering Hebei UniversityBaodingChina Machine Vision Technology Innovation Center of Hebei Province BaodingChina The State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of AutomationChinese Academy of SciencesBeijingChina School of Computer Science and Technology Henan Polytechnic UniversityJiaozuoChina

Diagnosing individuals with autism spectrum disorder(ASD)accurately faces great chal-lenges in clinical practice,primarily due to the data's high heterogeneity and limited sample *** tackle this issue,the authors constructed a deep graph convolutional network(GCN)based on variable multi‐graph and multimodal data(VMM‐DGCN)for ASD ***,the functional connectivity matrix was constructed to extract primary ***,the authors constructed a variable multi‐graph construction strategy to capture the multi‐scale feature representations of each subject by utilising convolutional filters with varying kernel ***,the authors brought the non‐imaging in-formation into the feature representation at each scale and constructed multiple population graphs based on multimodal data by fully considering the correlation between *** extracting the deeper features of population graphs using the deep GCN(DeepGCN),the authors fused the node features of multiple subgraphs to perform node classification tasks for typical control and ASD *** proposed algorithm was evaluated on the Autism Brain Imaging Data Exchange I(ABIDE I)dataset,achieving an accuracy of 91.62%and an area under the curve value of 95.74%.These results demon-strated its outstanding performance compared to other ASD diagnostic algorithms.

关键词： machine learning medical image processing medical signal processing

来源：评论

学校读者我要写书评

暂无评论

Generic and scalable multi-layered architecture for Digital Twin implementation in industrial processes: Mineral Processing case study 7

Generic and scalable multi-layered architecture for Digital ...

引用

7th International Conference on Advances in Artificial Intelligence, ICAAI 2023

作者： Hasidi, Oussama Abdelwahed, El Hassan Qazdar, Aimad El Alaoui-Chrifi, Moulay Abdellah Benzakour, Intissar Chahid, Rachida Bendaouia, Ahmed Bourzeix, François Computer Science Departement Computer Systems Engineering Laboratory Cadi Ayyad University Morocco Estidma Laboratory Ibn Zohr University Morocco R&d and Engineering Center Reminex Managem Group Morocco Analytics Lab Mohammed Vi Polytechnic University Morocco

ISBN: (纸本)9798400708985

Digitalization is crucial for achieving product quality, cost reduction, and timely delivery in manufacturing. With the rise of Industry 4.0, Digital Twin technology has gained popularity, enabling real-time monitoring, predictive maintenance, process optimization, and assumption testing. Manufacturing Digital Twins utilize digital models to represent physical processes, facilitating continuous simulation, interaction, correction, and optimization for autonomous control. However, implementing Digital Twins can be challenging due to diverse data requirements and multiple services. This paper proposes a scalable, service-oriented multi-layered architecture for developing Digital Twins in mineral processing, which can be adapted to other manufacturing systems. The paper provides an overview of Digital Twins, their data-centric workflow, and industrial applications. Additionally, a case study on implementing a Digital Twin for the froth flotation process in the mining industry is presented based on the proposed architecture. © 2023 ACM.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Trust Establishment for the Role-Based Collaborative Multi-Robot systems

Trust Establishment for the Role-Based Collaborative Multi-R...

引用

2023 IEEE International Conference on systems, Man, and Cybernetics, SMC 2023

作者： Akbari, Behzad Zhu, Haibin Pan, Ya-Jun Dalhousie University Advanced Control and Mechatronics Laboratory Department of Mechanical Engineering HalifaxNS Canada Nipissing University Collaborative Systems Laboratory Department of Computer Science and Mathematics North BayON Canada

ISBN: (纸本)9798350337020

Trust evaluation and trust establishment play crucial roles in the management of trust within a multi-agent system. When it comes to collaboration systems, trust becomes directly linked to the specific roles performed by agents. The Role-Based Collaboration (RBC) methodology serves as a framework for assigning roles that facilitate agent collaboration. Within this context, the behavior of an agent with respect to a role is referred to as a process role. This research paper introduces a role engine that incorporates a trust establishment algorithm aimed at identifying optimal and reliable process roles. In our study, we define trust as a continuous value ranging from 0 to 1. To optimize trustworthy process roles, we have developed a consensus-based Gaussian Process Factor Graph (GPFG) tool. Our simulations and experiments validate the feasibility and efficiency of our proposed approach with autonomous robots in unsignalized intersections and narrow hallways. © 2023 IEEE.

关键词： Gaussian process factor graph Multi-Agent systems (MASs) Role-based collaboration Trust management systems

来源：评论

学校读者我要写书评

暂无评论

GPU-Based Efficient Parallel Heuristic Algorithm for High-Utility Itemset Mining in Large Transaction Datasets (Extended Abstract) 40

GPU-Based Efficient Parallel Heuristic Algorithm for High-Ut...

引用

40th IEEE International Conference on Data engineering, ICDE 2024

作者： Fang, Wei Jiang, Haipeng Lu, Hengyang Sun, Jun Wu, Xiaojun Lin, Jerry Chun-Wei Jiangnan University Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Department of Computer Science and Technology Wuxi214122 China Silesian University of Technology Department of Distributed Systems and IT Devices Poland

ISBN: (纸本)9798350317152

Heuristic algorithms have been developed to find approximate solutions for high-utility itemset mining (HUIM) problems that compensate for the performance bottlenecks of exact algorithms. However, heuristic algorithms still face the problem of long runtime and insufficient mining quality, especially for large transaction datasets with thousands to tens of thousands of items and up to millions of transactions. To solve these problems, a novel GPU-based efficient parallel heuristic algorithm for HUIM (PHA-HUIM) is proposed in this paper. The iterative process of PHA-HUIM consists of three main steps: the search strategy, fitness evaluation, and ring topology communication. The search strategy and ring topology communication are designed to run in constant time on GPU. The parallelism of fitness evolution helps to substantially accelerate the algorithm. To improve the mining quality, a multi-start strategy with an unbalanced allocation strategy is employed in the search process. Ring topology communication is adopted to maintain population diversity. A load balancing strategy is introduced to reduce the thread divergence to improve the parallel efficiency. The experimental results on nine large datasets show that PHA-HUIM outperforms state-of-the-art HUIM algorithms in terms of speedup performance, runtime, and mining quality. © 2024 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Enhancing Impulse Response-Based SSVEP Decoding Method by Incorporating Temporal Local Correlation 7

Enhancing Impulse Response-Based SSVEP Decoding Method by In...

引用

7th International Conference on Biological Information and Biomedical engineering, BIBE 2024

作者： Huang, Jiayang Wang, Jiaxi Yang, Pengfei Xiong, Bang Zhang, Zhi-Qiang School of Computer Science and Technology The Key Laboratory of Smart Human-Computer Interaction Wearable Technology of Shaanxi Province Xidian University China School of Electronic and Electrical Engineering Institute of Robotics Autonomous Systems and Sensing University of Leeds United Kingdom

ISBN: (纸本)9783800762910

Various training-based spatial filtering methods have been proposed to classify steady-state visual evoked potential (SSVEP)-based brain-computer interfaces (BCIs). However, many overlook the temporal instability of SSVEPs, leading to decreased classification performance. Therefore, we propose an SSVEP decoding method that calculates template signals and spatial filters using the subject's impulse responses and periodic impulses, incorporating the temporally local correlation coefficient in the SSVEP decoding process. Then, we employ a combined correlation coefficient for SSVEP classification. The proposed method addresses the temporal instability of SSVEPs, with template signals that exhibit strong individual characteristics. Utilizing a public benchmark dataset, we achieved a classification accuracy of 87.43% and an ITR of 256.1 bits/min at 1s time window, demonstrating the performance of this method. Compared to other classical spatial filtering methods, the proposed method demonstrates superior classification performance, which can enhance the practical usability of SSVEP-BCI systems. © VDE VERLAG GMBH.

关键词： Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient Deep Spiking Neural Networks Construction with Spiking Activity based Pruning 41

Towards Efficient Deep Spiking Neural Networks Construction ...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Li, Yaxin Xu, Qi Shen, Jiangrong Xu, Hongming Chen, Long Pan, Gang School of Computer Science and Technology Dalian University of Technology Dalian China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen China College of Computer Science and Technology Zhejiang University Hangzhou China Centre for Systems Engineering and Innovation Imperial College London London United Kingdom

The emergence of deep and large-scale spiking neural networks (SNNs) exhibiting high performance across diverse complex datasets has led to a need for compressing network models due to the presence of a significant number of redundant structural units, aiming to more effectively leverage their low-power consumption and biological interpretability advantages. Currently, most model compression techniques for SNNs are based on unstructured pruning of individual connections, which requires specific hardware support. Hence, we propose a structured pruning approach based on the activity levels of convolutional kernels named Spiking Channel Activity-based (SCA) network pruning framework. Inspired by synaptic plasticity mechanisms, our method dynamically adjusts the network's structure by pruning and regenerating convolutional kernels during training, enhancing the model's adaptation to the current target task. While maintaining model performance, this approach refines the network architecture, ultimately reducing computational load and accelerating the inference process. This indicates that structured dynamic sparse learning methods can better facilitate the application of deep SNNs in low-power and high-efficiency scenarios. Copyright 2024 by the author(s)

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：