Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

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

L-shaped Submesh Allocation Scheme for Mesh-Connected Multicomputers

메쉬 멀티컴퓨터에서 L-모양 서브메쉬 할당기법

  • 서경희 (성신여자대학교 컴퓨터정보학부) ;
  • 김성천 (서강대학교 컴퓨터공학과)
  • Published : 2003.02.01
Download PDF
⟨ Previous Next ⟩

Abstract

Fragmentation is the main performance bottleneck of large, multi-user multicomputer system. This paper presents an L-Shaped Submesh Allocation(LSSA) strategy, which lifts the restriction on the rectangular shape formed by allocated processors in order to address the problem of fragmentation. LSSA can manipulate the shape of the required submesh to fit into the fragmented mesh system. Thus, LSSA accommodates incoming jobs faster than other strategies and results in the reduction of job response time. Extensive simulations show that LSSA performs more efficiently than other strategies in terms of the external fragmentation, the job response time and the system utilization.

프래그멘테이션은 다수의 사용자를 지원하는 대규모 멀티컴퓨터 시스템의 성능에 병목현상을 초래하는 주요 요인이다. 본 논문에서는 프래그멘테이션을 줄이기 위해서, 할당되는 프로세서들이 형성하는 모양이 직사각형이어야 한다는 제약조건을 완화시킨 LSSA(L-Shaped Submesh Allocation) 기법을 제안한다. LSSA 기법은 단편화된 메쉬 시스템에도 전용될 수 있도록 직사각형 뿐 만 아니라. 변형된 L자 모양의 서브메쉬를 할당할 수 있다. 그러므로 LSSA 기법은 시스템으로 들어오는 작업을 다른 기법들보다 빨리 수용할 수 있으며, 이로 인해 작업응답시간을 줄일 수 있다. 시뮬레이션 결과를 통해서 LSSA 기법이 외부 프래그멘테이션, 작업응답시간, 그리고 시스템의 활용도 면에서 다른 기법들보다 우수함을 보인다.

Keywords

References

  1. P. Mazumder, 'Evaluation of On Chip Static Interconnection Networks,' IEEE Trans. on Computers, Vol. C-36, No. 3, pp.365-369, Mar. 1987 https://doi.org/10.1109/TC.1987.1676910
  2. A. G. Ranade and S. L. Johnsson, 'The Communication Efficiency of Meshes, Boolean Cubes and Cube Connected Cycies for Water Scale Integration,' Proc. Int'l Conf. on Parallel Processing, pp.479-482, 1987
  3. B. S. Yoo and C. R. Das, 'A Fast and Efficient Processor Allocation Scheme for Mesh-Conneneted Multicomputers,' IEEE Trans. on Computers, Vol. 51, No. 1, pp. 46-60, Jan. 2002 https://doi.org/10.1109/12.980016
  4. 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
  5. 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
  6. J. Ding and L. N. Bhuyan, 'An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected systems,' Proc. Int'l Conf. on Parallel Processing, pp. II-193-II-200, 1993 https://doi.org/10.1109/ICPP.1993.39
  7. T. Liu et al., 'A Submesh Allocation Scheme for Mesh-Connected Multiprocessor Systems,' Proc. Int'l Conf. on Parallel Processing, pp. II-159-II-163, 1995
  8. 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
  9. 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
  10. V. Gupta and A. Jayendran, 'A Flexible Processor Allocation Strategy For Mesh Connected Parallel Systems,' Proc. Int'l Conf. on Parallel Processing, pp. III-166-III-173, 1996 https://doi.org/10.1109/ICPP.1996.538572
  11. W. Liu, V. Lo, K. Windisch and B. Nitzberg, 'Non-contiguous Processor Allocation Algorithms for Distributed Memory Multicomputers,' Proc. 1994 Int'l Conf. on Supercomputing, pp. 227-236, June 1994 https://doi.org/10.1109/SUPERC.1994.344282
  12. D. D. Sharma and D. K. Pradhan, 'Job Scheduling in Mesh Multicomputers,' Proc. Int'l Conf. on Parallel Processing, pp. II-251-II-258, 1994 https://doi.org/10.1109/ICPP.1994.119
  13. 서경희, 김성천, '매쉬 시스템에서 형태 변형에 의한 유연성있는 프로세서 할당 기법,' 정보과학회논문지, 제24권, 제11호, pp. 1113-1123, 1997
  14. J. W. Hong, K. Mechlhorn, and A. I. Rosenberg, 'Cost Trade-offs in Graph Embedding with Applications,' Journal of the ACM, Vol. 30, No. 4, pp. 709-728, October 1983 https://doi.org/10.1145/2157.322401
  15. Hwang, K. and Xu, Z., Scalable Parallel Computing: Technology, Architecture Programming, p.280, WCB/McGraw-Hil, 1998
  16. 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
  17. Proc. IEEE Symposium on Parallel and Distributed Processing A performance Comparison of Processor Allocation and Job Scheduling Algorithms for Mesh-Connected Multiprocessors D. Babbar;P. Krueger