한국정보과학회논문지:컴퓨팅의 실제 및 레터 (Journal of KIISE:Computing Practices and Letters)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

Cactus와 Globus에 기반한 그리드 컴퓨팅 환경에서의 응용프로그램 수준의 체크포인팅을 사용한 동적 재구성 기법

A Dynamic Reconfiguration Method using Application-level Checkpointing in a Grid Computing Environment with Cactus and Globus

  • 김영균 (금오공과대학교 전자공학과) ;
  • 오길호 (금오공과대학교 컴퓨터공학부) ;
  • 조금원 (한국과학기술정보연구원 슈퍼컴퓨팅응용실) ;
  • 나정수 (한국과학기술정보연구원 슈퍼컴퓨팅응용실)
  • 발행 : 2005.12.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 Cactus와 Globus 기반의 그리드 컴퓨팅 환경에서 응용프로그램 수준의 체크 포인팅을 사용한 동적 재구성(Dynamic Reconfiguration) 기법을 새로이 제안하였다. 기존의 동적 재구성은 특정 하드웨어와 운영체제에 종속적이었으나 제안한 방법은 특정 하드웨어와 운영체제의 지원 없이 동적재구성이 가능하고 응용프로그램도 동적 재구성을 고려할 필요 없이 프로그래밍이 가능하다. 제안한 동적 재구성 기법에서 초기 연산자원의 구성을 갖고 실행되는 작업은 실행 중에 동적으로 발견된 새로운 연산자원을 포함하여 계속 연산을 수행한다. 본 연구에서 제안된 방법은 새롭게 발견된 연산자원의 프로세서 성능과 유휴 메모리를 고려하여, 해당 연산자원을 수행중인 연산에 포함할 것인가 여부를 결정한다 연산중 연산 결과의 실시간 가시화를 가능하도록 하고 운영체제에 종속적이지 않은 응용프로그램 수준의 체크 포인팅 기법을 사용하여 중간 연산결과를 저장한다. 새롭게 발견된 유휴사이트, 유휴프로세서를 포함하도록 연산자원의 구성을 재구성한 후 체크 포인팅 파일을 사용하여 작업을 계속 실행한다. 제안한 동적 재구성 기법은 K*Grid 환경에서 연산시간을 단축함을 확인하였다.

In this paper, we propose a new dynamic reconfiguration method using application-level checkpointing in a grid computing environment with Cactus and Globus. The existing dynamic reconfiguration methods have been dependent on a specific hardware and operating system. But the proposed method performs a dynamic reconfiguration without supporting specific hardwares and operating systems and, an application is programmed without considering a dynamic reconfiguration. In the proposed method, the job starts with an initial configuration of Computing resources and the job restarts including new resources dynamically found at run-time. The proposed method determines whether to include the newly found idle sites by considering processor performance and available memory of the sites. Our method writes the intermediate results of the job on the disks using system-independent application-level checkpointing for real-time visualization during the job runs. After reconfiguring idle sites and idle processors newly found, the job resumes using checkpointing files. The proposed dynamic reconfiguration method is proved to be valid by decreasing total execution time In K*Grid.

키워드

참고문헌

  1. Luis Fabricio Wanderley Goes, Carlos Augusto Paiva da Silva Martins, 'Reconfigurable Gang Scheduling Algorithm,' 10th workshop on Job Scheduling Strategies for parallel processing in conjunction with SIGMETRICS 2004, Columbia university, NewYork, NY June 13, 2004
  2. J. E. Moreira, V. K. Naik, 'Dynamic resource management on distributed systems using reconfigurable applications,' IBM J. RES. DEVELOP. VOL. 41 NO. 3 MAY 1997
  3. Nicholas T. Karonis, Brian Toonen, Ian Foster, 'MPICH-G2: A Grid-Enabled Implementations of the Message Passing Interface,' In Proceedings of ASCMAEEE SC'98 Conference, ACM press, 1998
  4. Garbrielle Allen, Werner Benger, Thomas Dramlitsch, Tom Goodale, Hans-Christian Hege, Gerd Lanfermann, Andre Merzky, Thomas Radke, Edward Seidel, John Shalf, 'Cactus Tools for Grid Applications,' Cluster Computing, Vol.4(3), pp. 179-188, 2001 https://doi.org/10.1023/A:1011491422534
  5. Jonathan Rose, Abbas El Gamal, and Alberto Sangiovanni-Vincentelli, 'Architecture of Field-Programmable Gate Arrays,' Proc. of the IEEE, Vol. 81, No.7, pp. 10l3-1029, July 1993 https://doi.org/10.1109/5.231340
  6. Kiran Bondalapati, Viktor K. Prasanna, 'Reconfigurable Computing Systems,' Proceedings of the IEEE, 90(7):1201-17, July 2002 https://doi.org/10.1109/JPROC.2002.801446
  7. Kiran Bondalapati and Viktor K. Prasanna, 'Reconfigurable Computing: Architectures, Models and Algorithms,' CURRENT SCIENCE: Special Section on Computational Science, Vol. 78, no. 7, pp. 828-837, April. 2000
  8. K. Whisnant, Z. T. Kalbarczyk, R. K. Iyer, 'A system model for dynamically reconfigurable software,' IBM SYSTEMS JOURNAL, VOL 42, NO 1, 2003 https://doi.org/10.1147/sj.421.0045
  9. Compton, K., Hauck, S. 'Reconfigurable Computing : A survey of Systems and Software,' ACM Computing Survey.(2002)
  10. Dehon, A. 'The Density Advantage of Configurable Computing,' IEEE Computer, Vol. 33, No.4.(2000) https://doi.org/10.1109/2.839320
  11. Goes, L. F. W., Martins, C. A. P. S. RJSSim, 'A Reconfigurable Job Scheduling Simulator for Parallel Processing Learning,' 33rd ASEE/TEEE Frontiers in Education Conference. Colorado(2003) https://doi.org/10.1109/FIE.2003.1264731
  12. J. Jann, L. M. Browning, R. S. Burugula, 'Dynamic reconfiguration: Basic building blocks for autonomic computing on IBM pSeries servers,' IBM SYSTEMS JOURNAL, VOL 42. NO 1, 2003 https://doi.org/10.1147/sj.421.0029
  13. Sriram Krishnan, Dennis Gannon, 'Checkpoint and Restart for Distributed Components in XCAT3,' In Proceedings of the fifth IEEE/ACM International Workshop on Grid Computing, pp. 281-288, Pittsburgh, Pennsylvania, 8 November, 2004 https://doi.org/10.1109/GRID.2004.15
  14. Garbrielle Allen, David Angulo, Ian Foster, Gerd Lanfermann, Chuang Liu, Thomas Radke, Ed Seidel, John Shalf, 'The Cactus Worm: Experiments with Dynamic Resource Discovery and Allocation in a Grid Envrionment,' The International Journal of High-Performance Computing Applications and Supercomputing 15(4), Winter, 2001 https://doi.org/10.1177/109434200101500402
  15. Sathish S. Vadhiyar and Jack J. Dongarra, 'Self Adaptivity in Grid Computing,' Concurrency and Computation: PRACTICE AND EXPERIENCE 2004; 001-26 https://doi.org/10.1002/cpe.v17:2/4
  16. Carsten Ernemann, Volker Hamscher, Achim Streit, Ramin Yahyapour, 'Enhanced Algorithms for Multi-Site Scheduling,' In 3rd Int'l Workshop on Grid Computing, pp. 219-231, 2002
  17. Chuang Liu, Lingyun Yang, Ian Foster, Dave Angulo, 'Design and Evaluation of a Resource Selection Framework for Grid Applications,' In Proceedings of the 11th IEEE Symposium oh High-Performance Distributed Computing, 2002
  18. Karl Czajkowski, Ian Foster, Carl Kesselman, Stuart Martin, Warren Smith, Steven Tuecke, 'A Resource Management Architecture for Metacomputing Systems,' Proc. 4th Workshop on Job Scheduling Strategies for Parallel Processing, pp. 62-82, Springer-Velag, 1998 https://doi.org/10.1007/BFb0053981