Earticle

현재 위치 Home

NGSched - An Efficient Scheduling Algorithm Handling Interactive Jobs in Grid Environment

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJGDC) 바로가기
  • 간행물
    International Journal of Grid and Distributed Computing 바로가기
  • 통권
    vol.4 no.2 (2011.06)바로가기
  • 페이지
    pp.1-10
  • 저자
    Madhuri Bhavsar, S.N.Pradhan
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A147896

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
A Computational grid is highly useful computing infrastructure that enables effective access of resources to perform high performance computing wherein job management, efficient resource utilization are key grid service issues. To make grid environment greatly useful, an optimized scheduling system is essential as computational grid is often heterogeneous with complex environment. This complexity raises difficulties in gathering the load information of computational resources as well as coping up with user needs specifically when users dealt with jobs. Other existing fact of grid computing is that it is best known for handling batch job rather than interactive job submission. Interactive Job submission is useful in situations when a job requires human intervention to control the job result.
This research paper tries to satisfy the requirements of the user by developing user driven scheduler. We have developed a scheduler here after referred as NGSched compatible with Globus and hence provides user on-demand and interactive access to grid resources. It adopts novel approach for scheduling multiple jobs by giving privileges of resource selection to the user. The proposed and implemented algorithm also satisfies the deadlines given by the user for job execution on the selected resources and balances the load on grid nodes. The proposed heuristic also calculates the share of each resource according to capability to handle load. Since this scheduler is user centric, it facilitates the user to monitor the job, cancel the job, schedule on selected resources, suspend and resume the job. Results obtained proved that our innovative algorithm is better and efficient.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Preface of proposed research algorithm
 4. Proposed Scheduling Algorithm
 5. Implementation
  5.1. Fetching Data from MDS:
  5.2. Maintaining Input/Output Between Admin and Remote Node:
  5.3. Deployment of All Job-Modules over Remote Node:
  5.4. User centric Job management functionalities:
 6. Performance Analysis
  6.1. Comparing Wastage of CPU Cycles:
  6.2. Total Jobs Scheduled:
  6.3. Jobs Submitted with Given Deadline:
  6.4. Utilization of Grid:
  6.5. Number of Jobs Scheduled:
  6.6. Time Taken for Scheduling Decision:
 7. Conclusion and Future work:
 References

저자

  • Madhuri Bhavsar [ Department of Computer Science & Engineering, Nirma University ]
  • S.N.Pradhan [ Department of Computer Science & Engineering, Nirma University ]

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Grid and Distributed Computing
  • 간기
    격월간
  • pISSN
    2005-4262
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing vol.4 no.2

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장