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

Security aware parallel and independent job scheduling in grid computing environments based on adaptive job replication

引用

Journal of Networks 2011年第9期6卷 1321-1328页

作者： Jiang, Congfeng Xu, Xianghua Wan, Jian Grid and Service Computing Technology Lab Hangzhou Dianzi University Hangzhou China

In grid environment, jobs may be scheduled to multiple machines across different administrative domains. However, grid security is a main hurdle to make the job scheduling decision secure, reliable and fault tolerant. A security-aware parallel and independent job scheduling algorithm in grid computing environment based on adaptive job replications was proposed. In risky and failure-prone grids, it is robust due to its adaptive job replications and rescheduling mechanism. Simulation results generated based on the Simgrid package show that a higher scheduling success of 97% rate and higher grid resource utilization of 74% can be achieved. The performance of our algorithm is better than non-security-aware scheduling algorithms based on fixed-number job replications and it is fault tolerant and scalable. © 2011 ACADEMY PUBLISHER.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Resources Allocation in Virtualized Systems Based on Try-before-buy Approach

Resources Allocation in Virtualized Systems Based on Try-bef...

引用

2011 2ND International Conference on Innovative computing and Communication and 2011 Asia-Pacific Conference on Information technology and Ocean Engineering(CICC-ITOE 2011)

作者： Ritai Yu Congfeng Jiang Xianghua Xu Hui Cheng Jian Wan Grid and Service Computing Technology Lab Hangzhou Dianzi University

In virtualization environments, resources are shared across multiple virtual machines(VMs), which results in contentions and even conflicting under heavily loaded or consolidated situations. In order to accommodate as many as service instances while still delivering performance guarantees, resource allocation should be optimized in a just adequate manner such that less resources will be utilized for a specific performance requirement. To achieve this goal, in this paper we propose a try-before-buy approach for allocating contending resources. This approach firstly does a try of minor resource allocation to find the performance feedback and search for the optimal amount of resource that should be allocated to the target virtual machine. This approach does not require a highly accurate performance model in a virtualized system where workloads usually change frequently with time in some intervals. Experiments on a Xen based virtualized environment are conducted and evaluated for its effectiveness. The results show that the proposed approach utilizes less CPU and memory resources to achieve the same performance goals compared to default Xen configuration with over-provisioning..

关键词： virtualization provisioning resource allocation performance feedback

来源：评论

学校读者我要写书评

暂无评论

Resources Allocation in Virtualized Systems Based on Trybefore-buy Approach

Resources Allocation in Virtualized Systems Based on Trybefo...

引用

2011 2nd International Conference on Challenges in Environmental Science and Computer Engineering (CESCE 2011)

作者： Ritai Yu Congfeng Jiang Xianghua Xu Hui Cheng Jian Wan Grid and Service Computing Technology Lab Hangzhou Dianzi University

关键词： Virtualization Provisioning Resource allocation Performance feedback

来源：评论

学校读者我要写书评

暂无评论

Thin Provisioning of Virtualized Resources with Minimal Performance Degradation

Thin Provisioning of Virtualized Resources with Minimal Perf...

引用

The Second International Conference on High Performance Networking, computing,and Communication Systems（ICHCC 2011）

作者： Ritai Yu Congfeng Jiang Xianghua Xu Jian Wan Grid and Service Computing Technology Lab Hangzhou Dianzi University

In consolidated virtualization systems, hardware resources are shared and multiplexed across multiple virtual machines(VMs) for energy and cost savings, where resources are over-provisioned according to the peak demand of VMs to provide performance guaranteesThis over-provisioning manner results in resource waste and contention under heavily load conditionsAs a result, there is a need to multiplex resources among VMs in a fine-grained thinprovisioning manner in heavily loaded virtualized systemIn this paper we propose such a thin provisioning approach for resource allocation among VMs with minimal performance degradationsOur approach consists of two parts: one is workload characterization, and the other is dynamic resource allocation via prioritizationExperiments on a Xen based virtualized environment are conducted and evaluatedThe results show that the proposed approach can support concurrent contending requests with acceptable performance penalties.

关键词： virtualization,thin provisioning,resource allocation,prioritization,workload characterization

来源：评论

学校读者我要写书评

暂无评论

Resource allocation in contending virtualized environments through VM performance modeling and feedback

Proceedings - 2011 6th Annual ChinaGrid Conference, ChinaGri...

引用

Proceedings - 2011 6th Annual Chinagrid Conference, Chinagrid 2011 2011年 196-203页

作者： Jiang, Congfeng Xu, Xianghua Zhang, Jilin Li, Yunfa Wan, Jian Grid and Service Computing Technology Lab. Hangzhou Dianzi University Hangzhou 310037 China

ISBN: (纸本)9780769544724

With active deployment of virtualization in large scale data centers and cloud computing environments, allocation and scheduling of virtual and physical resources raise more challenges and may have negative impacts on system performance due to: (1) the isolation between the guest Virtual Machines (VMs) and the Virtual Machines Monitor (VMM), and (2) the independent and even conflicting operations between multiple VMs. In this paper a stochastic model of resources in virtualized environments is proposed and resource allocation and scheduling algorithm are proposed to provide performance guarantees and service differentiation in contending conditions. In the proposed algorithm user behavior and workloads are characterized through the historical and real time performance profiling and estimation from hosted agents within individual VMs. The resources are allocated according to the demand as well as the performance of the targeted VMs based on the Suffer age aggregation and performance feedback. Experiments on a real Xen based virtualization environment with 3 VMs are conducted and evaluated for accuracy, efficiency, sensitivity, and overhead. The results show that the performance feedback based allocation can achieve a higher SLA satisfaction rate as 97.5%, a lower load imbalance index as 17.6%. The results also show that this algorithm is valid, effective and scalable for implementation in real virtualized environments. © 2011 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

EAPAC: An enhanced application placement framework for data centers

EAPAC: An enhanced application placement framework for data ...

引用

14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011, the 11th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2011, and the 10th IEEE Int. Conf. on Ubiquitous computing and Communications, IUCC 2011

作者： Shi, Xuanhua Jiang, Hongbo He, Ligang Jin, Hai Wang, Chonggang Yu, Bo Wang, Fei Service Computing Technology and System Lab./Cluster and Grid Computing Lab. School of Computer Huazhong University of Science and Technology China Department of Electronics and Information Engineering Huazhong University of Science and Technology China Department of Computer Science University of Warwick United Kingdom InterDigital Communications Corp. United States

ISBN: (纸本)9780769544779

Emerging data centers may host a large number of applications that consume CPU power, memory, and I/O resources. Previous studies focus on the allocation of resources in order to perfectly satisfy the demands seen in the current cycle, and the existing application placement algorithms are all based on applications. The existing application placement algorithms in literature assume that the consumption of system resources is proportional to the level of workloads submitted to the system. In this paper, we revealed that it may not be the case in some circumstances. Based on this observation, we design and implement an application placement framework, called EAPAC, for data centers. The developed framework is able to judiciously allocate to application servers a proper mixture of different types of application requests as well as an appropriate number of requests in each type. Further, we investigate the issue of resource conflicts among different applications when there exist concurrent requests in the system. We have conducted extensive experiments to evaluate the performance of the developed framework. The experiment results show that compared with the existing studies, EAPAC can improve the performance by 30% in terms of the reply rate. Especially, when there are concurrent requests in the system, the performance can be improved by 100%. © 2011 IEEE.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

An adaptive management mechanism for resource scheduling in multiple virtual machine system

An adaptive management mechanism for resource scheduling in ...

引用

Lecture Notes in Computer Science

作者： Wan, Jian Yang, Laurence T. Li, Yunfa Xu, Xianghua Xiong, Naixue Grid and Service Computing Lab. School of Computer Science and Technology Hangzhou Dianzi University 310018 Hangzhou China Department of Computer Science St. Francis Xavier University Antigonish NS B2G 2W5 Canada Department of Computer Science IS and T on Virtual Computing Lab. Georgia State University GA 30303 United States

ISBN: (纸本)9783642234958

With the growth of hardware and software resources, the management of resource scheduling is becoming more and more difficult in multiple virtual machine system. It has become a very difficult problem that how to schedule the system resource and improve the service performance of resource. In order to solve this problem, we propose an adaptive management mechanism for resource scheduling. In the management mechanism, we first propose an adaptive management model for resource scheduling. Then, we present a genetic simulated annealing to resolve the management model. On the basis of the model and the algorithm, we design a management module. All these constitute an adaptive management mechanism for resource scheduling in multiple virtual machine system. In order to justify the feasibility and availability of the adaptive management mechanism for resource scheduling, a series of experiments have been done. The results show that it is feasible to adaptively manage and schedule the system resources and ensure the quality of service of resources in multiple virtual machine system. © 2011 Springer-Verlag.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Power aware job scheduling with QoS guarantees based on feedback control

Journal of Software

引用

Journal of Software 2011年第8期6卷 1562-1569页

作者： Jiang, Congfeng Xu, Xianghua Wan, Jian Zhang, Jilin Zhao, Yinghui Grid and Service Computing Technology Lab Hangzhou Dianzi University Hangzhou 310037 China Department of Hydraulic Engineering and Agriculture Zhejiang Tongji Vocational College of Science and Technology Hangzhou 311231 China

With the scale of computing system increases, system performance and reliability, described by various Quality of service(QoS) metrics, cannot be guaranteed if only the objective is to minimize the total power consumptions separately, despite of the violations of QoS. In this paper a feedback control based power aware job scheduling algorithm is proposed to minimize power consumption in computing system and to provide QoS guarantees. In the proposed algorithm, jobs are scheduled according to the real-time and historical power consumption as well as the QoS requirements. Simulations show that the proposed algorithm can reduce power consumptions significantly while still providing QoS guarantees and the performance degradation is acceptable. The results also show that fine-grained job-level power aware scheduling can achieve better power/performance balancing between multiple processors or cores than coarse-grained methods. And the results also suggest that conventional hardware based per-component and system-wide power management methods can save more power consumptions if they are in assistance with job-level adaptation. © 2011 ACADEMY PUBLISHER.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Hierarchically characterizing CUDA program behavior

Hierarchically characterizing CUDA program behavior

引用

IEEE International Workshop/Symposium on Workload Characterization

作者： Zhibin Yu Hai Jin Nilanjan Goswami Tao Li Lizy K. John Service Computing Technologies and System Lab/Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Intelligent Design of Efficient Architecture Lab University of Florida Gainesville FL USA Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

CUDA has become a very popular programming paradigm in parallel computing area. However, very little work has been done for characterizing CUDA kernels. In this work, we measure the thread level performance, collect the basic block level characteristics, and glean the instruction level properties for about 35 programs from CUDA SDK, Parboil, and Rodinia benchmark suites. In addition, we define basic block vectors, synchronization vectors and thread similarity matrix to capture the characteristics of CUDA programs efficiently. We find that CUDA programs have some unique characteristics at each level compared to sequential programs.

关键词： Graphics processing unit Vectors Kernel Instruction sets Programming USA Councils Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Power aware resource allocation in virtualized environments through VM behavior identification

Power aware resource allocation in virtualized environments ...

引用

2010 IEEE/ACM International Conference on Green computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social computing, CPSCom 2010

作者： Jiang, Congfeng Zhang, Jilin Wan, Jian Xu, Xianghua Yin, Yuyu Yu, Ritai Lv, Changping Grid and Service Computing Technology Lab. Hangzhou Dianzi University Hangzhou 310037 China

ISBN: (纸本)9780769543314

Virtualization technology enables server and service consolidation to save more power and operational costs of large scale computing systems. However, the consolidation nature of virtualization intensifies the power densities in a rack, thus resulting in higher probability of failures and service Level Agreements violations under constrained power budget. In this paper, we proposed a power aware resource allocation algorithm, named PaRA, to coordinate and tradeoff the power and performance. In order to provide enough information about power characteristics of individual VM and applications, we use agent for workload characterization and estimation. The real actuation of resource allocation is realized within the Virtual Machines Monitor (VMM). We evaluated our algorithm on a real Xen based virtualization environments with 3 VMs. The results show that the proposed approach can achieve a higher SLA satisfaction rate as 99.6% in RUBiS web application, and power consumption savings up to 17.6% compared to default Xen resource allocator. The results also show the potential of our algorithm to be used in real virtualization environments. © 2010 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：