Resource co-allocation : A complementary technique that enhances performance in grid computing environment

被引:0
|
作者
Azougagh, D [1 ]
Yu, JL [1 ]
Kim, JS [1 ]
Maeng, SR [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Div Comp Sci, Dept EECS, Taejon, South Korea
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper introduces an Availability Check technique (ACT) as a complementary technique to most resource co-allocation protocols in the literature. For a given resource co-allocation protocol, ACT tries to reduce the conflicts that happen between co-allocators when they try to allocate multiple resources simultaneously. In ACT each job checks for the availability state of required resources and gets informed with updates each time one of the resources availability state changes until all the resources become available. Once all required resources become available a job starts applying the given resource co-allocation protocol. Two co-allocation protocols: All-or-Nothing (AONP) and Order-based Deadlock Prevention (ODP2) Protocols are chosen to be the case studies to simulate the proposed technique (ACT). To simulate ACT each job is allowed to allocate from 1 to 5 different types of resources simultaneously using a uniform distribution. The results show that applying ACT to one of the two protocols outperform the original one. The resource utilization is improved by up to 34% and 41% for AONP and ODP2 respectively. The job response time is improved by up to 13% and 8% for AONP and ODP2, respectively. And the communication overhead is improved by up to 96% and 94%for AONP and ODp2, respectively. Also, applyingACTto AONP represents the most scalable andfully distributed scheme that outperforms original schemes (AONP and ODP2) and competes well with all other schemes presented in this paper.
引用
收藏
页码:36 / 42
页数:7
相关论文
共 50 条
  • [31] Resource co-allocation algorithms for job batch scheduling in dependable distributed computing
    Toporkov V.
    Yemelyanov D.
    Toporkova A.
    Bobchenkov A.
    Advances in Intelligent and Soft Computing, 2011, 97 : 243 - 256
  • [32] An Improved Protocol for Deadlock and Livelock Avoidance Resource Co-allocation in Network Computing
    Jie Cao
    Zhiang Wu
    World Wide Web, 2010, 13 : 373 - 388
  • [33] Enabling the co-allocation of Grid data transfers
    Vazhkudai, S
    FOURTH INTERNATIONAL WORKSHOP ON GRID COMPUTING, PROCEEDINGS, 2003, : 44 - 51
  • [34] Job co-allocation strategies for multiple high performance computing clusters
    Qin, Jinhui
    Bauer, Michael A.
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2009, 12 (03): : 323 - 340
  • [35] Job co-allocation strategies for multiple high performance computing clusters
    Jinhui Qin
    Michael A. Bauer
    Cluster Computing, 2009, 12 : 323 - 340
  • [36] Co-Allocation with Collective Requests in Grid Systems
    Cankar, Matija
    Artac, Matej
    Sterk, Marjan
    Lotric, Uros
    Slivnik, Bostjan
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2013, 19 (03) : 282 - 300
  • [37] A formal model of dynamic resource allocation in grid computing environment
    Ismail, Leila
    Mills, Bruce
    Hennebelle, Alain
    PROCEEDINGS OF NINTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING, 2008, : 685 - +
  • [38] Market-based grid resource co-allocation and reservation for applications with hard deadlines
    Vanmechelen, Kurt
    Depoorter, Wim
    Broeckhove, Jan
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2009, 21 (18): : 2270 - 2297
  • [39] RARS: a Resource-Aware Replica Selection and co-allocation scheme for mobile grid
    Chang, Yue-Shan
    Zou, Guo-Jie
    Chang, Ching-Lung
    INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2010, 6 (02) : 99 - 113
  • [40] Resource allocation in grid computing
    Koole, Ger
    Righter, Rhonda
    JOURNAL OF SCHEDULING, 2008, 11 (03) : 163 - 173