The University of Southampton
University of Southampton Institutional Repository

Efficient scheduling of behavioral descriptions in high-level synthesis

Efficient scheduling of behavioral descriptions in high-level synthesis
Efficient scheduling of behavioral descriptions in high-level synthesis
A new heuristic scheduling algorithm for time constrained datpath synthesis is described. The algorithm is based on the distribution graph concept where a least mean square error function is used to schedule operations in sequence, resulting in a computationally efficient solution with the capability of including other high level synthesis features such as register cost without significant increase in execution time. This new proposed method contrasts with previously published algorithms where the influence of all operations on the schedule is first evaluated before the most appropriate operation is selected and scheduled. An important feature of the algorithm is its ability to solve different scheduling problems including conditional statements, multicycled functional units and structual pipelining. To illustrate the efficiency of the alogorithm a set of benchmark examples has been synthesised and compared. It has been shown that the new algorithm produces high quality solutions when compared to other heuristic algorithms. Furthermore, it is simple to implement and computationally efficient with execution times increasing approximately linearly with increasing time constraints allowing complex designs to be synthesised in an acceptable time scale. As an example, it takes <30s to obtain an optimal schedule for the DCT when the time constraint of a maximum 36 control steps is imposed.
IEE Proceedings on Computers and Digital Techniques
Kollig, P.
d7f7aada-a447-407b-857a-1fa6250083a4
al-hashimi, b.m.
0b29c671-a6d2-459c-af68-c4614dce3b5d
abbott, k.m.
ad87daf8-c497-45ba-ac1c-e51253c922ea
Kollig, P.
d7f7aada-a447-407b-857a-1fa6250083a4
al-hashimi, b.m.
0b29c671-a6d2-459c-af68-c4614dce3b5d
abbott, k.m.
ad87daf8-c497-45ba-ac1c-e51253c922ea

Kollig, P., al-hashimi, b.m. and abbott, k.m. (1997) Efficient scheduling of behavioral descriptions in high-level synthesis

Record type: Other

Abstract

A new heuristic scheduling algorithm for time constrained datpath synthesis is described. The algorithm is based on the distribution graph concept where a least mean square error function is used to schedule operations in sequence, resulting in a computationally efficient solution with the capability of including other high level synthesis features such as register cost without significant increase in execution time. This new proposed method contrasts with previously published algorithms where the influence of all operations on the schedule is first evaluated before the most appropriate operation is selected and scheduled. An important feature of the algorithm is its ability to solve different scheduling problems including conditional statements, multicycled functional units and structual pipelining. To illustrate the efficiency of the alogorithm a set of benchmark examples has been synthesised and compared. It has been shown that the new algorithm produces high quality solutions when compared to other heuristic algorithms. Furthermore, it is simple to implement and computationally efficient with execution times increasing approximately linearly with increasing time constraints allowing complex designs to be synthesised in an acceptable time scale. As an example, it takes <30s to obtain an optimal schedule for the DCT when the time constraint of a maximum 36 control steps is imposed.

Full text not available from this repository.

More information

Published date: March 1997
Additional Information: Address: UK
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 251375
URI: http://eprints.soton.ac.uk/id/eprint/251375
PURE UUID: 75c11050-45df-499f-b0fc-db2cf3d30699

Catalogue record

Date deposited: 28 Oct 1999
Last modified: 18 Jul 2017 10:10

Export record

Contributors

Author: P. Kollig
Author: b.m. al-hashimi
Author: k.m. abbott

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×