A Scheduling Algorithm Using the Interval Graph

구간 그래프를 이용한 스케쥴링 알고리듬

  • 김기현 (한양대학교 CAD 및 통신 회로 연구실) ;
  • 정정화 (한양대학교 CAD 및 통신 회로 연구실)
  • Published : 1994.01.01

Abstract

In this paper, we present a novel scheduling algorithm using the weighted interval graph. An interval graph is constructed, where an interval is a time frame of each operation. And for each operation type, we look for the maximum clique of the interval graph: the number of nodes of the maximum clique represents the number of operation that are executed concurrently. In order to minimize resource cost. we select the operation type to reduce the number of nodes of a maximum clique. For the selected operation type, an operation selected by selection rule is moved to decrease the number of nodes of a maximum clique. A selected operation among unscheduled operations is moved repeatly and assigned to a control step consequently. The proposed algorithm is applied to the pipeline and the nonpipeline data path synthesis. The experiment for examples shows the efficiency of the proposed scheduling algorithm.

Keywords