Finding and finessing static islands in dynamically scheduled circuits
File(s)
Author(s)
Cheng, Jianyi
Wickerson, John
Constantinides, George
Type
Conference Paper
Abstract
In high-level synthesis, scheduling is the process that determines
the start time of each operation in hardware. A hardware design can
be scheduled either at compile time (static), run time (dynamic), or
both. Recent research has shown that combining dynamic and static
scheduling can achieve high performance and small area. However,
there is still a challenge to determine which part to schedule statically and which part dynamically. An inappropriate choice can
lead to suboptimal design quality. This paper proposes a heuristicdriven approach to automatically determine ‘static islands’ – i.e.,
code regions that are amenable for static scheduling. Over a set of
benchmarks where our approach is applicable, we show that our
tool can achieve on average a 3.8-fold reduction in area combined
with a 13% performance boost through automatic identification and
synthesis of static islands from fully dynamically scheduled circuits.
The performance of the resulting hardware is close to optimum
(as determined by an exhaustive enumeration of all possible static
islands).
the start time of each operation in hardware. A hardware design can
be scheduled either at compile time (static), run time (dynamic), or
both. Recent research has shown that combining dynamic and static
scheduling can achieve high performance and small area. However,
there is still a challenge to determine which part to schedule statically and which part dynamically. An inappropriate choice can
lead to suboptimal design quality. This paper proposes a heuristicdriven approach to automatically determine ‘static islands’ – i.e.,
code regions that are amenable for static scheduling. Over a set of
benchmarks where our approach is applicable, we show that our
tool can achieve on average a 3.8-fold reduction in area combined
with a 13% performance boost through automatic identification and
synthesis of static islands from fully dynamically scheduled circuits.
The performance of the resulting hardware is close to optimum
(as determined by an exhaustive enumeration of all possible static
islands).
Date Issued
2022-02-11
Date Acceptance
2021-11-22
Citation
2022, pp.89-100
Publisher
ACM
Start Page
89
End Page
100
Copyright Statement
© 2022 Association for Computing Machinery.
Sponsor
Engineering & Physical Science Research Council (EPSRC)
Identifier
https://dl.acm.org/doi/abs/10.1145/3490422.3502362
Grant Number
EP/P010040/1
Source
ACM International Symposium on Field-Programmable Gate Arrays (FPGA)
Publication Status
Published
Start Date
2022-03-27
Finish Date
2022-03-01
Coverage Spatial
Virtual Event , CA , USA
Date Publish Online
2022-02-11