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

Efficient FPGA-based graph processing with hybrid pull-push computational model

Frontiers of Computer Science 2020年第4期14卷 13-28页

作者： Chengbo YANG Long ZHENG Chuangyi GUI Hai JIN 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 TechnologyHuazhong University of Science and TechnologyWuhan430074China

Hybrid pull-push computational model can provide compelling results over either of single one for processing real-world *** and pipeline parallelism of FPGAs make it potential to process different stages of graph ***,considering the limited on-chip resources and streamline pipeline computation,the efficiency of hybrid model on FPGAs often suffers due to well-known random access feature of graph *** this paper,we present a hybrid graph processing system on FPGAs,which can achieve the best of both *** approach on FPGAs is unique and novel as ***,we propose to use edge block(consisting of edges with the same destination vertex set),which allows to sequentially access edges at block granularity for locality while still preserving the *** to the independence of blocks in the sense that all edges in an inactive block are associated with inactive vertices,this also enables to skip invalid blocks for reducing redundant ***,we consider a large number of vertices and their associated edge-blocks to maintain a predictable execution *** also present to switch models in advance with few stalls using their state *** evaluation on a wide variety of graph algorithms for many real-world graphs shows that our approach achieves up to 3.69x speedup over state-of-the-art FPGA-based graph processing systems.

关键词： graph processing efficiency computational model FPGAs

来源：评论

学校读者我要写书评

暂无评论

Resource abstraction and data placement for distributed hybrid memory pool

引用

Frontiers of Computer Science 2021年第3期15卷 47-57页

作者： Tingting CHEN Haikun LIU Xiaofei LIAO Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Gluster and Grid Computing LabSchool of Gomputing Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Emerging byte-addressable non-volatile memory(NVM)technologies offer higher density and lower cost than DRAM,at the expense of lower performance and limited write *** have been many studies on hybrid NVM/DRAM memory management in a single physical ***,it is still an open problem on how to manage hybrid memories efficiently in a distributed *** paper proposes Alloy,a memory resource abstraction and data placement strategy for an RDMA-enabled distributed hybrid memory pool(DHMP).Alloy provides simple APIs for applications to utilize DRAM or NVM resource in the DHMP,without being aware of the hardware details of the *** propose a hotness-aware data placement scheme,which combines hot data migration,data replication and write merging together to improve application performance and reduce the cost of *** evaluate Alloy with several micro-benchmark workloads and public benchmark *** results show that Alloy can significantly reduce the DRAM usage in the DHMP by up to 95%,while reducing the total memory access time by up to 57%compared with the state-of-the-art approaches.

关键词： load balance distributed hybrid memory clouds

来源：评论

学校读者我要写书评

暂无评论

ReCSA:a dedicated sort accelerator using ReRAM-based content addressable memory

引用

Frontiers of Computer Science 2023年第2期17卷 1-13页

作者： Huize LI Hai JIN Long ZHENG Yu HUANG Xiaofei LIAO National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabClusters and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

With the increasing amount of data,there is an urgent need for efficient sorting algorithms to process large data *** sorting algorithms have attracted much attention because they can take advantage of different hardware's *** the traditional hardware sort accelerators suffer“memory wall”problems since their multiple rounds of data transmission between the memory and the *** this paper,we utilize the in-situ processing ability of the ReRAM crossbar to design a new ReCAM array that can process the matrix-vector multiplication operation and the vector-scalar comparison in the same array *** this designed ReCAM array,we present ReCSA,which is the first dedicated ReCAM-based sort *** hardware designs,we also develop algorithms to maximize memory utilization and minimize memory exchanges to improve sorting *** sorting algorithm in ReCSA can process various data types,such as integer,float,double,and *** also present experiments to evaluate the performance and energy efficiency against the state-of-the-art sort *** experimental results show that ReCSA has 90.92×,46.13×,27.38×,84.57×,and 3.36×speedups against CPU-,GPU-,FPGA-,NDP-,and PIM-based platforms when processing numeric data *** also has 24.82×,32.94×,and 18.22×performance improvement when processing string data sets compared with CPU-,GPU-,and FPGA-based platforms.

关键词： ReCAM parallel sorting architecture design processing-in-memory

来源：评论

学校读者我要写书评

暂无评论

Precise control of page cache for containers

引用

Frontiers of Computer Science 2024年第2期18卷 17-30页

作者： Kun WANG Song WU Shengbang LI Zhuo HUANG Hao FAN Chen YU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Container-based virtualization isbecoming increasingly popular in cloud computing due to its efficiency and *** isolation is a fundamental property of *** works have indicated weak resource isolation could cause significant performance degradation for containerized applications and enhanced resource ***,current studies have almost not discussed the isolation problems of page cache which is a key resource for *** leverage memory cgroup to control page cache ***,existing policy introduces two major problems in a container-based ***,containers can utilize more memory than limited by their cgroup,effectively breaking memory ***,the Os kernel has to evict page cache to make space for newly-arrived memory requests,slowing down containerized *** paper performs an empirical study of these problems and demonstrates the performance impacts on containerized *** we propose pCache(precise control of page cache)to address the problems by dividing page cache into private and shared and controlling both kinds of page cache separately and *** do so,pCache leverages two new technologies:fair account(f-account)and evict on demand(EoD).F-account splits the shared page cache charging based on per-container share to prevent containers from using memory for free,enhancing memory *** EoD reduces unnecessary page cache evictions to avoid the performance *** evaluation results demonstrate that our system can effectively enhance memory isolation for containers and achieve substantial performance improvement over the original page cache management policy.

关键词： page cache memory cgroup container isolation cloud computing

来源：评论

学校读者我要写书评

暂无评论

Multi-Stage malicious click detection on large scale web advertising data 1

Multi-Stage malicious click detection on large scale web adv...

引用

1st International Workshop on big Dynamic Distributed data, BD3 2013 - Co-located with International Conference on Very Large databases, VLDB 2013

作者： Song, Leyi Gong, Xueqing He, Xiaofeng Zhang, Rong Zhou, Aoying Center for Cloud Computing and Big Data East China Normal University 3663 North Zhongshan Road Shanghai China

The healthy development of the Internet largely depends on the online advertisement which provides the financial support to the Internet. Click fraud, however, poses serious threat to the Internet ecosystem. It not only brings harm to the advertisers, but also damages the mutual trust between advertiser and ad agency. Click fraud prediction is a typical big data application in that we normally need to identify the malicious clicks from massive click logs, therefore efficient detection methods in big data framework are much desired to combat this fraudulent behavior. In this paper, we propose a three-stage filtering system to attack click fraud. The serialized filters effectively detect the malicious clicks with decreasing confidence that can satisfy both advertisers and content providers.

关键词： big data

来源：评论

学校读者我要写书评

暂无评论

Answering reachability queries with ordered label constraints over labeled graphs

引用

Frontiers of Computer Science 2024年第1期18卷 105-117页

作者： Daoliang HE Pingpeng YUAN Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science&TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are labeled graph,it highly demands Label-Constrained Reachability(LCR)query inwhich constraint includes a set of labels besides vertex *** researches proposed several methods for answering some LCR queries which require appearance of some labels specified in constraints in the *** that constraint may be a label set,query constraint may be ordered labels,namely OLCR(Ordered-Label-Constrained Reachability)queries which retrieve paths matching a sequence of ***,no solutions are available for ***,we propose DHL,a novel bloom filter based indexing technique for answering OLCR *** can be used to check reachability between vertex *** the answers are not no,then constrained DFS is ***,we employ DHL followed by performing constrained DFS to answer OLCR *** show that DHL has a bounded false positive rate,and it's powerful in saving indexing time and *** experiments on 10 real-life graphs and 12 synthetic graphs demonstrate that DHL achieves about 4.8-22.5 times smaller index space and 4.6-114 times less index construction time than two state-of-art techniques for LCR queries,while achieving comparable query response *** results also show that our algorithm can answer OLCR queries effectively.

关键词： graph ordered-label-constrained reachability partial index bloom filter query processing

来源：评论

学校读者我要写书评

暂无评论

GDKansformer: A group-wise dynamic Kolmogorov–Arnold transformer with multi-view gated attention for pathological image diagnosis

引用

Expert Systems with Applications 2025年 286卷

作者： Lu, Xiaoyan Gong, Xun Chen, Yuanyuan School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology and Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China Department of Pathology The Third People's Hospital of Chengdu Affiliated Hospital of Southwest Jiaotong University Chengdu610031 China

Pathological image diagnosis is a fundamental and critical component of precision medicine, playing a pivotal role in clinical decision-making. However, due to the high heterogeneity of pathological images, existing models still face the challenges of insufficient feature representation, poor interpretability, and high computational costs. To address these issues, we propose a novel pathological image diagnosis model called GDKansformer, which integrates the Group-wise Dynamic Kolmogorov–Arnold Network with a Vision Transformer (ViT) architecture. Specifically, this model employs adaptive dynamic fitting and group-wise computation strategies to seamlessly embed an improved Kolmogorov–Arnold Network (KAN) into ViTs, thereby boosting pathological representation and interpretability. The proposed group-wise computation strategy effectively mitigates the distribution overfitting caused by the KAN structure and significantly reduces the computational costs. Furthermore, a Multi-view Gated Attention (MVGA) block comprising pixel-level non-local neighborhoods and adaptive local perception is designed to eliminate redundant non-feature information and enhance contextual interactions, thereby improving the feature discrimination of the model for high heterogeneity data distributions. Experimental results demonstrate that GDKansformer achieves high accuracy with lower parameters, highlighting the significant potential in facilitating pathological diagnosis. © 2025

关键词： Pathology

来源：评论

学校读者我要写书评

暂无评论

data integrity checking with reliable data transfer for secure cloud storage

Data integrity checking with reliable data transfer for secu...

引用

作者： Wang, Yong Tao, Xiaoling Ni, Jianbing Yu, Yong Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guangxi Colleges Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology Guilin541004 China

Currently, an increasing number of data owners prefer to store their data on remote servers due to a number of appealing advantages of cloud storage, say convenience and simplicity, scalability of the service and ubiquitous network access. However, outsourced data's transfer becomes a critical requirement for cloud users because of the emergence of various cloud storage services with different qualities of services. Therefore, the users might not only be anxious about the status of their data on cloud servers but also care whether the data are transferred entirely to the new cloud without corruption and whether the data on original cloud are discarded. To address these challenging issues, in this paper, we propose a novel auditing scheme for cloud storage services characterised by secure data transfer, provable data erasure, high error detection probability, confidential data storage. The proposed scheme can guarantee the integrity of remote data when the data are hosted on cloud servers and are transferred between two clouds, and secure deletion of the transferred data on the original cloud. Copyright © 2018 Inderscience Enterprises Ltd.

关键词： data transfer

来源：评论

学校读者我要写书评

暂无评论

THE-TAFL: Transforming Healthcare Edge with Transformer-based Adaptive Federated Learning and Learning Rate Optimization

Internet of Things (The Netherlands)

引用

Internet of Things (The Netherlands) 2025年 32卷

作者： Ullah, Farhan Mohammad, Nazeeruddin Mostarda, Leonardo Cacciagrano, Diletta Ullah, Shamsher Zhao, Yue Cybersecurity Center Prince Mohammad Bin Fahd University Khobar 34754 Saudi Arabia Department of Mathematics and Computer Science University of Perugia Perugia 06123 Italy Division of Computer Science University of Camerino Camerino 62032 Italy National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen 518060 China Department of Computer Science College of Science Mathematics and Technology Wenzhou-Kean University Wenzhou 325060 China

The healthcare industry is becoming more vulnerable to privacy violations and cybercrime due to the pervasive dissemination and sensitivity of medical data. Advanced data security systems are needed to protect privacy, data integrity, and dependability as confidentiality breaches increase across industries. Decentralized healthcare networks face challenges in feature extraction during local training, hindering effective federated averaging and learning rate optimization, which affects data processing and model training efficiency. This paper introduces a novel approach of Transforming Healthcare Edge with Transformer-based Adaptive Federated Learning (THE-TAFL) and Learning Rate Optimization. In this paper, we combine Transformer-based Adaptive Federated Learning (TAFL) with learning rate optimization to improve the privacy and security of healthcare information on edge devices. We used data augmentation approaches that generate robust and generalized input datasets for deep learning models. Next, we use the Vision Transformer (ViT) model for local training, generating Local Model Weights (LMUs) that enhance feature extraction and learning. We designed a training optimization method that improves model performance and stability by combining a loss function with weight decay for regularization, learning rate scheduling, and gradient clipping. This ensures effective training across decentralized clients in a Federated Learning (FL) framework. The FL server receives LMUs from many clients and aggregates them. The aggregation procedure utilizes adaptive federated averaging to aggregate the LMUs based on the performance of each client. This adaptive method ensures that high-performing clients contribute more to the Global Model Update (GMU). Following aggregation, clients receive the GMU to continue training with the updated parameters, ensuring collaborative and dynamic learning. The proposed method provides better performance on two standard datasets using various numb

关键词： Adaptive Federated Learning Edge computing Healthcare Privacy & Security Medical imaging Transforming Healthcare Edge Vision transformer

来源：评论

学校读者我要写书评

暂无评论

ARCHER:a ReRAM-based accelerator for compressed recommendation systems

引用

Frontiers of Computer Science 2024年第5期18卷 147-160页

作者： Xinyang SHEN Xiaofei LIAO Long ZHENG Yu HUANG Dan CHEN Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabClusters and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Modern recommendation systems are widely used in modern data *** random and sparse embedding lookup operations are the main performance bottleneck for processing recommendation systems on traditional platforms as they induce abundant data movements between computing units and ***-based processing-in-memory(PIM)can resolve this problem by processing embedding vectors where they are ***,the embedding table can easily exceed the capacity limit of a monolithic ReRAM-based PIM chip,which induces off-chip accesses that may offset the PIM ***,we deploy the decomposed model on-chip and leverage the high computing efficiency of ReRAM to compensate for the decompression performance *** this paper,we propose ARCHER,a ReRAM-based PIM architecture that implements fully yon-chip recommendations under resource ***,we make a full analysis of the computation pattern and access pattern on the decomposed *** on the computation pattern,we unify the operations of each layer of the decomposed model in multiply-and-accumulate *** on the access observation,we propose a hierarchical mapping schema and a specialized hardware design to maximize resource *** the unified computation and mapping strategy,we can coordinatethe inter-processing elements *** evaluation shows that ARCHER outperforms the state-of-the-art GPU-based DLRM system,the state-of-the-art near-memory processing recommendation system RecNMP,and the ReRAM-based recommendation accelerator REREC by 15.79×,2.21×,and 1.21× in terms of performance and 56.06×,6.45×,and 1.71× in terms of energy savings,respectively.

关键词： recommendation system ReRAM processing-in-memory embedding layer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：