Toggle Main Menu Toggle Search

Open Access padlockePrints

Scheduling and allocation using closeness tables

Lookup NU author(s): Dr Frank Burns, Dr Delong Shang, Dr Albert Koelmans, Professor Alex Yakovlev


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


A heuristic approach towards the scheduling, binding and allocation problem for the high-level synthesis of data-paths is presented. The approach makes use of closeness tables to group operations with similar closeness properties, based on their inputs and outputs, into clusters. A tight packing scheduling and binding algorithm is then used to schedule and bind operations from individual clusters to individual functional units. A low interconnect solution is subsequently generated as a result of binding similar groups of operations with common sources and sinks to the same functional units. The approach simultaneously generates efficient schedules. It is shown that this is achieved in fast execution time and that the problem can be solved in reasonably low time complexity. Comparisons are made against other nonpipelined and pipelined approaches. © IEE, 2004.

Publication metadata

Author(s): Burns F, Shang D, Koelmans A, Yakovlev A

Publication type: Article

Publication status: Published

Journal: IEE Proceedings - Computers and Digital Techniques

Year: 2004

Volume: 151

Issue: 5

Pages: 332-340

Print publication date: 01/09/2004

ISSN (print): 1350-2387

ISSN (electronic):

Publisher: The Institution of Engineering and Technology


DOI: 10.1049/ip-cdt:20041045


Altmetrics provided by Altmetric