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

Proceedings of the 19th ACM International Symposium on High Performance Distributed computing

作者： Huang, Dachuan Shi, Xuanhua Ibrahim, Shadi Lu, Lu Liu, Hongzhang Wu, Song Jin, Hai Cluster and Grid Computing Lab. Services Computing Technique and System Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781605589428

MapReduce programming model is emerging as an efficient tool for data-intensive applications. Hadoop, an open-source implementation of MapReduce, has been widely adopted and experienced by both academia and enterprise. Recently, lots of efforts have been done on improving the performance of MapReduce system and on analyzing the MapReduce process based on the log files generated during the Hadoop execution. Visualizing log files seems to be a very useful tool to understand the behavior of the Hadoop process. In this paper, we present MRScope, a real-time MapReduce tracing tool. MR-Scope provides a real-time insight of the MapReduce process, including the ongoing progress of every task hosted in Task Tracker. In addition, it displays the health of the Hadoop cluster data nodes, the distribution of the file system's blocks and their replicas and the content of the different block splits of the file system. We implement MR-Scope in native Hadoop 0.1. Experimental results demonstrat that MR-Scope's overhead is less than 4% when running wordcount benchmark. Copyright 2010 ACM.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

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 collaborate well with CPU-affinity. It behaves as if all PCPUs are available 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

来源：评论

学校读者我要写书评

暂无评论

Performance modeling of resource failures in grid environments

Performance modeling of resource failures in grid environmen...

引用

International Conference on Frontier of Computer Science and technology

作者： Tao, Yongcai Wu, Song Shi, Lei 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

ISBN: (纸本)9780769541396

grid is susceptible to a number of software and hardware failures, so a deep understanding of and modeling the grid resource failures are a challenge and have significant influence on grid researching. However, due to various reasons such as commercial secret and security, it is difficult to obtain real historical logs of grids. Therefore, an accurate model of resource failures is critically useful. In the paper, through analyzing the grid log data, we detail the suitability of three potential statistical distributions for each data set: Wetbull, Zipf's law and Pareto. Then, this paper develops a grid resource failure simulator. Finally, with the different failure patterns generated by the failure simulator, the paper evaluates several common scheduling algorithms used in grid systems. © 2010 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

SHelp: Automatic self-healing for multiple application instances in a virtual machine environment

SHelp: Automatic self-healing for multiple application insta...

引用

作者： Chen, Gang Jin, Hai Zou, Deqing Zhou, Bing Bing Qiang, Weizhong Hu, Gang Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China Centre for Distributed and High Performance Computing School of Information Technologies University of Sydney NSW 2006 Australia

ISBN: (纸本)9780769542201

When multiple instances of an application running on multiple virtual machines, an interesting problem is how to utilize the fault handling result from one application instance to heal the same fault occurred on other sibling instances, and hence to ensure high service availability in a cloud computing environment. This paper presents SHelp, a lightweight runtime system that can survive software failures in the framework of virtual machines. It applies weighted rescue points and error virtualization techniques to effectively make applications bypass the faulty path. A two-level storage hierarchy is adopted in the rescue point database for applications running on different virtual machines to share error handling information to reduce the redundancy and to more effectively and quickly recover from future faults caused by the same bugs. A Linux prototype is implemented and evaluated using four web server applications that contain various types of bugs. Our experimental results show that SHelp can make server applications to recover from these bugs in just a few seconds with modest performance overhead. © 2010 IEEE.

关键词： Software reliability

来源：评论

学校读者我要写书评

暂无评论

Autonomous Agent Based Intrusion Detection in Virtual computing Environment

Autonomous Agent Based Intrusion Detection in Virtual Comput...

引用

2010 IEEE International Conference Conferenhce on Wireless Communications,Networking and Information Security(2010 IEEE 无线通信、网络技术与信息安全国际会议 WCNIS)

作者： Feng Zhao Alex K. Ohoussou Deqing Zou Hai Jin Guofu Xiang Ge Cheng Cluster and Grid Computing Lab Services Computing Technology and System Lab Huazhong University of S Cluster and Grid Computing Lab Services Computing Technology and System Lab Huazhong University of S

One of the motivations for virtualization technology is the desire to develop new services to enhance system security without trusting both the applications and the operating systems. An intrusion detection system is an example of such service that can help to isolate users from malicious attacks. In this paper, we propose hybrid-based intrusion detection architecture in virtual computing environment to detect and isolate harmful behaviors by real-time monitoring and alarming. In contrast to monolithic intrusion detection system, we introduce autonomous agents, acting independently of each other, to monitor the system. The agents are deployed in virtual machines to analyze actions occurring on the network and inside the hosts to determine whether they are potential security violations or not. Our architecture is implemented based on Xen, and the detection management center is deployed in a secure virtual machine.

关键词： intrusion detection autonomous agent virtual computing environment

来源：评论

学校读者我要写书评

暂无评论

LEEN: Locality/fairness-aware key partitioning for MapReduce in the cloud

LEEN: Locality/fairness-aware key partitioning for MapReduce...

引用

2nd IEEE International Conference on Cloud computing technology and Science, CloudCom 2010

作者： Ibrahim, Shadi Jin, Hai Lu, Lu Wu, Song He, Bingsheng Qi, Li Cluster and Grid Computing Lab Services Computing Technology and System Lab Huazhong University of Science and Technology Wuhan 430074 China School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore Information and Technology Department China Development Bank Beijing 100037 China

ISBN: (纸本)9780769543024

This paper investigates the problem of Partitioning Skew1 in MapReduce-based system. Our studies with Hadoop, a widely used MapReduce implementation, demonstrate that the presence of partitioning skew causes a huge amount of data transfer during the shuffle phase and leads to significant unfairness on the reduce input among different data nodes. As a result, the applications experience performance degradation due to the long data transfer during the shuffle phase along with the computation skew, particularly in reduce phase. We develop a novel algorithm named LEEN for locality-aware and fairness-aware key partitioning in MapReduce. LEEN embraces an asynchronous map and reduce scheme. All buffered intermediate keys are partitioned according to their frequencies and the fairness of the expected data distribution after the shuffle phase. We have integrated LEEN into Hadoop-0.18.0. Our experiments demonstrate that LEEN can efficiently achieve higher locality and reduce the amount of shuffled data. More importantly, LEEN guarantees fair distribution of the reduce inputs. As a result, LEEN achieves a performance improvement of up to 40% on different workloads. © 2010 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

A high-performance inter-domain data transferring system for virtual machines

Journal of Software

引用

Journal of Software 2010年第2期5卷 206-213页

作者： Li, Dingding Jin, Hai Shao, Yingzhe Liao, Xiaofei Han, Zongfen Chen, Kai 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

Virtual machine technology can enhance server utilization and consolidation on an individual physical machine. In a growing number of contexts, many of which re-quire high-performance networking inside of the system. Unfortunately, the development of virtualization technology is inclined to application isolation as yet, leads high communication overheads between virtual machines which are resident on the same physical machine, and also limits the achievable network performance. Some efforts have been paid to bridge the network I/O performance gap between the virtualization and native environment, but the amelioration is not satisfactory. In this paper, we propose a system called IDTS (Inter-Domain Transferring system) which uses the shared memory between different domains (also called hosted or guest OSes) to expand the communication band-width and shorten the latency for network applications running in the co-resident VMs. Evaluations are also presented to prove IDTS's availability and highly efficiency. We believe that IDTS is an effective solution for the inter-domain communication on Xen virtualization platform. © 2010 Academy Publisher.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Efficient and Progressive Algorithms for Distributed Skyline Queries over Uncertain Data

Efficient and Progressive Algorithms for Distributed Skyline...

引用

IEEE International Conference on Distributed computing systems

作者： Xiaofeng Ding Hai Jin Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (纸本)9781424472611;9780769540597

The skyline operator has received considerable attention from the database community, due to its importance in many applications including multi-criteria decision making, preference answering, and so forth. In many applications where uncertain data a re inherently exist, i.e., data collected from different sources in distributed locations are usually with imprecise measurements, and thus exhibit kind of uncertainty. Taking into account the network delay and economic cost associated with sharing and communicating large amounts of distributed data over an internet, an important problem in this scenario is to retrieve the global skyline tuples from all the distributed local sites with minimum communication cost. Based on the well known notation of the probabilistic skyline query over centralized uncertain data, in this paper, for the first time, we propose the notation of distributed skyline queries over uncertain data. Furthermore, two communication- and computation-efficient algorithms are proposed to retrieve the qualified skylines from distributed local sites. Extensive experiments have been conducted to verify the efficiency and the effectiveness of our algorithms with both the synthetic and real data sets.

关键词： Plant uncertain Distribute network delay Uncertainty algorithms

来源：评论

学校读者我要写书评

暂无评论

MISM: Modelica-Based Interactive Scheduling Mechanism for Virtual Educational Experiments

MISM: Modelica-Based Interactive Scheduling Mechanism for Vi...

引用

Chinagrid Annual Conference (Chinagrid)

作者： Wenbin Jiang Zhen Tang Hai Jin Chao Liu Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Different virtual educational experiments (VEEs) have different frameworks and implementations in different disciplines. How to integrate different VEEs into one unified supporting platform is a challenging problem. The key problem of this integration is how to build a unified mathematical model for VEEs of diversified disciplines. However, most existing multi-domain uniform modeling (MDUM) approaches such as Modelica are research-oriented and lack of real time interaction, which does not meet the requirement of virtual experiments that are user-oriented and highly interactive. To tackle above problem, a Modelica-based interactive scheduling mechanism (MISM) for VEE is proposed. In MISM, user-oriented interaction is based on a best step length algorithm and an interactive event step algorithm. The throughput is considered in the former and the real time interaction is resolved by the latter. Experimental results shows that the approaches presented can meet the requirements of VEEs efficiently.

关键词： Computational modeling Object oriented modeling Load modeling Adaptation model Data models Mathematical model Real time systems

来源：评论

学校读者我要写书评

暂无评论

XenHVMAcct: Accurate CPU Time Accounting for Hardware-Assisted Virtual Machine

XenHVMAcct: Accurate CPU Time Accounting for Hardware-Assist...

引用

IEEE International Conference on Parallel and Distributed computing, Applications and Technologies (PDCAT)

作者： Huacai Chen Hai Jin Kan Hu Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

CPU time accounting is a basis of performance measurement and process scheduling in operating system. Accounting operations are traditionally completed in timer interrupt handler since timer interrupt is periodically delivered to OS. However, when virtualization introduced, the CPU time is shared by multiple virtual CPUs (i.e., VCPU for short) and the virtual timer interrupt is paused for those ones be scheduled out. This makes the time accounting be inaccurate, and we should consider new method for VM to provide a stable and reliable data source, especially for the hardware-assisted virtual machines (i.e., HVM for short) which are not aware of VMM. The key point of accurate CPU time accounting is to distinguish the time allocated to “this VCPU” and “other VCPUs”. Para-virtualization (i.e., PV for short) achieves this goal by modifying the timer handling routines. For HVM, we propose an accurate accounting method (named XenHVMAcct) within Xen virtual platform. XenHVMAcct is designed by using the mechanisms of virtual interrupt and loadable kernel module, without direct modifications to guest OS. Experimental results show that our accounting method is as accurate as the PV solution.

关键词： Kernel Linux Real time systems Measurement Program processors Virtual machining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：