UCL Discovery Stage
UCL home » Library Services » Electronic resources » UCL Discovery Stage

Balancing Static Islands in Dynamically Scheduled Circuits using Continuous Petri Nets

Cheng, J; Fraca, E; Wickerson, J; Constantinides, GA; (2023) Balancing Static Islands in Dynamically Scheduled Circuits using Continuous Petri Nets. IEEE Transactions on Computers pp. 1-14. 10.1109/TC.2023.3292590. (In press). Green open access

[thumbnail of ChengFracaWickersonConstantinidesTC23.pdf]
Preview
PDF
ChengFracaWickersonConstantinidesTC23.pdf - Accepted Version

Download (1MB) | Preview

Abstract

High-level synthesis (HLS) tools automatically transform a high-level program, for example in C/C&#x002B;&#x002B;, into a low-level hardware description. A key challenge in HLS is scheduling, i.e. determining the start time of all the operations in the untimed program. A major shortcoming of existing approaches to scheduling &#x2013; whether they are static (start times determined at compile-time), dynamic (start times determined at run-time), or a hybrid of both &#x2013; is that the static analysis cannot efficiently explore the run-time hardware behaviours. Existing approaches either assume the timing behaviour in extreme cases, which can cause sub-optimal performance or larger area, or use simulation-based approaches, which take a long time to explore enough program traces.</p> <p>In this article, we propose an efficient approach using probabilistic analysis for HLS tools to efficiently explore the timing behaviour of scheduled hardware. We capture the performance of the hardware using Timed Continous Petri nets with immediate transitions, allowing us to leverage efficient Petri net analysis tools for making HLS decisions.</p> <p>We demonstrate the utility of our approach by using it to automatically estimate the hardware throughput for balancing the throughput for statically scheduled components (also known as static islands) computing in a dynamically scheduled circuit. Over a set of benchmarks, we show that our approach on average incurs a 2&#x0025; overhead in area-delay product compared to optimal designs by exhaustive search.

Type: Article
Title: Balancing Static Islands in Dynamically Scheduled Circuits using Continuous Petri Nets
Open access status: An open access version is available from UCL Discovery
DOI: 10.1109/TC.2023.3292590
Publisher version: https://doi.org/10.1109/TC.2023.3292590
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions.
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: https://discovery-pp.ucl.ac.uk/id/eprint/10174135
Downloads since deposit
630Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item