Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/4717
Title: Automated exploration of datapath in high level synthesis using temperature dependent bacterial foraging optimization algorithm
Authors: Sengupta, Anirban
Keywords: Biochemistry;Escherichia coli;Genetic algorithms;Optimal systems;Adaptive mechanism;Bacterial Foraging Optimization Algorithm (BFOA);Bacterial foraging optimization algorithms;Chemotaxis algorithms;Design space exploration;Exploration process;Replication algorithm;Temperature dependent;High level synthesis
Issue Date: 2014
Publisher: Institute of Electrical and Electronics Engineers Inc.
Citation: Sengupta, A., & Bhadauria, S. (2014). Automated exploration of datapath in high level synthesis using temperature dependent bacterial foraging optimization algorithm. Paper presented at the Canadian Conference on Electrical and Computer Engineering, doi:10.1109/CCECE.2014.6900920
Abstract: This paper presents a novel methodology for automated exploration of datapath in high level synthesis using temperature dependent bacterial foraging optimization algorithm (BFOA) which has the ability to reach reach optimal solution in most cases. To the best of the authors' knowledge, this is the first work that proposes a direct mapping of BFO algorithm for design space exploration (DSE) problem in high level synthesis (HLS). The major contributions of the proposed methodology are as follows: a) Novel multi-dimensional bacterium encoding scheme to handle the DSE problem; b) Novel chemotaxis algorithm for imitating exploration drift during searching; c) A novel replication algorithm customized to the DSE problem; d) A novel elimination-dispersal (ED) algorithm to introduce diversity during exploration; e) A temperature dependent BFOA based exploration process to tradeoff between power-performance design metrics during HLS which mimics the actual Escherichia coli (E.coli) bacterium behaviour operating in its feasible temperature range; f) Adaptive mechanisms such as resource clamping and step size clamping to handle boundary outreach. Results indicated an average improvement in Quality of Result (QoR) of >27 % and reduction in runtime of > 44 % compared to recent genetic algorithm based approach which does not guarentee reaching optimal solution. © 2014 IEEE.
URI: https://doi.org/10.1109/CCECE.2014.6900920
https://dspace.iiti.ac.in/handle/123456789/4717
ISBN: 9781479930999
ISSN: 0840-7789
Type of Material: Conference Paper
Appears in Collections:Department of Computer Science and Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: