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

International Conference on services computing

作者： Jin, Hai Deng, Li Wu, Song Shi, Xuanhua 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

ISBN: (纸本)9780769544625

Virtualization can provide significant benefits in data centers, such as dynamic resource configuration, live virtual machine migration. services are deployed in virtual machines (VMs) and resource utilization can be greatly improved. In this paper, we present VScheduler, a system that dynamically adjusts processor resource configuration of virtual machines, including the amount of virtual resource and a new mapping of virtual machines and physical nodes. VScheduler implements a two-level resource configuration scheme - local resource configuration (LRC) for an individual virtual machine and global resource configuration (GRC) for a whole cluster or data center. GRC especially takes variation tendency of workloads into account when remapping virtual machines to physical nodes. We implement our techniques in Xen and conduct a detailed evaluation using RUBiS and dbench. The experimental results show that VScheduler not only satisfies resource demands of services, but also reduces the number of virtual machines migration, which can provide a stable VM distribution on physical nodes in data centers. © 2011 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Affinity-aware proportional share scheduling for virtual machine system

Affinity-aware proportional share scheduling for virtual mac...

引用

International Conference on grid and Cloud computing

作者： Chen, Huacai Jin, Hai Hu, Kan 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

ISBN: (纸本)9780769543130

VM (virtual machine) scheduling is a fundamental topic of virtualization, and fairness is its important design goal. Most VMMs (virtual machine monitor) provide PS (proportional share) schedulers. A PS scheduler assign a weight to every VM to declare the computational resource requirement, and VM is allocated CPU cycles proportional to weight. CPU-affinity is a property of VCPU (virtual CPU) to describe which PCPUs (physical CPU) it can run on. However, current definition of weight does not collab.rate well with CPU-affinity. It behaves as if all PCPUs are availab.e to all VMs. We expose the issue by using Xen's Credit scheduler, and show that CPU cycles can be fairly allocated to VMs in the default free-mapping case (no affinity restriction), but not so in restricted-mapping cases (when affinities are configured). This fairness issue makes it necessary to extend the meaning of weight, so as to reflect the resource requirements in all cases. In this paper we reconcile the meaning of a domain's weight with CPU-affinity, and improve Credit scheduler as an affinity-aware one. Experimental results show that our affinity-aware proportional share scheduler (named Credit-APS scheduler) brings a good fairness both in free-mapping and restricted-mapping cases. © 2010 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

A novel memory-based storage optimization approach for RDF data supporting SPARQL query 1

引用

4th International Conference on Human-Centric computing, HumanCom'11 and the 6th International Conference on Embedded and Multimedia computing, EMC'11

作者： Zhao, Feng Wu, Delong Yuan, Pingpeng Jin, Hai Service Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology 430074 Wuhan China

ISBN: (数字)9789400721050

ISBN: (纸本)9789400721043

Due to sparse of RDF data, RDF storage approaches using triple table or binary file rarely show high storage usage and high query performance. To achieve the goal of decreasing storage space and improving the efficiency and generality of query on RDF data, a memory-based storage optimization approach supporting SPARQL query is proposed in this paper. For storage efficiency, strings are transferred to 32-bit integer identifiers, RDFS/OWL is used to organize the RDF data storage model, vertical partition method and other ways are utilized to split and organize the RDF triples. For query generality, the storage model also partially supports SPARQL query. Furthermore, by getting the statistics of the underlying storage data, we construct a SPARQL query optimized module. Experiments show that our query optimization module greatly improves the performance of the SPARQL query. Compared with Jena Memory and RDF-3X, our storage method has higher performance. © 2011 Springer Science+Business Media B.V.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

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 scalab.lity 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

来源：评论

学校读者我要写书评

暂无评论

An efficient metadata management method in large distributed storage systems 1

引用

4th International Conference on Human-Centric computing, HumanCom'11 and the 6th International Conference on Embedded and Multimedia computing, EMC'11

作者： Ran, Longbo Jin, Hai Cluster and Grid Computing Lab. Services Computing Technology and System Laboratory Huazhong University of Science and Technology 430074 Wuhan China

ISBN: (数字)9789400721050

ISBN: (纸本)9789400721043

Efficient metadata management is a critical aspect of overall system performance in large distributed storage systems. Directory subtree partitioning and traditional hashing are two common techniques used for managing metadata in such systems, but both have some shortcomings, for example, in directory subtree partitioning method, the root node easily becomes a bottleneck, and for traditional hashing, a large directory hierarchy must be maintained and traversed. In this paper, we present a new method called directory-level-based metadata management that has high efficiency while avoiding the shortcomings of traditional methods. © 2011 Springer Science+Business Media B.V.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

SAND: semi-automated adaptive network defense via programmable rule generation and deployment

引用

Science China(Information Sciences) 2022年第7期65卷 121-138页

作者： Haoyu CHEN Deqing ZOU Hai JIN Shouhuai XU Bin YUAN 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 Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabHubei Engineering Research Center on Big Data Security School of Cyber Science and EngineeringHuazhong University of Science and Technology Department of Computer Science University of Colorado at Colorado Springs

Cyber security is dynamic as defenders often need to adapt their defense postures. The state-ofthe-art is that the adaptation of network defense is done manually(i.e., tedious and error-prone). The ideal solution is to automate adaptive network defense, which is however a difficult problem. As a first step towards automation, we propose investigating how to attain semi-automated adaptive network defense(SAND). We propose an approach extending the architecture of software-defined networking, which is centered on providing defenders with the capability to program the generation and deployment of dynamic defense rules enforced by network defense tools. We present the design and implementation of SAND, as well as the evaluation of the prototype implementation. Experimental results show that SAND can achieve agile and effective dynamic adaptations of defense rules(less than 15 ms on average for each operation), while only incurring a small performance overhead.

关键词： network defense adaptive defense automated defense programmable defense security services software-defined networking security management

来源：评论

学校读者我要写书评

暂无评论

Svega: Answering natural language questions over knowledge base with semantic matching 30

Svega: Answering natural language questions over knowledge b...

引用

30th International Conference on Software Engineering and Knowledge Engineering, SEKE 2018

作者： Li, Gaofeng Yuan, Pingpeng Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)1891706446

Nowadays, more and more large scale knowledge bases are availab.e for public access. Although these knowledge bases have their inherent access interfaces, such as SPARQL, they are generally unfriendly to end users. An intuitive way to bridge the gap between users and knowledge bases is to enable users to ask questions with natural language interface and return desired answers directly. Here the challenge is how to discover the query intention of users. Another challenge is how to obtain accurate answers from knowledge bases. In this paper, we model the query intention with a graph based on an entity-driven method. Consequently, the core problem of natural language question answering can be treated as subgraph matching over knowledge bases. For a query graph, there is a huge number of candidate mappings in a knowledge base, including ambiguities. Thus, a semantic vector is proposed to address disambiguation by evaluating the semantic similarity between edges in a query graph and paths in a knowledge base. By this way, our system can extract accurate answers directly without any offline work. Extensive experiments over the series of QALD challenges show the effectiveness of our system Svega in terms of recall and precision against other state-of-The-Art systems. © 2018 Universitat zu Koln. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Uniform information service interoperation framework among heterogeneous grids

引用

Journal of Networks 2011年第9期6卷 1359-1366页

作者： Tao, Yongcai Wu, Song School of Information Engineering Zhengzhou University Zhengzhou Henan 450001 China Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan 430074 China China

Currently there is no practical standard for grid middleware, most of the grid platforms are built by their own, and it's not easy to interoperate these grid platforms. Information service is one of the key components of the service oriented grid system, and information service interoperation among heterogeneous grids is the first step towards grid interoperation. Existing grid interoperability projects mainly focus on immediate bridge mechanisms, which is intricate and of poor scalab.lity. To address the issues, a uniform information service interoperation framework (UISIF) is proposed in the paper, which is based on the idea of mediated bridge mechanisms, and adopts virtual layer and plug-in technology. There are two wellestablished grid systems in China, Chinagrid and China National grid, and they are built with two different grid middleware, CGSP and VEGA. With UISIF, these two grid systems make information service interoperation a reality without changing the codes of current grid systems. The experiments also show that the information service interoperation has low information querying latency and high accuracy;Moreover, UISIF has good scalab.lity based on hierarchical architecture, virtual layer and plug-in technology. © 2011 ACADEMY PUBLISHER.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

D-overlay: A delay-aware overlay for gaming services

D-overlay: A delay-aware overlay for gaming services

引用

3rd International Conference on Innovative computing Information and Control, ICICIC'08

作者： Xiaofei, Liao Linchen, Yu Hai, Jin Hong, Yao Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China School of Computer Science and Technology China University of Geosciences Wuhan 430074 China

ISBN: (纸本)9780769531618

Peer-to-peer (P2P) has become an important computing model because of its adaptation, selforganization and autonomy. But how to organize dynamic nodes in P2P networks efficiently for gaming message passing services is still a challenge. This paper present an approach, named D-overlay, a delay-aware overlay for gaming services, to implement node clustering based on link delay of nodes communications in the P2P network. This approach measures the delays among peers, explores the node connectivity together with the connection quality. Then, it builds a service ring for each peer according to its latency status, and keeps the low latency among neighbors by periodical adjustments. D-overlay improves the extensibility and reliability. One system, called PKTown, has been deployed based on D-overlay in CERNET of China. © 2008 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：