Paper Info
Title
Efficient Heuristic Algorithm for Rapid Custom-Instruction Selection
Abstract
Custom-instruction selection is an essential phase in custom-instruction generation. It determines the most profitable custom instruction candidates for hardware implementation. In this paper, a practical computing model is proposed for the problem of custom-instruction selection that takes into account the hardware area constraint. Based on the new computing model, a novel heuristic algorithm is presented to rapidly generate high quality approximate solutions. The overlapping information of custom-instruction instances is utilized in the algorithm to instruct the selection process. Simulation results show that the proposed heuristic algorithm runs fast even for the large-sized problems. The proposed heuristic algorithm produces high-quality approximate solutions.Experimental results show that the difference between the approximate solutions and the optimal ones is only about 3%.
Year
DOI
Venue
2009
10.1109/ICIS.2009.108
ACIS-ICIS
Keywords
Field
DocType
novel heuristic algorithm,hardware area constraint,selection process,approximate solution,custom-instruction generation,rapid custom-instruction selection,hardware implementation,custom-instruction selection,proposed heuristic algorithm,efficient heuristic algorithm,high-quality approximate solution,custom-instruction instance,instruction sets,sorting,benchmark testing,process simulation,hardware,data mining,directed graphs,information science,profitability,directed acyclic graph,heuristic,heuristic algorithm,indexes,computational modeling,computer model
Heuristic,Min-conflicts algorithm,Instruction set,Heuristic (computer science),Computer science,Parallel computing,Selection algorithm,Algorithm,Null-move heuristic,Consistent heuristic,Benchmark (computing)
Conference
Citations 
PageRank 
References 
6
0.46
8
Authors
5
Name
Order
Citations
PageRank
Tao Li1387.33
Wu Jigang276486.18
Siew-Kei Lam39914.60
Thambipillai Srikanthan4927104.05
Xicheng Lu51276110.03