Application partitioning on programmable platforms using the ant colony optimization

  • Authors:

  • Gang Wang;Wenrui Gong;Ryan Kastner

  • Affiliations:

  • (Correspd. Tel.: +1 805 893 3985/ E-mail: wanggang@ece.ucsb.edu) Department of Electrical and Computer Engineering, University of California at Santa Barbara, Santa Barbara, CA 93106-9560, USA;Department of Electrical and Computer Engineering, University of California at Santa Barbara, Santa Barbara, CA 93106-9560, USA;Department of Electrical and Computer Engineering, University of California at Santa Barbara, Santa Barbara, CA 93106-9560, USA

  • Venue:
  • Journal of Embedded Computing - Embeded Processors and Systems: Architectural Issues and Solutions for Emerging Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Modern digital systems consist of a complex mix of computational resources, e.g. microprocessors, memory elements and reconfigurable logic. System partitioning - the division of application tasks onto the system resources - plays an important role for the optimization of the latency, area, power and other performance metrics. This paper presents a novel approach for this problem based on the Ant Colony Optimization, in which a collection of agents cooperate using distributed and local heuristic information to effectively explore the search space. The proposed model can be flexibly extended to fit different design requirements. Experiments show that our algorithm provides robust results that are qualitatively close to the optimal with minor computational cost. Compared with the popularly used simulated annealing approach, the proposed algorithm gives better solutions with substantial reduction on execution time for large problem instances. Moreover, a hybrid approach that combines our algorithm and SA achieves even better results with great runtime reduction.