IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v269y2015icp265-278.html
   My bibliography  Save this article

Adaptive bacterial foraging driven datapath optimization: Exploring power-performance tradeoff in high level synthesis

Author

Listed:
  • Bhadauria, Saumya
  • Sengupta, Anirban

Abstract

An automated exploration of datapath for power-delay tradeoff in high level synthesis (HLS) driven by bacterial foraging optimization algorithm (BFOA) is proposed in this paper. The proposed exploration approach is simulated to operate in the feasible temperature range of an actual Escherichia coli (E. coli) bacterium in order to mimic its biological lifecycle. The proposed work transforms a regular BFOA into an adaptive DSE framework that is capable to explore power-performance tradeoffs during HLS. The key sub-contributions of the proposed methodology are as follows: (a) Novel chemotaxis driven exploration drift algorithm; (b) Novel multi-dimensional bacterium encoding scheme to handle the DSE problem; (c) A novel replication algorithm customized to the DSE problem for manipulating the position of the bacterium by keeping the resource information constant (useful for inducing exploitative ability in the algorithm); (d) A novel elimination-dispersal (ED) algorithm to introduce diversity during the exploration process; (e) Adaptive mechanisms such as resource clamping and step size clamping to handle boundary outreach problem during exploration. Finally, results indicated an average improvement in QoR of > 35% and reduction in runtime of > 4% compared to recent approaches.

Suggested Citation

  • Bhadauria, Saumya & Sengupta, Anirban, 2015. "Adaptive bacterial foraging driven datapath optimization: Exploring power-performance tradeoff in high level synthesis," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 265-278.
  • Handle: RePEc:eee:apmaco:v:269:y:2015:i:c:p:265-278
    DOI: 10.1016/j.amc.2015.07.042
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315009613
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2015.07.042?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:269:y:2015:i:c:p:265-278. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.