비동기식 선형 파이프라인의 성능 특성 및 이를 이용한 효율적 버퍼 할당 알고리즘

Asynchronous Linear-Pipeline Dynamics and Its Application to Efficient Buffer Allocation Algorithm

  • 이정근 (광주과학기술원 정보통신공학과) ;
  • 김의석 (광주과학기술원 초고속 광 네트워크 연구센터) ;
  • 이동익 (광주과학기술원 정보통신공학과)
  • 발행 : 2002.06.01

초록

This paper presents relationship between the dynamic behavior of an asynchronous linear pipeline (ALP) and the performance of the ALP as buffers are allocated. Then the relationship is used in order to characterize a local optimum situation on the buffer design space of the ALP. Using the characterization we propose an efficient algorithm optimizing buffer allocation on an ALP in order to achieve its average case performance. Without the loss of optimality, our algorithm works in linear time complexity so it achieves fast buffer-configuration optimization. This paper makes two contributions. First, it describes relationship between the performance characteristics of an ALP and a local optimum on the buffer design space of the ALP. Second, it devises a buffer allocation algorithm finding an optimum solution in linear time complexity.

키워드