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

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

DOI QR Code

Minimizing Fragmentation in Contiguous Submesh Allocation Scheme

연속적인 서브메쉬 할당기법에서 단편화를 최소화하는 기법

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

Abstract

This paper presents an adaptive processor allocation strategy to reduce fragmentation in a large multi-user multicomputer system. A small number of jobs with unexpectedly large submesh allocation requirements may significantly increase the queuing delay of the rest of jobs. Under such circumstances, our strategy further tries to allocate L-shaped submeshes instead of signaling the allocation failure unlike other strategies. We have developed the efficient algorithm to find the allocatable L-shaped submeshes. Thus, our strategy reduces the mean response time by minimizing the queuing delay, even though jobs are scheduled in an FCFS to preserve fairness. The simulations show that our strategy performs more efficiently than other strategies in terms of the job response time and the system utilization.

대규모 멀티컴퓨터 시스템에서 단편화를 줄일 수 있는 적응성 있는 프로세서 할당 기법을 제안한다. 큰 크기의 서브메쉬 할당을 요구하는 작업들의 개수가 적을 경우에도 나머지 작업들의 대기 큐의 지연시간이 증가할 수 있다. 이런 상황에서 할당이 불가능한 기존의 기법들과 달리, L-모양 서브메쉬를 할당할 수 있으며, 할당 가능한 L-모양 서브메쉬를 효율적으로 탐색하는 알고리즘을 개발하였다. 그러므로 FCFS로 스케쥴링되어도, 대기 큐의 지연시간을 줄임으로써 평균응답시간을 줄일 수 있다. 시뮬레이션 결과를 통해서 제안하는 기법이 외부 단편화, 작업응답시간, 그리고 시스템의 활용도 면에서 다른 기법들보다 우수함을 보인다.

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. C. Chang and Prasant Mohapatra, An Integrated Processor Management Scheme for the Mesh-Connected Multi-computer Systems, In Proc. Int'l Conf. on Parallel Processing, pp.118-121, 1997
  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. III, pp.166-173, 1996
  7. K. Hwang and Z. Xu, Scalable Parallel Computing: Technology, Architecture, Programming, p.280, WCB/McGraw-Hill, 1998
  8. J. W. Hong, K Mehlhorn, and A. L. Rosenberg, 'Cost Trade-offs in Graph Embeddings, with Applications,' Journal of the ACM, Vol. 30, No. 4, pp, 709-728, October 1983 https://doi.org/10.1145/2157.322401
  9. 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
  10. 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
  11. 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
  12. 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
  13. 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
  14. 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
  15. 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
  16. X. Shen and Q. Hu, On Embedding Between 2D Meshes of the Same Size, IEEE Trans. on Computers, Vol. 46, No.8, pp.880-889, Aug. 1997 https://doi.org/10.1109/12.609277
  17. K. Windisch, V. Lo, and B. Bose, Contiguous and Non-Contiguous Processor Allocation Algorithms For K-ary and N-cubes, In Proc. Int'l Conf. on Parallel Processing, vol. II, pp.164-168, 1995
  18. 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
  19. 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