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

International Conference on Ubiquitous Information Technologies and Applications (ICUT)

作者： Zhiyuan Shao Jian Huang Hai Jin Kan Hu 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

In this work, we propose computing resource management system based on Xen VMM and multi-core system, called XenMVM. It adjusts the computing resource dynamically according to the actual workload generated by the applications running in the virtual machine to improve the resource utilization of the computer system. According to the shared L2 cache architecture of multi-core system, we propose the Underlying Layout Aware Scheduling (ULAS) which can schedule the virtual CPUs of virtual machines to the appropriate physical CPUs. The test result shows that ULAS can improve the performance about 4.5%~32.52%. Furthermore, to improve the whole performance of multiple virtual machines and meet the needs of specific jobs (i.e., urgent and I/O intensive) deployed in the virtual machines, a simplified method called Domain-based static priority is adopted in XenMVM. Using case studies we show that our proposal reduces the turnover time of the whole system by 20.45% compared with FCFS scheduling scheme.

关键词： Virtual machining Processor scheduling Program processors Multicore processing Scheduling Resource management

来源：评论

学校读者我要写书评

暂无评论

FTDS: Adjusting Virtual computing Resources in Threshing Cases

FTDS: Adjusting Virtual Computing Resources in Threshing Cas...

引用

Euromicro Conference on Parallel, Distributed and Network-Based Processing

作者： Jian Huang Hai Jin Kan Hu Zhiyuan Shao 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

In a virtual execution environment, dynamic computing resource adjustment technique, configuring the computing resource of virtual machines automatically according to the actual loads generated by applications, is often adopted in virtual machine monitor to improve the resource utilization rate. Traditionally, the simple Additive Increase Subtractive Decrease (AISD) scheme is used as an adjusting rule. However, in some special situations, for example, compiling kernel in a virtual machine, the configuration of virtual machines may change abruptly because of the violent vibration of workload during a short interval, and the threshing can inevitably result in additional overhead under AISD rule. In this paper, we extend the Proportional-Integral-Derivative (PID) algorithm and present a feedback control model for configuring virtual computing resources, and propose an innovative adjusting scheme called Forecasting and Time Delayed Subtraction (FTDS) to reduce the overhead caused by threshing. The FTDS uses both statistic history of resource requests and current utilization of computing resource to predict whether threshing happens and to determine how many and when to adjust the amount of virtual CPUs. Experimental results show that FTDS can effectively reduce the jitter occurred in adjusting and make the performance penalty for threshing decreased from 9% to 0.3% compared with AISD, while maintaining that in non-threshing cases the same as AISD.

关键词： Virtual machining Virtual machine monitors Resource management Kernel Three-term control Feedback control Predictive models Delay effects Statistics History

来源：评论

学校读者我要写书评

暂无评论

Measurement Study of PKTown: A P2P-Based Multiplayer Online Game Supporting System

Measurement Study of PKTown: A P2P-Based Multiplayer Online ...

引用

International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)

作者： Xuping Tu Hai Jin Wenbin Jiang Xiaofei Liao 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

Multiplayer Online Game has been extremely popular, in which peer-to-peer technology has been introduced to help with the scaling. This paper presents a measurement study on a P2P-based MOG supporting system, called PKTown, which has been fully deployed over the CERNET. By leveraging a large set of traces obtained recently over a 4-month period, we study the benefit of P2P architecture applying to MOG supporting system, workload characteristics, players' behaviors and impact form a number of system parameters. We believe this provides insights in understanding the fundamental nature of MOG, which can be further explored to enhance the system design.

关键词： Games Servers Relays Correlation Bandwidth Peer to peer computing computer architecture

来源：评论

学校读者我要写书评

暂无评论

Meld: A Real-Time Message Logic Debugging System for Distributed Systems

Meld: A Real-Time Message Logic Debugging System for Distrib...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Xuping Tu Hai Jin Xuepeng Fan Jiang Ye 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

The largest difference between a distributed and a non-distributed system is that the former introduces network messages to the system. Network messages bring the scalability to a distributed system as well as complexity to it. Testing large-scale distributed systems is a great challenge, because some errors happen after a distributed sequence of events that involves machine and network failures. Meld is a checker that allows developers to specify expected message logic on a deployed distributed system, and that verifies these logics while the system is running. When Meld finds a problem it starts collecting more information that led to the problem, allowing developers to quickly find the root cause. Developers write message logics on Meld and Meld verifies them through analyzing the collected abstract of messages. By using binary instrumentation, Meld works almost transparently with debugged systems and can change logics to be checked at runtime. An evaluation with a deployed system shows that Meld can detect non-trivial correctness at runtime.

关键词： Servers Debugging Runtime Monitoring computer bugs Receivers Payloads

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 Hierachical VoIP System Based on Peer-to-Peer SIP: A Manageable Approach

A Hierachical VoIP System Based on Peer-to-Peer SIP: A Manag...

引用

International Conference on computer and Information technology (CIT)

作者： Linchen Yu Xiaofei Liao Hai Jin Pengcheng Qin 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 School of Computer China University of Geoscience Wuhan China

Peer-to-Peer SIP is proposed to leverage Peer-to-Peer computing to control multimedia sessions in a decentralized manner. A lot of companies can be benefited if conventional SIP environment does not require the configuration and maintenance of central servers. However, existing P2PSIP systems put too much emphasis on the decentralization of SIP elements and the briefness of distribution. To some extent, P2PSIP system is manageable, but the control of the entire system is still relatively weak. In this paper, we propose a hierarchical P2PSIP system to address the manageable problems. Actual deployment and exhaustive simulations are performed to evaluate the performance of our P2PSIP schemes. Results indicate that the manageable approach not only solves the control liability problem, but also performs good reliability, scalability, and interoperability.

关键词： Servers Tin Reliability Protocols IP networks Authentication Registers

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

iDARE: Proactive Data Replication Mechanism for P2P VoD System

iDARE: Proactive Data Replication Mechanism for P2P VoD Syst...

引用

International Conference on computer and Information technology (CIT)

作者： Xiaofei Liao Fan Zhang Hai Jin Linchen Yu 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 China University of Geoscience Wuhan China

Peer-to-peer (P2P) on-demand streaming systems inevitably suffer from peers churn that is the inherent dynamic characteristic of overlay network. With frequent peer departure, a large amount of media data cached on peer disk turns offline and unavailable, which becomes the major reason of heavy server load. To address the above issue, a new proactive data replication mechanism is proposed and implemented in existing P2P on-demand system GirdCast. Based on the new mechanism, peer can proactively replicate data chunks to stable cache servers for future sharing, when it has high possibility to leave the overlay. Two key heuristic algorithms are designed for departure prediction and replicated chunks selection. System trace driven simulation shows that the mechanism greatly decreases bandwidth load of media source server and improves the availability of chunks highly demanded but poorly provisioned by overlay peers.

关键词： Servers Peer to peer computing Media Availability Streaming media Bandwidth Distributed databases

来源：评论

学校读者我要写书评

暂无评论

VITS Test Suit: A Micro-benchmark for Evaluating Performance Isolation of Virtualization Systems

VITS Test Suit: A Micro-benchmark for Evaluating Performance...

引用

IEEE International Conference on e-Business Engineering (ICEBE)

作者： Pingpeng Yuan Chong Ding Long Cheng Shengli Li Hai Jin Wenzhi Cao Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Virtualization technology improves the resource utilization, but also raises the probability of resource contention. Thus, it arises one problem, namely how about performance isolation among VMs. To answer the question, benchmarks are highly required to evaluate performance isolation. However, few benchmarks to give solutions to the problem are available. Especially, there does not exist a micro-benchmark to measure how the performance of individual primitive operations varies with the type of misbehavior. In the paper, we present VITS - a micro-benchmark to evaluate the performance isolation of virtualization system. VITS Test Suite can test both software and hardware performance isolation. It is mainly consisted of six interference programs, which respectively test the performance isolation of cache, memory bandwidth, memory space, CPU, network and disk. VITS Test Suite provides results for user to analyze the performance isolation problem of the virtualization system along with the underlying hardware. Besides, we test Xen using VITS test suit. The experimental results show that, the cache, memory and disk performance isolation still have some big weak points to improve, in other words, the current virtualization system Xen is still unfair in fine-grained resource share.

关键词： Virtual machining Interference Memory management Benchmark testing Driver circuits Hardware Operating systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：