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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Demystifying Ethereum account diversity:observations,models and analysis

引用

Frontiers of Computer Science 2022年第4期16卷 119-130页

作者： Chaofan Wang Xiaohai Dai Jiang Xiao Chenchen Li Ming Wen Bingbing Zhou Hai Jin Clusters and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430074China Centre for Distributed and High Performance Computing School of Information TechnologiesThe University of SydneyCamperdownNew South Wales2006Australia

Blockchain platform Ethereum has involved millions of accounts due to its strong potential for providing numerous services based on smart *** massive accounts can be divided into diverse categories,such as miners,tokens,and exchanges,which is termed as account diversity in this *** benefit of investigating diversity are multi-fold,including understanding the Ethereum ecosystem deeper and opening the possibility of tracking certain abnormal ***,the exploration of blockchain account diversity remains *** the most relevant studies,which focus on the deanonymization of the accounts on Bitcoin,can hardly be applied on Ethereum since their underlying protocols and user idioms are *** this end,we present the first attempt to demystify the account diversity on *** key observation is that different accounts exhibit diverse behavior patterns,leading us to propose the heuristics for classification as the *** then raise the coverage rate of classification by the statistical learning model Maximum Likelihood Estimation(MLE).We collect real-world data through extensive efforts to evaluate our proposed method and show its ***,we make an in-depth analysis of the dynamic evolution of the Ethereum ecosystem and uncover the abnormal arbitrage *** for the former,we validate two sweeping statements reliably:(1)standalone miners are gradually replaced by the mining pools and cooperative miners;(2)transactions related to the mining pool and exchanges take up a large share of the total *** latter analysis shows that there are a large number of arbitrage transactions transferring the coins from one exchange to another to make a price difference.

关键词： blockchain Ethereum classification account diversity network analysis

来源：评论

学校读者我要写书评

暂无评论

GraphMetaP: Efficient MetaPath Generation for Dynamic Heterogeneous Graph Models

GraphMetaP: Efficient MetaPath Generation for Dynamic Hetero...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Haiheng He Dan Chen Long Zheng Yu Huang Haifeng Liu Chaoqiang Liu Xiaofei Liao Hai Jin National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Clusters and Grid Computing Lab Huazhong University of Science and Technology China Zhejiang Lab Hangzhou China

Metapath-based heterogeneous graph models (MHGM) show excellent performance in learning semantic and structural information in heterogeneous graphs. Metapath matching is an essential processing step in MHGM to find all metapath instances, bringing significant overhead compared to the total model execution time. Even worse, in dynamic heterogeneous graphs, metapath instances require to be rematched while graph updated. In this paper, we observe that only a small fraction of metapath instances change and propose GraphMetaP, an efficient incremental metapath maintenance method in order to eliminate the matching overhead in dynamic heterogeneous graphs. GraphMetaP introduces a novel format for metapath instances to capture the dependencies among the metapath instances. The format incrementally maintains metapath instances based on the graph updates to avoide the rematching metapath overhead for the updated graph. Furthermore, GraphMetaP uses the fold way to simplify the format in order to recover all metapath instances faster. Experiments show that GraphMetaP enables efficient maintenance of metapath instances on dynamic heterogeneous graphs and outperforms 172.4X on average compared to the matching metapath method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A General Offloading Approach for Near-DRAM Processing-In-Memory Architectures

A General Offloading Approach for Near-DRAM Processing-In-Me...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Dan Chen Hai Jin Long Zheng Yu Huang Pengcheng Yao Chuangyi Gui Qinggang Wang Haifeng Liu Haiheng He Xiaofei Liao Ran Zheng National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Clusters and Grid Computing Lab Huazhong University of Science and Technology China

Processing-in-memory (PIM) is promising to solve the well-known data movement challenge by performing in-situ computations near the data. Leveraging PIM features is pretty profitable to boost the energy efficiency of applications. Early studies mainly focus on improving the programmability for computation offloading on PIM architectures. They lack a comprehensive analysis of computation locality and hence fail to accelerate a wide variety of applications. In this paper, we present a general-purpose instruction-level offloading technique for near-DRAM PIM architectures, namely IOTPIM, to exploit PIM features comprehensively. IOTPIM is novel with two technical advances: 1) a new instruction offloading policy that fully considers the locality of the whole on-chip cache hierarchy, and 2) an offloading performance benefit prediction model that directly predicts offloading performance benefits of an instruction based on the input dataset characterizes, preserving low analysis overheads. The evaluation demonstrates that IOTPIM can be applied to accelerate a wide variety of applications, including graph processing, machine learning, and image processing. IOT-PIM outperforms the state-of-the-art PIM offloading techniques by 1.28×-1.51× while ensuring offloading accuracy as high as 91.89% on average.

关键词： Analytical models Technological innovation Distributed processing Systematics Image processing Computer architecture Machine learning

来源：评论

学校读者我要写书评

暂无评论

GraphFly: Efficient Asynchronous Streaming Graphs Processing via Dependency-Flow

GraphFly: Efficient Asynchronous Streaming Graphs Processing...

引用

Supercomputing Conference

作者： Dan Chen Chuangyi Gui Yi Zhang Hai Jin Long Zheng Yu Huang Xiaofei Liao National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Clusters and Grid Computing Lab Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781665454452

Existing streaming graph processing systems typically adopt two phases of refinement and recomputation to ensure the correctness of the incremental computation. However, severe redundant memory accesses exist due to the unnecessary synchronization among independent edge updates. In this paper, we present GraphFly, a high-performance asynchronous streaming graph processing system based on dependency-flows. GraphFly features three key designs: 1) Dependency trees (D-trees), which helps quickly identify independent graph updates with low cost; 2) Dependency-flow based processing model, which exploits the space-time dependent co-scheduling for cache efficiency; 3) Specialized graph data layout, which further reduces memory accesses. We evaluate GraphFly, and the results show that GraphFly significantly outperforms state-of-the-art systems KickStarter and GraphBolt by 5.81× and 1.78× on average, respectively. Also, GraphFly scales well with different sizes of update batch and compute resources.

关键词： Costs High performance computing Memory management Layout Data models Synchronization

来源：评论

学校读者我要写书评

暂无评论

Ethereum smart contract security research:survey and future research opportunities

引用

Frontiers of Computer Science 2021年第2期15卷 143-160页

作者： Zeli WANG Hai JIN Weiqi DAI Kim-Kwang Raymond CHOO Deqing ZOU National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabClusters and Grid Computing LabHubei Engineering Research Center on Big Data SecurityWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430074China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518057China Department of Information Systems and Cyber Security University of Texas at San AntonioSan AntonioTX78249-0631USA

Blockchain has recently emerged as a research trend,with potential applications in a broad range of industries and *** particular successful Blockchain technology is smart contract,which is widely used in commercial settings(e.g.,high value financial transactions).This,however,has security implications due to the potential to financially benefit from a security incident(e.g.,identification and exploitation of a vulnerability in the smart contract or its implementation).Among,Ethereum is the most active and ***,in this paper,we systematically review existing research efforts on Ethereum smart contract security,published between 2015 and ***,we focus on how smart contracts can be maliciously exploited and targeted,such as security issues of contract program model,vulnerabilities in the program and safety consideration introduced by program execution *** also identify potential research opportunities and future research agenda.

关键词： smart contract security blockchain vulnerability unreliable data

来源：评论

学校读者我要写书评

暂无评论

Partitioning large-scale property graph for efficient distributed query processing 21

Partitioning large-scale property graph for efficient distri...

引用

21st IEEE International Conference on High Performance computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Pang, Haohan Gan, Peng Yuan, Pingpeng Jin, Hai Hua, Qiangsheng National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab. Clusters and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781728120584

Recently, many communities have published their domain knowledge in the form of graphs. A significant trend is that the relations between pairs of nodes in the graph have become so complex that these data can be treated as property graphs. Complex properties imply semantic constraints which can distinguish elements of property graph into different semantic-related aspects. If the property graph can be partitioned according to these aspects, cross-partition communication would be reduced when evaluating SPARQL queries, for the reason that a query can often be evaluated in a single aspect. Conventional graph partition methods, however, pay little attention to semantic constraints in property graphs. To solve this problem, we propose a new property graph partition method for query optimization. First, we propose the property semantic reachable path as basic partition element, with which to capture the semantic-related aspects in a property graph. Second, to combine paths into partitions, we develop a space-efficient algorithm which merges vertices rather than entire paths. Extensive experiments over representative property graph data confirm the effectiveness of our semantic awareness approach. The performance of our approach is comparable with leading competitors, in terms of load balance, data redundancy, and network overhead. © 2019 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Core maintenance in dynamic graphs: A parallel approach based on matching

arXiv

引用

arXiv 2017年

作者： Wang, Na Yu, Dongxiao Jin, Hai Hua, Qiang-Sheng Shi, Xuanhua Xie, Xia Services Computing Technology and System Lab Big Data Technology and System Lab Clusters and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

—The core number of a vertex is a basic index depicting cohesiveness of a graph, and has been widely used in large-scale graph analytics. In this paper, we study the update of core numbers of vertices in dynamic graphs with edge insertions/deletions, which is known as the core maintenance problem. Different from previous approaches that just focus on the case of single-edge insertion/deletion and sequentially handle the edges when multiple edges are inserted/deleted, we investigate the parallelism in the core maintenance procedure. Specifically, we show that if the inserted/deleted edges constitute a matching, the core number update with respect to each inserted/deleted edge can be handled in parallel. Based on this key observation, we propose parallel algorithms for core maintenance in both cases of edge insertions and deletions. We conduct extensive experiments to evaluate the efficiency, stability, parallelism and scalability of our algorithms on different types of real-world and synthetic graphs. Comparing with sequential approaches, our algorithms can improve the core maintenance efficiency significantly. Copyright © 2017, The Authors. All rights reserved.

关键词： Maintenance

来源：评论

学校读者我要写书评

暂无评论

Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks 17

Uniform Information Exchange in Multi-channel Wireless Ad Ho...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Dongxiao Yu Li Ning Yong Zhang Hai Jin Yuexuan Wang Francis C. M. Lau Shengzhong Feng Services Computing Technology and System Lab Big Data Technology and System Lab Clusters and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Center for High Performance Computing Shenzhen Institutes of Advanced Technology CAS Department of Computer Science The University of Hong Kong

ISBN: (纸本)9781510855076

Information exchange is a basic primitive for maintaining the smooth running of a network or a system with multiple communicating agents. Given k packets initially stored at k nodes respectively, the problem is to disseminate the k packets to the whole network with the objective of minimizing the time used. We study this problem in single-hop multi-channel networks of n nodes, and target on devising uniform distributed protocols that do not rely on any prior knowledge of network parameters, such as the network size n or the number of packet holders k. Uniform protocols have better scalability and are more suitable for implementation in reality Specifically, we propose a uniform distributed protocol that with high probability accomplishes the dissemination in O(k/F+F·log n) rounds, assuming F available channels. This protocol is asymptotically optimal when k is large (k ≥ F~2 log n), and provides the best possible linear speedup with multiple channels comparing with the results using a single channel. To the best of our knowledge, this is the first uniform protocol for information exchange in multi-channel networks.

关键词： Information exchange Multi-channel networks Distributed algorithm Uniform protocol information exchange distributed algorithms MULTICHANNEL Packet Uniform Uniforms Mobile ad hoc networks distributed protocol network parameters single-channel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：