Selecting Most Profitable Instruction-Set Extensions Using Ant Colony Heuristic

Abstract : Due to the combination of flexibility and runtime performance, extensible processors have been widely used in embedded systems in last decade. Extensible processors extend the instruction set of a general purpose processor by a set of customized instructions. In general, the instruction set extension generation includes two crucial steps: subgraph (graph representation of custom instruction) enumeration and subgraph selection. In this paper, we have formally proved that the upper bound of the number of feasible solutions for the subgraph selection problem is 3n/ 3, where n is the number of subgraph candidates. We also propose an ant colony optimization algorithm (ACO) and a version of modified ACO algorithm (MACO) for solving the subgraph selection problem that aim at minimizing the application execution time while satisfying non-overlapping constraint (and area constraint). Experimental results show that the MACO algorithm outperforms the ACO algorithm, the well-known tabu search algorithm and the heuristic algorithm [6] on average 2.7%, 5.9% and 15.1%
Type de document :
Communication dans un congrès
Conference on Design and Architectures for Signal and Image Processing, DASIP 2015, Sep 2015, Cracow, Poland. Conference on Design and Architectures for Signal and Image Processing, DASIP 2015, 2015
Liste complète des métadonnées

https://hal.inria.fr/hal-01220682
Contributeur : Emmanuel Casseau <>
Soumis le : lundi 26 octobre 2015 - 17:09:15
Dernière modification le : mercredi 16 mai 2018 - 11:23:27

Identifiants

  • HAL Id : hal-01220682, version 1

Citation

Shanshan Wang, Chenglong Xiao, Wanjun Liu, Emmanuel Casseau, Yang Xiao. Selecting Most Profitable Instruction-Set Extensions Using Ant Colony Heuristic. Conference on Design and Architectures for Signal and Image Processing, DASIP 2015, Sep 2015, Cracow, Poland. Conference on Design and Architectures for Signal and Image Processing, DASIP 2015, 2015. 〈hal-01220682〉

Partager

Métriques

Consultations de la notice

676