실시간 시스템에서의 동적 스토리지 할당을 위한 빠른 수정 이진 버디 기법

Quick Semi-Buddy Scheme for Dynamic Storage Allocation in Real-Time Systems

  • 이영재 (성균관대학교 정보통신공학부) ;
  • 추현승 (성균관대학교 정보통신공학부) ;
  • 윤희용 (성균관대학교 정보통신공학부)
  • 발행 : 2002.09.01

초록

Dynamic storage allocation (DSA) is a field fairly well studied for a long time as a basic problem of system software area. Due to memory fragmentation problem of DSA and its unpredictable worst case execution time, real-time system designers have believed that DSA may not be promising for real-time application service. Recently, the need for an efficient DSA algorithm is widely discussed and the algorithm is considered to be very important in the real-time system. This paper proposes an efficient DSA algorithm called QSB (quick semi-buddy) which is designed to be suitable for real-time environment. QSB scheme effectively maintains free lists based on quick-fit approach to quickly accommodate small and frequent memory requests, and the other free lists devised with adaptation upon a typical binary buddy mechanism for bigger requests in harmony for the .improved performance. Comprehensive simulation results show that the proposed scheme outperforms QHF which is known to be effective in terms of memory fragmentation up to about 16%. Furthermore, the memory allocation failure ratio is significantly decreased and the worst case execution time is predictable.

키워드

참고문헌

  1. Proc. of Real-Time Technology and Application Symposium The real-time behavior of dynamic memory management in $C^{++}$ Kelvin D. Nilsen;Hong Gao
  2. IEEE Software v.5 no.Issue 5 Concurrent algorithms for real-time memory management Ray Ford
  3. International Workshop on Memory Management Dynamic storage allocation : a survey and critical review Paul R. Wilson;Mark S. Johnstone;Michael Neely;David Boles
  4. Frontiers `96 - The 6th Symposium on Frontiers of Massively Parallel Computing Scalability of dynamic storage allocation algorithms A.K. Iyengar
  5. Computers and Digital Techniques, IEE Proceedings- v.148 no.Issue: 4-5 Performance analyses on the generalised buddy system C.-T.D.Lo;W. Srisa an;J.M. Chang
  6. Proc. of Intn. Symposium on Memory Management The memory fragmentation problem : solved? Mark S. Johnstone;Paul R. Wilson
  7. Communications of the ACM v.20 no.6 Buddy systems J.L. Peterson;T.A. Norman
  8. 한국정보처리학회논문지 v.7 no.7 예측 가능한 실행 시간을 가진 동적 메모리 할당 알고리즘 정성무;유해영;심재홍;김하진;최경희;정기형
  9. Proc. of 2nd Intn. Workshop on Real -Time Computing Systems and Applications An algorithm with constant execution time for dynamic storage allocation Takeshi Ogasawara