Earticle

초록

영어

The resources in a grid are distributed in multiple autonomic domains. Hence, it’s always a time consuming process to perform the resource co-allocation in grids especially for parallel jobs due to the diversity of local domain policies and the dynamic resource workloads. Even worse, the resource competing among multiple parallel jobs may result in resource allocation deadlock. In this paper, a novel synchronized resource co-allocation model for cross-domain parallel jobs, called virtual job model (VJM), is proposed. VJM uses virtual jobs to co-reserve the earliest available resources for real parallel jobs with considering the local resource policies and the current resource availability in multiple domains. The co-reservation algorithm implemented in VJM is not only able to detect potential deadlocks, but able to relieve the resource competing via the resource reorganization mechanism. At last, we demonstrate that VJM is able to reduce the time cost of resource co-allocation significantly via experiments.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Virtual Job Model
  3.1. The VJM Architecture
  3.2. The Resource Selection Algorithm
  3.3. Deadlock Detection and Resource Reorganization
 4. Application and Performance Evaluation
  4.1. Overheads of VJM
  4.2. The co-allocation of VJM
 5. Conclusion and the Future work
 References

저자

• Xiaohui WEI [ College of Computer Science and Technology, Jilin University, ChangChun, P.R.C. ]
• Zhaohui DING [ College of Computer Science and Technology, Jilin University, ChangChun, P.R.C. ]
• Shaocheng XING [ College of Computer Science and Technology, Jilin University, ChangChun, P.R.C. ]
• Yaoguang YUAN [ College of Computer Science and Technology, Jilin University, ChangChun, P.R.C. ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605