As heuristic algorithms usually omit the difference between instruction and instruction instance

we improved one existing heuristic algorithm to GreedyHeur algorithm.It calculates custom instructions’ weights from their instruction instances

then select custom instruction instances with greedy strategy according to their instructions’ weights.To find better custom instruction than heuristic algorithms

we introduced an algorithm(ISDE)integrating greedy strategy with differential evolution algorithm.Simple encoding and efficient fitness evaluation help ISDE find the best combination of custom instructions quickly.Experiments show that our algorithms can find better custom instruction candidates more quickly and efficiently than heuristic algorithm.