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

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

DOI QR Code

A Submesh Allocation Scheme Based on Classification of Tasks and Submeshes

태스크와 서브메쉬의 유형별 분류에 기반한 서브메쉬 할당방법

  • Lee, Won-Joo (The Department for Internet Programming, Doowon Technical College) ;
  • Jeon, Chang-Ho (The School of Electrical and Computer Engineering, Hanyang University)
  • Published : 2003.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents a new submesh allocation scheme for mesh-connected multicomputer systems. The key idea in the proposed allocation scheme is to reduce the submesh search time using classified free submesh lists (CFSL). This scheme reduces the submesh search time by classifying independent free submeshes according to their types (square, horizontal rectangle, vertical rectangle) and searching the best-fit submesh from the classified free submesh list. When no suitable submesh is found, the search can be continued by using the expansion index (El), which is stored as an attribute of each submesh, is used to form a larger submesh. Through simulation, we show that the proposed strategy improves the performance compared to previous strategies with respect to submesh search time.

본 논문에서는 메쉬 구조 다중컴퓨터 시스템을 위한 새로운 서브메쉬 할당방법을 제안한다. 이 할당방법의 특징은 유형별 가용 서브메쉬 리스트를 사용하여 가용 서브메쉬의 탐색시간을 줄이는 것이다. 이 할당방법은 메쉬 구조에서 탐색한 독립 가용 서브메쉬들을 유형(정방형, 가로 직사각형, 세로 직사각형)에 따라 분류하여 유형별 가용 서브메쉬 리스트를 생성한다. 그리고 태스크의 유형과 동일한 유형별 가용 서브메쉬 리스트에서 먼저 최적의 서브메쉬를 찾음으로써 서브메쉬의 탐색시간을 줄인다. 만약 가용 서브메쉬를 찾지 못할 경우에는 각 독립 가용 서브메쉬의 속성으로 저장된 확장지수를 사용하여 서브메쉬의 크기를 확장한 후 최적의 가용 서브메쉬를 찾는다. 시뮬레이션을 통하여 본 논문에서 제안하는 서브메쉬 할당방법이 서브메쉬 탐색시간을 줄이는 면에서 기존의 할당방법에 비해 우수함을 보인다.

Keywords

References

  1. Intel Corp., A Touchstone DELTA System Description, 1991
  2. Intel Corp., Paragon XP/X Product Overview, 1991
  3. R. Alverson et al., 'The Tera Computer System,' Proc. 1990 int'l Conf. Supercomputing, pp.1-6, Nov., 1990 https://doi.org/10.1145/77726.255132
  4. D. K. Kahaner and U. Wattenberg, 'Japan : A Aompetitive Assessment,' IEEE Spectrum, Vol.29, No.9, pp.42-47, Sep., 1992 https://doi.org/10.1109/6.155708
  5. G. Zorpette, 'The Power of Parallelism,' IEEE Spectrum, Vol.29, No.9, pp.28-33, Sep., 1992 https://doi.org/10.1109/6.155705
  6. T. E. Bell, 'Beyond Today's Supercomputers,' IEEE Spectrum, Vol.29, No.9, pp.72-75, Sep., 1992 https://doi.org/10.1109/6.155714
  7. K. Li and K.H. Cheng, 'A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected system,' IEEE Journal of Parallel and Distributed Computing, Vol.12, pp.79-83, May, 1991 https://doi.org/10.1016/0743-7315(91)90032-5
  8. P. J. Chuang and N. F. Tzeng, 'An Efficient Submesh Allocation Strategy for Mesh Computer Systems,' Proc. Int'l Conf. Distributed Computing Systems, pp.256-263, Aug., 1991 https://doi.org/10.1109/ICDCS.1991.148674
  9. J. Ding and l. N. Bhuyan, 'An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems,' Proc. Int'l Conf. Parallel Processing, pp.II-193-200, Aug., 1993 https://doi.org/10.1109/ICPP.1993.39
  10. Y. Zhu, 'Efficient Processor Allocation Strategies for Mesh Connected Parallel Computers,' IEEE Journal of Prallel and Distributed Computing, Vol.16, pp.328-337, Dec., 1992 https://doi.org/10.1016/0743-7315(92)90016-G
  11. D. D. Shrama and D. K. Pradhan, 'A Fast and Efficient Strategy for Submesh Allocation in Mesh-Connected Parallel Computers,' IEEE Symp. Parallel and Distributed Processing, pp.682-689, Dec., 1993 https://doi.org/10.1109/SPDP.1993.395466
  12. S. Bhattacharya and W. T. Tsai, 'Lookahead Processor Allocation in Mesh-Connected Massively Parallel Multi-computer,' proc. Int'l Parallel Processing Symp., pp.868-875, Apr., 1994 https://doi.org/10.1109/IPPS.1994.288204
  13. T. Liu, W. K. Huang, F. Lombardi and L. N. Bhuyan, 'A Submesh Allocation Scheme for Mesh-Connected Multi-processor Systems,' proc. Int'l Parallel Processing, pp.II-159-II-163, Aug., 1995
  14. S. M. Yoo, H. Y. Youn and B. Shirazi, 'An Efficient Task Allocation Scheme for 2D Mesh Architecture,' IEEE Trans. on Parallel and Distributed Systems, Vol.8, No.9, pp.934-942, Sep., 1997 https://doi.org/10.1109/71.615439
  15. G. M. Kim and H. S. Yoon, 'On Submesh Allocation for Mesh Multicomputers : A Best-Fit Allocation and a Virtual Submesh Allocation for Faulty Meshes,' IEEE Trans. on Parallel and Distributed Systems, Vol.9, No.2, pp.175-185, Feb., 1998 https://doi.org/10.1109/71.663881
  16. S. M. Ross, Introduction to Probability Models, sixth edition, Academic Press, 1985
  17. P. Krueger, T. H. Lai and V. A. Radiya, 'Processor Allocation vs. Job Scheduling on Hypercube Computers,' Proc. 11th Int'l Conf. Distributed Computing Systems, pp.394-401, Aug., 1991 https://doi.org/10.1109/ICDCS.1991.148700