The KIPS Transactions:PartA (정보처리학회논문지A)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Processor Allocation Scheme on the Mesh-connected System with Faults

오류가 있는 메쉬 시스템에서의 프로세서 할당 기법

  • 서경희 (성신여자대학교 컴퓨터정보학부)
  • Published : 2005.08.01
Download PDF
⟨ Previous Next ⟩

Abstract

Efficient utilization of processing resources in a large multicomputer system with the possibility of fault occurrence depends on the reliable processor management scheme. This paper presents a dynamic and reliable processor allocation strategy to increase the performance of mesh-connected parallel systems with faulty processors The basic idea is to reconfigure a faulty mesh system into a maximum convex system using the fault-free upper or lower boundary nodes to compensate for the non-boundary faulty nodes. To utilize the non-rectangular shaped system parts, our strategy tries to allocate L-shaped submeshes instead of signaling the allocation failure. Extensive simulations show that the strategy performs more efficiently than other strategies in terms of the job response time md the system utilization.

오류가 발생할 수 있는 대규모 멀티컴퓨터 시스템의 프로세싱 자원들을 효율적으로 사용하기 위해서는 신뢰도 높은 프로세서 할당 알고리즘이 요구된다. 본 논문에서는 오류가 있는 메쉬 시스템의 성능을 높일 수 있는 동적이면서 신뢰도 높은 프로세서 할당 기법을 제안한다. 비경계 오류 노드들을 보상할 수 있는 오류프리 상한 또는 하한 경계 노드들을 사용해서 오류가 있는 메쉬 시스템을 최대 볼록 시스템으로 재구성한다. 이 재구성된 비직사각형 메쉬 시스템을 효율적으로 활용하기 위해 기존의 사각형 서브메쉬를 할당 할 수 없을 때 L-모양 서브메쉬를 할당할 수 있다. 시뮬레이션 결과를 통해서 제안하는 기법이 작업응답시간과 시스템 활용도 면에서 다른 기법들보다 우수함을 보인다.

Keywords

References

  1. A. Alan, B. Pritsker, J.J. O'reilly, and D.K. LaVal, Simulation with Visual SLAM and AweSim, John Wiley & Sons, Inc., 1997
  2. D. Babbar and P. Krueger, 'A performance Comparison of Processor Allocation and Job Scheduling Algorithms for Mesh-Connected Multiprocessors,' Proc. IEEE Symposium on Parallel and Distributed Processing, pp.46-53, 1994. https://doi.org/10.1109/SPDP.1994.346182
  3. H. Chen and S. Hu, 'Submesh Determination in Faulty Tori and Meshes,' IEEE Trans. on Parallel and Distributed Systems, Vol.12, No.3, Mar., 2001 https://doi.org/10.1109/71.914767
  4. P. J. Chuang and N. F. Tzeng, 'An Efficient Submesh Allocation Strategy for Mesh Computer systems,' Proc. Int'l Conf. on Distributed Computing Systems, pp.256-263, 1991 https://doi.org/10.1109/ICDCS.1991.148674
  5. J. Ding and L. N. Bhuyan, 'An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected systems,' Proc Int'l Conf. on Parallel Processing, Vol.II, pp.193-200, 1993 https://doi.org/10.1109/ICPP.1993.39
  6. V. Gupta and A. Jayendran, 'A Flexible Processor Allocation Strategy For Mesh Connected Parallel Systems,' Proc. Int'l Conf. on Parallel Processing, Vol.Ill, pp.166-173, 1996 https://doi.org/10.1109/ICPP.1996.538572
  7. M. Kang, C. Yu, H. Y. Youn, B. Lee, and M. Kim, Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems, IEEE trans. on Computers, Vol.52, No.5, pp.645-657, May, 2003 https://doi.org/10.1109/TC.2003.1197130
  8. J. H. Kim and P. K. Rhee, 'The Rule-Based Approach to Reconfiguration of 2-D Processor arrays,' IEEE Trans. Computers, Vol.42, No.11, pp.1403-1408, Nov., 1993 https://doi.org/10.1109/12.247844
  9. K. Li and K. H. Cheng, 'A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System,' Proc. ACM Computer Science Conf., pp.22-28, 1990 https://doi.org/10.1145/100348.100352
  10. T. Liu et al., 'A Submesh Allocation Scheme for Mesh-Connected Multiprocessor Systems,' Proc. Int'l Conf on Parallel Processing, Vol.II, pp.159- 163, 1995.
  11. K.H. Seo and S.C. Kim, 'Improving system performance in contiguous processor allocation for mesh-connected parallel systems,' ELSEVIER Journal of Systems and Software, Vol. 67, Issue 1, pp.45-54, July, 2003 https://doi.org/10.1016/S0164-1212(02)00086-9
  12. D. D. Sharma and D. K. Pradhan, 'A Fast and Efficient Strategy for Submesh Allocation in Mesh-Connected Parallel Computers,' Proc. IEEE Symposium on Parallel and Distributed Processing, pp.682-689, Dec., 1993 https://doi.org/10.1109/SPDP.1993.395466
  13. D. D. Sharma and D. K. Pradhan, 'Job Scheduling in Mesh Multicomputers,' Proc. Int'l Conf. on Parallel Processing, Vol.II, pp.251- 258, 1994 https://doi.org/10.1109/ICPP.1994.119
  14. N. F. Tzeng and G. Lin, Maximum Reconfiguration of 2-D Mesh Systems with Faults, In Proc. Int'l Conf. on Parallel Processing, pp.I-77-I-84, 1996. https://doi.org/10.1109/ICPP.1996.537146
  15. B. S. Yoo and C. R. Das, 'A Fast and Efficient Processor Allocation Scheme for Mesh-Connencted Multicomputers,' IEEE Trans. on Computers, Vol.51, No.1, pp.46-60, Jan., 2002 https://doi.org/10.1109/12.980016
  16. Y. Zhu, 'Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers,' Journal of Parallel and Distributed Computing, Vol.16, No.12, pp.328- 337, Dec., 1992 https://doi.org/10.1016/0743-7315(92)90016-G