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

11th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2010

作者： Wu, Song Deng, Li Jin, Hai Shi, Xuanhua Zhao, Yankun Gao, Wei Zhang, Jianyin Peng, Jin Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China China Mobile Research Institute Beijing 100053 China

ISBN: (纸本)9780769542874

With the popularity of virtualization, the problem that how to manage hundreds even thousands of virtual machines running on multiple physical computing nodes becomes important. Current virtual machine management systems only can obtain basic information of virtual machines and execute simple operations on them, such as start, reboot and shutdown. In this paper, we design a virtual machine management approach based on agent service. Agent service can provide detail running status information inside virtual machines. It also has been a bridge for host machines and virtual machines to interact with each other. Agent service is designed to automatically start when virtual machine boots up. By agent service we can get real-time information about virtual machines. We evaluate monitoring overhead and the performance of batch operations when using agent. The experimental results show that agent mechanism outperforms methods using Libvirt or VMware tools. © 2010 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

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

引用

10th IEEE International Conference on Computer and Information technology, CIT-2010, 7th IEEE International Conference on Embedded Software and systems, ICESS-2010, 10th IEEE Int. Conf. Scalable computing and Communications, ScalCom-2010

作者： Yu, Linchen Liao, Xiaofei Jin, Hai Qin, Pengcheng Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China School of Computer China University of Geosciences Wuhan 430074 China

ISBN: (纸本)9780769541082

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. © 2010 IEEE.

关键词： Voice/data communication systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

iDARE: Proactive data replication mechanism for P2P VoD system

iDARE: Proactive data replication mechanism for P2P VoD syst...

引用

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

ISBN: (纸本)9780769541082

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. © 2010 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards scalable middleware for multiplayer online games

Towards scalable middleware for multiplayer online games

引用

5th Annual ChinaGrid Conference, ChinaGrid 2010

作者： Tu, Xuping Wu, Lei Zheng, Long Jin, Hai Jiang, Wenbing Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China School of Computer Science and Engineering University of Aizu Aizu-Wakamatsu City 985-8580 Japan

ISBN: (纸本)9780769541068

Warcraft III is one of the most popular Multiplayer Online Game (MOG) games, where users are designed to interact with support of a dedicated server. PKTown is a P2P-based third-party middleware developed to replace the dedicated servers. This paper presents the scalability and robustness of PKTown 2.0 architecture. The evaluation demonstrates the efficiency of the architecture. © 2010 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Affinity-aware Proportional Share Scheduling for Virtual Machine system

Affinity-aware Proportional Share Scheduling for Virtual Mac...

引用

The Ninth International Conference on Grid and Cloud computing(第九届网格与云计算国际学术会议 GCC 2010)

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.

关键词： Xen Proportional Share Credit Scheduler Free-mapping Restricted-mapping APS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：