首页> 外文期刊>Cluster computing >A Synchronous Co-Allocation Mechanism for Grid Computing Systems
【24h】

A Synchronous Co-Allocation Mechanism for Grid Computing Systems

机译:网格计算系统的同步协同分配机制

获取原文
获取原文并翻译 | 示例
       

摘要

Grid computing systems are emerging as a computing infrastructure that will enable the use of wide-area network computing systems for a variety of challenging applications. One of these is the ever increasing demand for multimedia from users engaging in a wide range of activities such as scientific research, education, commerce, and entertainment. To provide an adequate level of service to multimedia applications, it is often necessary to simultaneously allocate resources including predetermined capacities from interconnecting networks to the applications. The simultaneous allocation of resources is often referred to as co-allocation in the Grid literature. In this paper, we formally define the co-allocation problem and propose a novel scheme called synchronous queuing (SQ) for implementing co-allocation with quality of service (QoS) assurances in Grids. Unlike existing approaches, SQ does not require advance reservation capabilities at the resources. This enables an SQ-based approach to over subscribe the resources and hence improve resource utilization. The simulation studies performed to evaluate SQ indicate that it outperforms an QoS-based scheme with strict admission control by a significant margin.
机译:网格计算系统正在成为一种计算基础结构,它将使广域网计算系统能够用于各种具有挑战性的应用程序。其中之一是,从事科学研究,教育,商务和娱乐等广泛活动的用户对多媒体的需求不断增长。为了向多媒体应用提供足够水平的服务,通常需要从互连网络到应用同时分配包括预定容量的资源。在网格文献中,资源的同时分配通常被称为共同分配。在本文中,我们正式定义了协同分配问题,并提出了一种称为同步排队(SQ)的新方案,用于在网格中实现具有服务质量(QoS)保证的协同分配。与现有方法不同,SQ不需要在资源上预先保留功能。这使得基于SQ的方法可以过度订阅资源,从而提高资源利用率。评估SQ的仿真研究表明,它在严格的准入控制方面明显优于基于QoS的方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号