Browse > Article

L-shaped Submesh Allocation Scheme for Mesh-Connected Multicomputers  

서경희 (성신여자대학교 컴퓨터정보학부)
김성천 (서강대학교 컴퓨터공학과)
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.
Keywords
mesh; fragmentation; system utilization;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A performance Comparison of Processor Allocation and Job Scheduling Algorithms for Mesh-Connected Multiprocessors /
[ D. Babbar;P. Krueger ] / Proc. IEEE Symposium on Parallel and Distributed Processing
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   DOI   ScienceOn
4 P. Mazumder, 'Evaluation of On Chip Static Interconnection Networks,' IEEE Trans. on Computers, Vol. C-36, No. 3, pp.365-369, Mar. 1987   DOI   ScienceOn
5 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   DOI
6 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   DOI
7 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   DOI
8 서경희, 김성천, '매쉬 시스템에서 형태 변형에 의한 유연성있는 프로세서 할당 기법,' 정보과학회논문지, 제24권, 제11호, pp. 1113-1123, 1997
9 Hwang, K. and Xu, Z., Scalable Parallel Computing: Technology, Architecture Programming, p.280, WCB/McGraw-Hil, 1998
10 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   DOI
11 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   DOI
12 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
13 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   DOI
14 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   DOI
15 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   DOI
16 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   DOI   ScienceOn
17 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   DOI   ScienceOn