检索结果-南通市图书馆

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

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

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

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Minimal Context-Switching Data Race Detection with Dataflow Tracking

引用

Journal of Computer Science & technology 2024年第1期39卷 211-226页

作者：郑龙李洋辛杰刘海峰郑然廖小飞金海 National Engineering Research Center for Big Data technology and system School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China services computing technology and system laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Cluster and Grid computing laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1)without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.

关键词： data race satisfiability modulo theory multi-threaded program dynamic detection

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Towards High-Performance Graph Processing: From a Hardware/Software Co-Design Perspective

引用

Journal of Computer Science & technology 2024年第2期39卷 245-266页

作者：廖小飞赵文举金海姚鹏程黄禹王庆刚赵进郑龙张宇邵志远 National Engineering Research Center for Big Data technology and system School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China services computing technology and system laboratory School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid computing laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graph processing has been widely used in many scenarios,from scientific computing to artificial *** processing exhibits irregular computational parallelism and random memory accesses,unlike traditional ***,running graph processing workloads on conventional architectures(e.g.,CPUs and GPUs)often shows a significantly low compute-memory ratio with few performance benefits,which can be,in many cases,even slower than a specialized single-thread graph *** domain-specific hardware designs are essential for graph processing,it is still challenging to transform the hardware capability to performance boost without coupled software *** article presents a graph processing ecosystem from hardware to *** start by introducing a series of hardware accelerators as the foundation of this ***,the codesigned parallel graph systems and their distributed techniques are presented to support graph ***,we introduce our efforts on novel graph applications and hardware *** results show that various graph applications can be efficiently accelerated in this graph processing ecosystem.

关键词： graph processing hardware accelerator software system high performance ecosystem

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A hybrid memory architecture supporting fine-grained data migration

引用

Frontiers of Computer Science 2024年第2期18卷 31-41页

作者： Ye CHI Jianhui YUE Xiaofei LIAO Haikun LIU 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 and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Department of Computer Science Michigan Technological UniversityMichigan 49931USA

Hybrid memory systems composed of dynamic random access memory(DRAM)and Non-volatile memory(NVM)often exploit page migration technologies to fully take the advantages of different memory *** previous proposals usually migrate data at a granularity of 4 KB pages,and thus waste memory bandwidth and DRAM *** this paper,we propose Mocha,a non-hierarchical architecture that organizes DRAM and NVM in a flat address space physically,but manages them in a cache/memory *** the commercial NVM device-Intel Optane DC Persistent Memory Modules(DCPMM)actually access the physical media at a granularity of 256 bytes(an Optane block),we manage the DRAM cache at the 256-byte size to adapt to this feature of *** design not only enables fine-grained data migration and management for the DRAM cache,but also avoids write amplification for Intel Optane *** also create an Indirect Address Cache(IAC)in Hybrid Memory Controller(HMC)and propose a reverse address mapping table in the DRAM to speed up address translation and cache ***,we exploit a utility-based caching mechanism to filter cold blocks in the NVM,and further improve the efficiency of the DRAM *** implement Mocha in an architectural *** results show that Mocha can improve application performance by 8.2%on average(up to 24.6%),reduce 6.9%energy consumption and 25.9%data migration traffic on average,compared with a typical hybrid memory architecture-HSCC.

关键词： non-volatile memory hybrid memory system data migration fine-grained caching

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

XGCN:a library for large-scale graph neural network recommendations

引用

Frontiers of Computer Science 2024年第3期18卷 247-249页

作者： Xiran SONG Hong HUANG Jianxun LIAN 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 and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Microsoft Research Asia Beijing 100080China

1 Introduction Graph Neural Networks(GNNs)have gained widespread adoption in recommendation systems,and nowadays there is a pressing need to effectively manage large-scale graph data[1].When it comes to large graphs,GNNs may encounter the scalability issue stemming from their multi-layer messagepassing ***,scaling GNNs has emerged as a crucial research area in recent years,with numerous scaling strategies being proposed.

关键词： scaling gained operations

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Media Power Measuring via Emotional Contagion

引用

Journal of Social computing 2024年第1期5卷 15-35页

作者： Xue Lin Hong Huang Zongya Li 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 and TechnologyHuazhong University of Science and TechnologyWuhan 430074China School of Journalism Huazhong University of Science and TechnologyWuhan 430074China

Media power,the impact that media have on public opinion and perspectives,plays a significant role in maintaining internal stability,exerting external influence,and shaping international dynamics for nations/***,prior research has primarily concentrated on news content and reporting time,resulting in limitations in evaluating media *** more accurately assess media power,we use news content,news reporting time,and news emotion simultaneously to explore the emotional contagion between *** use emotional contagion to measure the mutual influence between media and regard the media with greater impact as having stronger media *** propose a framework called Measuring Media Power via Emotional Contagion(MMPEC)to capture emotional contagion among media,enabling a more accurate assessment of media power at the media and national/regional *** also interprets experimental results through correlation and causality analyses,ensuring *** analyses confirm the higher accuracy of MMPEC compared to other baseline models,as demonstrated in the context of COVID-19-related news,yielding compelling and interesting insights.

关键词： explainability media power emotional contagion

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Adaptive and augmented active anomaly detection on dynamic network traffic streams

引用

Frontiers of Information technology & Electronic Engineering 2024年第3期25卷 446-460页

作者： Bin LI Yijie WANG Li CHENG National Key laboratory of Parallel and Distributed computing College of ComputerNational University of Defense TechnologyChangsha 410073China College of system Engineering National University of Defense TechnologyChangsha 410073China

Active anomaly detection queries labels of sampled instances and uses them to incrementally update the detection model,and has been widely adopted in detecting network ***,existing methods cannot achieve desirable performance on dynamic network traffic streams because(1)their query strategies cannot sample informative instances to make the detection model adapt to the evolving stream and(2)their model updating relies on limited query instances only and fails to leverage the enormous unlabeled instances on *** address these issues,we propose an active tree based model,adaptive and augmented active prior-knowledge forest(A3PF),for anomaly detection on network trafic streams.A prior-knowledge forest is constructed using prior knowledge of network attacks to find feature subspaces that better distinguish network anomalies from normal *** one hand,to make the model adapt to the evolving stream,a novel adaptive query strategy is designed to sample informative instances from two aspects:the changes in dynamic data distribution and the uncertainty of *** the other hand,based on the similarity of instances in the neighborhood,we devise an augmented update method to generate pseudo labels for the unlabeled neighbors of query instances,which enables usage of the enormous unlabeled instances during model *** experiments on two benchmarks,CIC-IDS2017 and UNSW-NB15,demonstrate that A3PF achieves significant improvements over previous active methods in terms of the area under the receiver operating characteristic curve(AUC-ROC)(20.9%and 21.5%)and the area under the precision-recall curve(AUC-PR)(44.6%and 64.1%).

关键词： Active anomaly detection Network traffic streams Pseudo labels Prior knowledge of network attacks

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Contact engineering for temperature stability improvement of Bi-contacted MoS2 field effect transistors

引用

Science China(Information Sciences) 2024年第6期67卷 172-179页

作者： Zizheng LIU Qing ZHANG Xiaohe HUANG Chunsen LIU Peng ZHOU State Key laboratory of Integrated Chip and systems School of MicroelectronicsZhangjiang Fudan International Innovation CenterFudan University Frontier Institute of Chip and system Shanghai Key Lab for Future Computing Hardware and SystemFudan University Shaoxin laboratory

Semimetallic bismuth（Bi） is one of the most effective strategies for reducing the contact resistance of two-dimensional transition metal dichalcogenide field effect transistors（FETs）. However, the low melting point of Bi contact（271.5℃） limits its reliable applications. In this study, we demonstrated that the temperature stability of Bi-contacted electrodes could be improved by inserting a high-melting point semimetallic antimony（Sb） between the Bi contacting layer and the gold（Au） capping layer. The proposed Bi/Sb/Au contact electrodes tended to form a metal mixture with a continuous surface during the heating process（Voids appeared on the surface of the Bi/Au contact electrodes after heating at 120℃）. Because of the improved contacting layer formed by the semimetal Bi/Sb alloy, the fabricated Bi/Sb/Au-contacted molybdenum sulfide（MoS2） FETs with different gate lengths demonstrated higher on-state current stability after heating treatment than the Bi/Au contact. Because of the Bi/Sb/Au contact and poly（methyl methacrylate） package, the MoS2FETs demonstrated time stability of at least two months from the almost unchanged transfer characteristics. The electrical stability indicates that the insertion of semimetallic Sb is a promising technology for reliable Bi-based contact.

关键词： temperature stability semimetallic bismuth contact semimetallic antimony contact MoS$_{2}$ FETs time stability

来源：

同方期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

10-Million Atoms Simulation of First-Principle Package LS3DF

引用

Journal of Computer Science & technology 2024年第1期39卷 45-62页

作者：严昱瑾李海波赵曈汪林望石林刘涛谭光明贾伟乐孙凝晖 State Key laboratory of Processors Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190 China University of Chinese Academy of Sciences Beijing 101408China computing system Optimization laboratory Huawei TechnologiesBeijing 100094China Institute of Semiconductors Chinese Academy of SciencesBeijing 100083China School of Materials Science and Engineering Yancheng Institute of TechnologyYancheng 224051China

The growing demand for semiconductor devices simulation poses a big challenge for large-scale electronic structure *** various methods,the linearly scaling three-dimensional fragment(LS3DF)method exhibits excellent scalability in large-scale *** on algorithmic and system-level optimizations,we propose a highly scalable and highly efficient implementation of LS3DF on a domestic heterogeneous supercomputer equipped with *** terms of algorithmic optimizations,the original all-band conjugate gradient algorithm is refined to achieve faster convergence,and mixed precision computing is adopted to increase overall *** terms of system-level optimiza-tions,the original two-layer parallel structure is replaced by a coarse-grained parallel *** strategies such as multi-stream,kernel fusion,and redundant computation removal are proposed to increase further utilization of the com-putational power provided by the heterogeneous *** a result,our optimized LS3DF can scale to a 10-million sili-con atoms system,attaining a peak performance of 34.8 PFLOPS(21.2% of the peak).All the improvements can be adapt-ed to the next-generation supercomputers for larger simulations.

关键词： single instruction multiple thread accelerator electronic structure high-performance computing linearly scaling three-dimensional fragment(LS3DF)

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：