检索结果-南通市图书馆

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

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A survey on dynamic graph processing on GPUs: concepts, terminologies and systems

引用

Frontiers of Computer Science 2024年第4期18卷 1-23页

作者： Hongru GAO Xiaofei LIAO Zhiyuan SHAO Kexin LI Jiajie CHEN 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 TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang lab Hangzhou 311121China

Graphs that are used to model real-world entities with vertices and relationships among entities with edges,have proven to be a powerful tool for describing real-world problems in *** most real-world scenarios,entities and their relationships are subject to constant *** that record such changes are called dynamic *** recent years,the widespread application scenarios of dynamic graphs have stimulated extensive research on dynamic graph processing systems that continuously ingest graph updates and produce up-to-date graph analytics *** the scale of dynamic graphs becomes larger,higher performance requirements are demanded to dynamic graph processing *** the massive parallel processing power and high memory bandwidth,GPUs become mainstream vehicles to accelerate dynamic graph processing ***-based dynamic graph processing systems mainly address two challenges:maintaining the graph data when updates occur(i.e.,graph updating)and producing analytics results in time(i.e.,graph computing).In this paper,we survey GPU-based dynamic graph processing systems and review their methods on addressing both graph updating and graph *** comprehensively discuss existing dynamic graph processing systems on GPUs,we first introduce the terminologies of dynamic graph processing and then develop a taxonomy to describe the methods employed for graph updating and graph *** addition,we discuss the challenges and future research directions of dynamic graph processing on GPUs.

关键词： dynamic graphs graph processing graph algorithms GPUs

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

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

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Review on Security Defense Technology Research in Edge Computing Environment

引用

Chinese Journal of Electronics 2024年第1期33卷 1-18页

作者： Ke SHANG Weizhen HE Shuai ZHANG national Digital Switching system Engineering and Technological R&D Center

Edge computing, which achieves quick data processing by sinking data computing and storage to the network edge, has grown rapidly along with the Internet of things. The new network architecture of edge computing brings new security challenges. Based on this, this paper investigates the edge computing security literature published in recent years and summarizes and analyzes research work on edge computing security from different attack surfaces. We start with the definition and architecture of edge computing. From the attack surface between device and edge server, as well as on edge servers, the research describes the security threats and defense methods of edge computing. In addition, the cause of the attack and the pros and cons of defense methods is introduced. The challenges and future research directions of edge computing are given.

关键词： Cloud computing systems architecture Computer architecture Network architecture Data processing Security Servers

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

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

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Impact Force Localization and Reconstruction via ADMM-based Sparse Regularization Method

引用

Chinese Journal of Mechanical Engineering 2024年第3期37卷 170-188页

作者： Yanan Wang Lin Chen Junjiang Liu Baijie Qiao Weifeng He Xuefeng Chen national Key lab of Aerospace Power system and Plasma Technology Xi’an Jiaotong UniversityXi’an 710049China School of Mechanical Engineering Xi’an Jiaotong UniversityXi’an 710049China

In practice,simultaneous impact localization and time history reconstruction can hardly be achieved,due to the illposed and under-determined problems induced by the constrained and harsh measuring *** l_(1) regularization can be used to obtain sparse solutions,it tends to underestimate solution amplitudes as a biased *** address this issue,a novel impact force identification method with l_(p) regularization is proposed in this paper,using the alternating direction method of multipliers(ADMM).By decomposing the complex primal problem into sub-problems solvable in parallel via proximal operators,ADMM can address the challenge *** mitigate the sensitivity to regularization parameters,an adaptive regularization parameter is derived based on the K-sparsity ***,an ADMM-based sparse regularization method is developed,which is capable of handling l_(p) regularization with arbitrary p values using adaptively-updated *** effectiveness and performance of the proposed method are validated on an aircraft skin-like composite ***,an investigation into the optimal p value for achieving high-accuracy solutions via l_(p) regularization is *** turns out that l_(0.6)regularization consistently yields sparser and more accurate solutions for impact force identification compared to the classic l_(1) regularization *** impact force identification method proposed in this paper can simultaneously reconstruct impact time history with high accuracy and accurately localize the impact using an under-determined sensor configuration.

关键词： Impact force identification Non-convex sparse regularization Alternating direction method of multipliers Proximal operators

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of Computer Science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG 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 State Key laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

3D nano-printed geometric phase metasurfaces for generating accelerating beams with complex amplitude manipulation

引用

Science China(Physics,Mechanics & Astronomy) 2024年第6期67卷 86-95页

作者： Tianchen Tang Saima Kanwal Yongzheng Lu Yuelong Li Shuangbao Wu Lei Chen Ziheng Qian Zhouyu Xie Jing Wen Dawei Zhang Research Center of Optical Instrument and system Ministry of Education and Shanghai Key Lab of Modern Optical SystemUniversity of Shanghai for Science and TechnologyShanghai 200093China

Metasurface,a forefront in emerging optical devices,has demonstrated remarkable potential for complex amplitude manipulation of light ***,prevailing approaches face challenges in spatial resolution and complexities associated with integrating dynamic phases,impeding the simplified design and reproducible fabrication of ***,we introduce an innovative approach for complex amplitude modulation within 3D nano-printed geometric phase *** approach enables the generation of self-accelerating beams by encoding amplitude through phase-only manipulation,achieving high spatial ***,this method circumvents the conventional need to adjust the geometric parameters of metasurface unit structures for amplitude manipulation,offering a streamlined and efficient route for design and fabrication *** novel methodology holds promise for expedited and low-cost manufacturing of complex amplitude manipulation metasurfaces.

关键词： metasurface complex amplitude manipulation geometric phase 3D nano-printing Airy beam accelerating parabolic beam

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Optimal Operation with Dynamic Partitioning Strategy for Centralized Shared Energy storage Station with Integration of Large-scale Renewable Energy

引用

Journal of Modern Power systems and Clean Energy 2024年第2期12卷 359-370页

作者： Jianlin Li Zhijin Fang Qian Wang Mengyuan Zhang Yaxin Li Weijun Zhang Beijing Future Technology Innovation Centre for Electrochemical Energy storage system Integration North China University of Technology Beijing China State Grid Fujian Electric Power Research Institute Fuzhou China

As renewable energy continues to be integrated into the grid,energy storage has become a vital technique supporting power system *** effectively promote the efficiency and economics of energy storage,centralized shared energy storage(SES)station with multiple energy storage batteries is developed to enable energy trading among a group of *** this paper,we propose the optimal operation with dynamic partitioning strategy for the centralized SES station,considering the day-ahead demands of large-scale renewable energy power *** implement a multi-entity cooperative optimization operation model based on Nash bargaining *** model is decomposed into two subproblems:the operation profit maximization problem with energy trading and the leasing payment bargaining *** distributed alternating direction multiplier method(ADMM)is employed to address the subproblems *** reveal that the optimal operation with a dynamic partitioning strategy improves the tracking of planned output of renewable energy entities,enhances the actual utilization rate of energy storage,and increases the profits of each participating *** results confirm the practicality and effectiveness of the strategy.

关键词： Shared energy storage(SES) dynamic partitioning strategy optimal operation Nash bargaining theory actual utilization rate of energy storage

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：