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

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 Protective Mechanism for the Access Control System in the Virtual Domain

引用

China Communications 2016年第11期13卷 129-142页

作者： Jinan Shen Deqing Zou Hai Jin Kai Yang Bin Yuan Weiming Li Services Computing Technology and System Laboratory Cluster and Grid Computing LaboratorySchool of Computing Science and TechnologyHuazhong University of Science and Technology School of Information Engineering Hubei University for Nationalities

In traditional framework,mandatory access control(MAC) system and malicious software are run in kernel mode. Malicious software can stop MAC systems to be started and make it do invalid. This problem cannot be solved under the traditional framework if the operating system(OS) is comprised since malwares are running in ring 0 level. In this paper,we propose a novel way to use hypervisors to protect kernel integrity and the access control system in commodity operating systems. We separate the access control system into three parts: policy management(PM),security server(SS) and policy enforcement(PE). Policy management and the security server reside in the security domain to protect them against malware and the isolation feather of the hypervisor can protect them from attacks. We add an access vector cache(AVC) between SS and PE in the guest OS,in order to speed up communication between the guest OS and the security domain. The policy enforcement module is retained in the guest OS for performance. The security of AVC and PE can be ensured by using a memory protection mechanism. The goal of protecting the OS kernel is to ensure the security of the execution path. We implementthe system by a modified Xen hypervisor. The result shows that we can secure the security of the access control system in the guest OS with no overhead compared with modules in the latter. Our system offers a centralized security policy for virtual domains in virtual machine ***: hypervisor; virtualization; memo-

关键词： hypervisor virtualization memory protection guest OS access control system

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An approach for indexing, storing and retrieving domain knowledge

Proceedings of the ACM Symposium on Applied Computing

引用

Proceedings of the ACM Symposium on Applied computing 2007年 1381-1382页

作者： Wu, Hao Jin, Hai Ning, Xiaomin Cluster and Grid Computing Laboratory Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)1595934804;9781595934802

In this short paper, we present our solution to index, store and retrieve the domain knowledge. The main principle exploits Lucene to index the domain knowledge under guide of the domain schema. The method to map domain knowledge structure into Lucene index structure, store and update the indices, and to transfer RDF-based query into Lucene's query are presented. Copyright 2007 ACM.

关键词： Knowledge acquisition

来源：评论

学校读者我要写书评

暂无评论

Towards dataflow based graph processing

引用

Science China(Information Sciences) 2017年第12期60卷 274-276页

作者： Hai JIN Pengcheng YAO Xiaofei LIAO Service Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology

Modern graph processing is widely used for solving a vast variety of real-world problems,e.g.,web sites ranking[1]and community detection[2].To better adapt and express the procedure of graph iteration,a wide spectrum... 详细信息

关键词： ILP cycle Towards dataflow based graph processing

来源：评论

学校读者我要写书评

暂无评论

Fine-grained and heterogeneous proxy re-encryption for secure cloud storage

引用

Chinese Science Bulletin 2014年第32期59卷 4201-4209页

作者： Peng Xu Hongwu Chen Deqing Zou Hai Jin Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology

Cloud is an emerging computing *** has drawn extensive attention from both academia and *** its security issues have been considered as a critical obstacle in its rapid *** data owners store their data as plaintext in cloud,they lose the security of their cloud data due to the arbitrary accessibility,specially accessed by the un-trusted *** order to protect the confidentiality of data owners’cloud data,a promising idea is to encrypt data by data owners before storing them in ***,the straightforward employment of the traditional encryption algorithms can not solve the problem well,since it is hard for data owners to manage their private keys,if they want to securely share their cloud data with others in a fine-grained *** this paper,we propose a fine-grained and heterogeneous proxy re-encryption(FHPRE)system to protect the confidentiality of data owners’cloud *** applying the FH-PRE system in cloud,data owners’cloud data can be securely stored in cloud and shared in a fine-grained ***,the heterogeneity support makes our FH-PRE system more efficient than the previous ***,it provides the secure data sharing between two heterogeneous cloud systems,which are equipped with different cryptographic primitives.

关键词：安全问题数据存储加密算法细粒度异构代理计算模式数据共享

来源：评论

学校读者我要写书评

暂无评论

VMStore: Distributed storage system for multiple virtual machines

引用

Science China(Information Sciences) 2011年第6期54卷 1104-1118页

作者： LIAO XiaoFei, LI He, JIN Hai , HOU HaiXiang, JIANG Yue & LIU HaiKun services computing technology and System lab, cluster and grid computing lab, School of Computer Science and technology, Huazhong University of Science and technology, Wuhan 430074, China 1. Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Desktop virtualization is a very hot concept in both industry and academic communities. Since virtualized desktop system is based on multiple virtual machines (VM), it is necessary to design a distributed storage system to manage the VM images. In this paper, we design a distributed storage system, VMStore, by taking into account three important characteristics: high performance VM snapshot, booting optimization from multiple images and redundancy removal of images data. We adopt a direct index structure of blocks for VM snapshots to speed up VM booting performance significantly; provide a distribute storage structure with good bandwidth scalability by dynamically changing the number of storage nodes; and propose a data preprocessing strategy with intelligent object partitioning techniques, which would eliminate duplication more effectively. Performance analysis for VMStore focuses on two metrics: the speedup of VM booting and the overhead of de-duplication. Experimental results show the efficiency and effectiveness of VMStore.

关键词： virtualization virtualized desktop distributed storage

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

P2P live streaming with tree-mesh based hybrid overlay

P2P live streaming with tree-mesh based hybrid overlay

引用

2007 International Conference on Parallel Processing Workshops, ICPPW 2007

作者： Huang, Qi Jin, Hai Liao, Xiaofei Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology

ISBN: (纸本)0769529348

P2P technology has been widely adopted in live streaming system for its scalability and low commercial cost. However, tree based system or mesh based system still has to face the constraint or tradeoff caused by its solo shaped overlay construction. To address this problem, this paper introduces a tree-mesh based hybrid overlay and an optimized scheduling method. These works have been proven efficient in terms of low control overhead and better streaming experience compared with other systems. All algorithms and methods have been implemented in Anysee2. © 2007 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：