Parallel custom instruction identification for extensible processors

With the ability of customization for an application domain, extensible processors have been used more and more in embedded systems in recent years. Extensible processors customize an application domain by executing parts of application code in hardware instead of software. Determining parts of appl...

Full description

Saved in:
Bibliographic Details
Published in:Journal of systems architecture Vol. 76; pp. 149 - 159
Main Authors: Xiao, Chenglong, Wang, Shanshan, Liu, Wanjun, Casseau, Emmanuel
Format: Journal Article
Language:English
Published: Elsevier B.V 01.05.2017
Elsevier
Subjects:
Computer Science
Custom instruction
Extensible processors
Hardware Architecture
Parallel algorithms
Subgraph enumeration algorithm
Subgraph selection algorithm
Subgraph enumeration algorithm
Custom instruction
Parallel algorithms
Subgraph selection algorithm
Extensible processors
ISSN:1383-7621, 1873-6165
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the ability of customization for an application domain, extensible processors have been used more and more in embedded systems in recent years. Extensible processors customize an application domain by executing parts of application code in hardware instead of software. Determining parts of application code as custom instruction generally requires subgraph enumeration and subgraph selection. Both subgraph enumeration problem and subgraph selection problem are computationally difficult problems. Most of previous works focus on sequential algorithms for these two problems. In this paper, we present a parallel implementation of a latest subgraph enumeration algorithm based on a computer cluster. A standard ant colony optimization algorithm (ACO), a modified version of ACO with local optimum search and a parallel ACO algorithm are also proposed to solve the subgraph selection problem in this work. Experimental results show that the parallel algorithms outperform the sequential algorithms in terms of runtime or (and) quality of results. In addition, we have formally proved the upper bound on the number of feasible solutions in subgraph selection problem with or without the overlapping constraint.
ISSN:1383-7621
1873-6165
DOI:10.1016/j.sysarc.2016.11.011