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

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

DOI QR Code

A Scheduling Approach using Gradual Mobility Reduction for Synthesizing Pipelined Datapaths

파이프라인 데이터패스 합성을 위한 점진적 배정가능범위 축소를 이용한 스케줄링 방법

  • Published : 2002.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents a scheduling approach for synthesizing pipelined datapaths under resource constraints. Our approach builds up a schedule based on gradual mobility reduction in contrast to other algorithms of previous researches, where an operation being scheduled is selected by using a priority function. The proposed method consists of a scheduling algorithm and a decision algorithm for detecting any violation against resource constraints. Our approach evaluates whether or not a scheduling solution can exist in case an operation temporarily is assigned to the earliest or latest control step among the assignable steps for the operation. If a solution cannot be found, it is impossible to assign the operation to that step due to a violation against resource constraints, and so we can eliminate that control step. This process is iterated until a reduction of mobility for all operations can not be obtained. Experiments on benchmarks show that this approach gains a considerable improvement over those by previous approaches.

본 논문은 자원제약 조건에서 파이프라인 데이터패스 합성을 위한 스케줄링 방법이며, 우선순위 함수를 사용하여 스케줄할 연산을 선택하는 방법들과는 달리 연산들의 배정가능범위를 점진적으로 축소하여 스케줄한다. 제안방법은 스케줄링 알고리즘과 자원제약 위반을 검출하는 판단알고리즘으로 구성되며, 연산의 배정 가능한 제어단계의 처음 또는 마지막 단계에 임시로 연산을 배정하여 스케줄링 해가 존재하는지를 평가한다. 만약 해를 발견할 수 없다면 이는 자원제약 위반에 의해 연산을 그 제어단계에 배정하는 것이 불가능함을 의미하기 때문에 그 제어단계를 제거하며, 모든 연산에 대하여 배정가능범위 축소가 없을 때까지 이 과정을 반복한다. 벤치마크에 대한 실험결과는 다른 방법들과 비교해서 개선된 스케줄링 결과를 보인다.

Keywords

References

  1. Y. C. Hsu and Y. L. Jeang, 'Pipeline Scheduling Techniques in High-Level Synthesis,' in Proc. Int. Conf. Computer-Aided Design, pp.396-403, 1993 https://doi.org/10.1109/ASIC.1993.410746
  2. G. D. Micheli, 'Synthesis and Optimization of Digital Circuits,' Mcgraw-Hill, 1994
  3. D. D. Gajski, N. Dutt, A. Wu, and S. Lin, 'High-Level Synthesis : Introduction to Chip and System Design,' Kluwer Academic Publishers, Boston, 1992
  4. J. Lee, Y. Hsu, and Y. Lin, 'A New Integer Linear Programming Formulation for the Scheduling Problem in Data-Path Synthesis,' in Proc. Int. Conf. Computer-Aided Design, pp.20-23, 1989 https://doi.org/10.1109/ICCAD.1989.76896
  5. N. Park, and A. C. Parker, 'Shewa : A software package for synthesis of pipelines from behavioral specification,' IEEE Trans. Computer-Aided Design, Vol.7, pp.356-370, March, 1988 https://doi.org/10.1109/43.3169
  6. P. G. Paulin and J. P. Knight, 'Force-directed scheduling for behavioral synthesis of ASI's,' IEEE Trans. Computer-Aided Design, Vol.8, pp.661-679, March, 1989 https://doi.org/10.1109/43.31522
  7. W. F. J. Verhaegh, P. E. R. Lippens, E. H. L. Aarts, J. H. M. Korst, A. van der Werf and J. L. van Merbergen, 'Efficiency Improvements for Force-Directed Scheduling,' Computer-Aided Design, pp.286-291, 1992 https://doi.org/10.1109/ICCAD.1992.279359
  8. Y. H. Choi, 'Synthesis of pipelined datapaths,' Proc.Int. Conf. Computer-Aided Design, , pp.36-40, Jan., 1992 https://doi.org/10.1016/0010-4485(92)90089-S
  9. C. T. Hwang, Y. C. Hsu and Y. L. Lin, 'Scheduling for functional Pipelining and Loop Winding,' in Proc.28th Design Automation Conf., pp.764-769, 1991 https://doi.org/10.1145/127601.127766
  10. C. T. Hwang, Y. C. Hsu and Y. L. Lin, 'PLS : A scheduler for pipeline synthesis,' IEEE Trans. on CAD/ICSA, Vol.12, No.9, pp.1279-1286, Sep., 1993 https://doi.org/10.1109/43.240075
  11. T. F. Lee, A. C. Wu, D. D. Gajski and Y. L. Lin, 'An effective methodology for functional pipelining,' in Proc. Int. Conf. Computer-Aided Design, pp.230-233, 1992 https://doi.org/10.1109/ICCAD.1992.279369
  12. K. S. Hwang, A. E. Casavant, C. T. Chang and A. d'Abreu Manuel, 'Scheduling and Hardware Sharing in Pipelined Data Path,' in Proc. Int. Conf. Computer-Aided Design, pp.24-27, 1989 https://doi.org/10.1109/ICCAD.1989.76897