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

VMckpt:lightweight and live virtual machine checkpointing

Science China(Information Sciences) 2012年第12期55卷 2865-2880页

作者： LIU HaiKun 1,JIN Hai 1,LIAO XiaoFei 1,MA Bo 1 & XU ChengZhong 2 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 2 Department of Electrical and Computer Engineering,Wayne State University,Detroit,MI 48202,USA 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 China2. Department of Electrical and Computer Engineering Wayne State University Detroit MI [48202 USA

Recent advance of virtualization technology provides a new approach to check-point/restart at the virtual machine(VM) *** contrast to traditional process-level checkpointing,checkpointing at the virtualization layer brings up several advantages,such as compatibility,transparence,flexibility and ***,because the virtualization layer has little semantic knowledge about the operation system and the applications running atop,VM-layer checkpointing requires saving the entire operating system state rather than a single *** overhead may render the approach *** reduce the size of VM checkpoint,in this paper we propose a page eviction scheme and an incremental checkpointing mechanism to avoid saving unnecessary VM pages in the *** keep the system online transparently,we propose a live checkpointing mechanism by saving the memory image in a copy-on-write(COW) *** implement the performance optimization mechanisms in a prototype system,called *** results with a group of representative applications show that our page eviction scheme and incremental checkpointing can significantly reduce the checkpoint file size by up to 87% and shorten the total checkpointing/restart time by a factor of up to 71%,in comparison with the Xens default checkpointing *** observed application downtimes due to checkpointing can be reduced to as small as 300 ms.

关键词： checkpoint/restart copy-on-write page eviction virtual machine

来源：评论

学校读者我要写书评

暂无评论

Accelerating GPGPU architecture simulation 13

Accelerating GPGPU architecture simulation

引用

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems

作者： Zhibin Yu Lieven Eeckhout Nilanjan Goswami Tao Li Lizy John Hai Jin Chengzhong Xu Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China ELIS Department Ghent University Ghent Belgium Intelligent Design of Efficient Architectures Lab University of Florida Gainesville USA Department of Electrical and Computer Engineering University of Texas at Austin Austin USA Service Computing Technologies and System Lab/Cluster and Grid Computing Lab HUST Wuhan China Department of Electrical and Computer Engineering Wayne State University Detroit USA

ISBN: (纸本)9781450319003

Recently, graphics processing units (GPUs) have opened up new opportunities for speeding up general-purpose parallel applications due to their massive computational power and up to hundreds of thousands of threads enabled by programming models such as CUDA. However, due to the serial nature of existing micro-architecture simulators, these massively parallel architectures and workloads need to be simulated sequentially. As a result, simulating GPGPU architectures with typical benchmarks and input data sets is extremely time-consuming. This paper addresses the GPGPU architecture simulation challenge by generating miniature, yet representative GPGPU kernels. We first summarize the static characteristics of an existing GPGPU kernel in a profile, and analyze its dynamic behavior using the novel concept of the divergence flow statistics graph (DFSG). We subsequently use a GPGPU kernel synthesizing framework to generate a miniature proxy of the original kernel, which can reduce simulation time significantly. The key idea is to reduce the number of simulated instructions by decreasing per-thread iteration counts of loops. Our experimental results show that our approach can accelerate GPGPU architecture simulation by a factor of 88X on average and up to 589X with an average IPC relative error of 5.6%.

关键词： micro-architecture simulation performance general purpose graphics processing unit (GPGPU)

来源：评论

学校读者我要写书评

暂无评论

A control mechanism about quality of service for resource management in simulation grid

A control mechanism about quality of service for resource ma...

引用

4th International Conference on Computational and Information Sciences, ICCIS 2012

作者： Kuang, Ping Jin, Hai Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769547893

The simulation grid has become a very important research topic. In order to ensure the QoS of resource management, we present a control mechanism in simulation grid, which is based on the prediction methods. In the control mechanism, we first introduce our resource management module in simulation grid. Then, we propose a resource allocation algorithm. In order to justify the feasibility and the availability of this control mechanism, a series of experiments have been done. The results show that it is feasible to schedule the system resources and control the QoS of system resources for tasks in simulation grid. © 2012 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed transactional memory system

An efficient distributed transactional memory system

引用

11th IEEE International Conference on Trust, Security and Privacy in computing and Communications, TrustCom-2012

作者： Peng, Xin Liao, Xiaofei Jin, Hai Fan, Xuepeng Tu, Xuping Yu, Linchen Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769547459

Transactional memory (TM) is a parallel programming concept which reduces challenges in parallel programming. Existing distributed transactional memory system consumes too much bandwidth and brings high latency. In this work, we present Transactional Memory System for cluster (Clustm), a generalized and scalable distributed transactional memory system. Our system addresses several open issues posed by this domain, including transactional memory consistency protocol, cache consistency protocol, and the distribution strategy of the metadata of shared data across the cluster. Then, we evaluate our design with several workloads, and the results demonstrate outstanding performance. © 2012 IEEE.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Optimizing data shuffling in data-parallel computation by understanding user-defined functions 9

Optimizing data shuffling in data-parallel computation by un...

引用

9th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2012

作者： Zhang, Jiaxing Zhou, Hucheng Chen, Rishan Fan, Xuepeng Guo, Zhenyu Lin, Haoxiang Li, Jack Y. Lin, Wei Zhou, Jingren Zhou, Lidong Microsoft Research Asia China Microsoft Bing United States Peking University China Services Computing Technologyand System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Georgia Institute of Technology United States

Map/Reduce style data-parallel computation is characterized by the extensive use of user-defined functions for data processing and relies on data-shuffling stages to prepare data partitions for parallel computation. Instead of treating user-defined functions as "black boxes", we propose to analyze those functions to turn them into "gray boxes" that expose opportunities to optimize data shuffling. We identify useful functional properties for userdefined functions, and propose SUDO, an optimization framework that reasons about data-partition properties, functional properties, and data shuffling. We have assessed this optimization opportunity on over 10,000 dataparallel programs used in production SCOPE clusters, and designed a framework that is incorporated it into the production system. Experiments with real SCOPE programs on real production data have shown that this optimization can save up to 47% in terms of disk and network I/O for shuffling, and up to 48% in terms of cross-pod network traffic. © 2012 by The USENIX Association. All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient disk I/O scheduling with QoS guarantee for Xen-based hosting platforms 12

Efficient disk I/O scheduling with QoS guarantee for Xen-bas...

引用

12th IEEE/ACM International Symposium on cluster, Cloud and grid computing, CCgrid 2012

作者： Ling, Xiao Jin, Hai Ibrahim, Shadi Cao, Wenzhi Wu, Song Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China INRIA Rennes Bretagne Atlantique Rennes France

ISBN: (纸本)9780769546919

In this paper, we address the problem of allocating disk resources to guarantee specified latency and throughput targets of VMs while keeping efficient disk I/O. Accordingly, we present two-level scheduling framework, namely Flubber, in Xen-based hosting platform that decouples latency and throughput allocation. The high-level throughput control regulates the pending requests from the VMs, in order to meet the throughput requirements of different VMs and ensure isolation. Meanwhile, the low-level latency control, by the virtue of the batch and delay EDF mechanism, reorders all pending requests from VMs based on the their deadlines, and batches them to the disk device considering the locality of accesses across VMs. We have implemented Flubber with intensive evaluations on Xen-based host. The results show that Flubber can simultaneously meet the different service requirements of VMs while improving the efficiency of the physical disk. In contrast to CFQ, besides that Flubber achieves the desired QoS of each VM, Flubber speeds up the sequential and random read by 17% and 25% due to the efficient physical disk utilization. © 2012 IEEE.

关键词： Throughput

来源：评论

学校读者我要写书评

暂无评论

Towards Privacy Preserving Mining over Distributed Cloud Databases

Towards Privacy Preserving Mining over Distributed Cloud Dat...

引用

International Conference on Cloud and Green computing (CGC)

作者： Ayad Ibrahim Hai Jin Ali A. Yassin Deqing Zou Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory Huazhong University of Science and Technology Wuhan China

Due to great advances in computing and Internet technologies, organizations have been enabled to collect and generate a large amount of data. Most of these organizations tend to analyze their data to discover new patterns. Usually, analyzing such amount of data requires huge computational power and storage facilities that may not be available to these organizations. Cloud computing offers the best way to solve this problem. Storing the private data of different organizations in the same cloud server enhances the mining process, but at the same time, raises privacy concerns. Therefore, it is highly recommended to support privacy preserving data mining algorithms in the cloud environment. This paper introduces an efficient and accurate cryptography-based scheme for mining the cloud data in a secure way without loss of accuracy. Specifically, we address the problem of K-nearest neighbor (KNN) classification over horizontally distributed databases without revealing any unnecessary information. We have utilized the recently developed cryptography primitive, order preserving symmetric encryption (OPSE), to integrate securely the local classifications at a lower cost than the previously presented privacy preserving data mining schemes. Empirical results on real datasets demonstrate that the proposed scheme has similar performance with the naive mining systems in terms of classification accuracy.

关键词： Cryptography Vectors Distributed databases Accuracy Training Data privacy

来源：评论

学校读者我要写书评

暂无评论

Secure Rank-Ordered Search of Multi-keyword Trapdoor over Encrypted Cloud Data

Secure Rank-Ordered Search of Multi-keyword Trapdoor over En...

引用

IEEE Asia-Pacific Conference on services computing (APSCC)

Advances in cloud computing and Internet technologies have pushed more and more data owners to outsource their data to remote cloud servers to enjoy with huge data management services in an efficient cost. However, despite its technical advances, cloud computing introduces many new security challenges that need to be addressed well. This is because, data owners, under such new setting, loss the control over their sensitive data. To keep the confidentiality of their sensitive data, data owners usually outsource the encrypted format of their data to the untrusted cloud servers. Several approaches have been provided to enable searching the encrypted data. However, the majority of these approaches are limited to handle either a single keyword search or a Boolean search but not a multikeyword ranked search, a more efficient model to retrieve the top documents corresponding to the provided keywords. In this paper, we propose a secure multi-keyword ranked search scheme over the encrypted cloud data. Such scheme allows an authorized user to retrieve the most relevant documents in a descending order, while preserving the privacy of his search request and the contents of documents he retrieved. To do so, data owner builds his searchable index, and associates with each term document with a relevance score, which facilitates document ranking. The proposed scheme uses two distinct cloud servers, one for storing the secure index, while the other is used to store the encrypted document collection. Such new setting prevents leaking the search result, i.e. the document identifiers, to the adversary cloud servers. We have conducted several empirical analyses on a real dataset to demonstrate the performance of our proposed scheme.

关键词： Servers Indexes Encryption Privacy Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Anonymous Password Authentication Scheme by Using Digital Signature and Fingerprint in Cloud computing

Anonymous Password Authentication Scheme by Using Digital Si...

引用

International Conference on Cloud and Green computing (CGC)

作者： Ali A. Yassin Hai Jin Ayad Ibrahim Deqing Zou Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Cloud security represents a main hindrance that causes to retard its widespread adoption. Authentication considers a significance element of security in cloud environment, aiming to verify a user's identity when a user wishes to request services from cloud. There are many authentication schemes that depend on username/password, but they are considered weak techniques of cloud authentication. A more secure scheme is the two-factor authentication that does not only verify the username/password pair, but also needs a second factor such as a token device, biometric. However, the feasibility of second-factor authentication is limited by the deployment complexity, high cost and the cloud security is compromised when the token is missing or purloined. Furthermore, these schemes are failed to resist well-known attacks such as replay attacks, reflection attacks. This paper proposes two-factor authentication scheme based on Schnorr digital signature and feature extraction from fingerprint to overcome above aforementioned issues. Security analysis and experimental results illustrate that our proposed scheme can withstand the common security attacks as well, and has a good performance of password authentication.

关键词： Authentication Servers Feature extraction Cryptography Digital signatures Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A comprehensive monitoring framework for virtual computing environment

A comprehensive monitoring framework for virtual computing e...

引用

International Conference on Information Networking

作者： Guofu Xiang Hai Jin Deqing Zou Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Virtualization can divide or aggregate the underlying resource flexibly, and it attracts attention from both academic and industry in recent years. Guest operating systems in virtual machines can be various, and the states of virtual machines changes all the time. Due to the complexity of virtual computing environment, it brings tremendous challenges for security monitoring. Existing monitoring mechanism can not adapt to the dynamic and diversity of virtual machines. Therefore, a comprehensive monitoring framework, named ComMon, is proposed in this paper, which implements comprehensive monitoring from three aspects: network, process, and file. It has the characteristics of real-time, transparency and generality.

关键词： Monitoring Registers Kernel Linux Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：