skip to main content
10.1145/1167253.1167300acmconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
Article

Resource-constrained loop scheduling in high-level synthesis

Published: 18 March 2005 Publication History

Abstract

Today electronic design automation software plays an important role in modern VLSI design technology. High-Level Synthesis (HLS) translates the behavioral specification of a digital system to a register transfer level structure. In this research we will focus scheduling loop constructs under fixed hardware constraints. We proposed a new two-phase algorithm for loop scheduling based on the Force-Directed Scheduling (FDS) algorithm. The algorithm also employs a local priority function called the 'mobility' of an operation to select the best operation to be rescheduled when resource violation is detected. In the first phase of the algorithm, the FDS algorithm is used to generate an initial schedule of the system that balances the distribution of the operations and optimizes the system hardware utilization. The second phase of the algorithm iteratively modifies the initial FDS schedule in order to resolve any hardware constraint violations. The performance of the proposed algorithm was evaluated using the differential equation and elliptical wave filter HLS benchmarks. The algorithm was found to significantly reduce the execution time under relaxed hardware constraints and yield results similar to the traditional sequential scheduler under tight hardware constraints.

References

[1]
Abdel-Kader, R. and Chapman, R. Concurrent Scheduling of Multiple Loops Using the Force-Directed Scheduling Algorithm. In Proceedings of the 40'th ACM-SE Conference, Apr. 2002, 31--37.]]
[2]
Ashenden, P. J. The Designers Guide to VHDL. Morgan Kaufmann Publishers Inc., 1996.]]
[3]
Chapman, R. Verified High Level Synthesis. Ph.D. Dissertation, Cornell University, 1994.]]
[4]
Gong, C. and Lee, C. An Optimal Software Pipelining Scheduling Algorithm. In Proceedings of the 6'th ISCTA International. Conference on Parallel and Distributed Computing Systems, Oct. 1993, 153--156.]]
[5]
Koziris, N., Papakonstantinou. G. and Tsanakas, P. Optimal Time and Efficient Space Free Scheduling for Nested Loops. Computer Journal, 39(5), 1996, 439--448.]]
[6]
Manjikian, N. and Abdelrahman, T. S. Fusion of Loops for Parallelism and Locality. In Proceedings of the 24'th International Conference on Parallel Processing, 2, 1995, 19--25.]]
[7]
Megiddo, N. and Sarkar, V. Optimal Weighted Loop Fusion for Parallel Programs. In Proceedings of the 9'th Annual Symposium on Parallel Algorithms and Architectures, 1997, 282--289.]]
[8]
Ntlatlapa, N., and Chapman, R. GML-DFG: An Implementation of Dependence Flow Graphs in Graph Modeling Language. Technical Report, Auburn University, Auburn, AL, 1999.]]
[9]
Ohmori, K. High-Level Synthesis using a Genetic Algorithm. In Proceedings of the IEEE Conference on Evolutionary Computing, 1, (Nov. 1995), 209--213.]]
[10]
Papa, G., Silc, J. and Bratkovic, F. Scheduling Algorithms in High-Level Synthesis: Overview and Evaluation. Elektrotehniski Vestnik, 65(4), 1998, 153--165.]]
[11]
Paulin, P. G. and Knight, J. P. Algorithms for High-level Synthesis. IEEE Trans. Design and Test of Computers, 6(6), 1989, 18--31.]]
[12]
Paulin, P. G. and Knight, J. P. Force-Directed Scheduling for the Behavioral Synthesis of ASIC's IEEE Trans. Computer-Aided Design, 8, 661--679.]]
[13]
Paulin, P. G. and Knight, J. P. Force-Directed Scheduling in Automatic Data Path Synthesis. In Proceedings of the 24'th Design Automation Conference, 1987, 195--202.]]
[14]
Paulin, P. G., Knight, J. P. and Girczyc, E. F. HAL: A Multi-Paradigm Approach to Automatic Data Path Synthesis. In Proceedings of the 23'rd Design Automation Conference, Jul. 1986, 263--270.]]
[15]
Rahmouni, M. and Jerraya, A. Formulation and Evaluation of Scheduling Techniques for Control Flow Graphs. In Proceedings of the European Design Automation Conference, (Sep. 1995), 386--391.]]
[16]
Sait, S. M., Ali, S. and Benten, M. S. Scheduling and Allocation in High-Level Synthesis Using Stochastic Techniques. Microelectronics Journal, 27(8), 1996, 693--712.]]
[17]
Tongsima, S., Sha, E. H., Chantrapornchai, C. Surma, D. R. and Passos, N. L. Probabilistic Loop Scheduling for Applications with Uncertain Execution Time. IEEE Trans. on Computers, 49, 2000, 65--72.]]

Cited By

View all
  • (2019)Force-directed algorithms for schematic drawings and placement: A surveyInformation Visualization10.1177/147387161882174019:1(65-91)Online publication date: 3-Jan-2019

Index Terms

  1. Resource-constrained loop scheduling in high-level synthesis

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ACMSE '05 vol 2: Proceedings of the 43rd annual ACM Southeast Conference - Volume 2
    March 2005
    430 pages
    ISBN:1595930590
    DOI:10.1145/1167253
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 18 March 2005

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. force-directed scheduling
    2. high-level synthesis
    3. scheduling

    Qualifiers

    • Article

    Conference

    ACM SE05
    Sponsor:
    ACM SE05: ACM Southeast Regional Conference 2005
    March 18 - 20, 2005
    Georgia, Kennesaw

    Acceptance Rates

    Overall Acceptance Rate 502 of 1,023 submissions, 49%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)5
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 20 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Force-directed algorithms for schematic drawings and placement: A surveyInformation Visualization10.1177/147387161882174019:1(65-91)Online publication date: 3-Jan-2019

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media