Efficient Scheduling for Design Exploration with Imprecise Latency and Register Constraints

In archiectural synthesis, scheduling and resource allocation are important steps. During the early stage of the design, imprecise information is unavoidable. Under the imprecise system characteristics and constraints, this paper proposes a polynomial-time scheduling algorithm which minimizes both functional units and registers while scheduling. The algorithm can be used in design exploration for exploring the tradeoff between latency and register counts and selecting a solution with satisfactory performance and cost. The experiments show that we can achieve a schedule with the same acceptable degree while saving register upto 37% compared to the traditional algorithm.

• Type: Conference
• Year: 2004
• Where: EUC
• Authors: Chantana Chantrapornchai, Wanlop Surakumpolthorn, Edwin Hsing-Mean Sha
• Keywords: Applied Computing, EUC 2004, Important Steps, Imprecise Information, Polynomial-time Scheduling Algorithm