A SPM memory allocation method were proposed based on extend control flow graph.This method transforms the application into a directed graph consisting of nodes and relationships of nodes.In succession

this method applies a refined Knapsack algorithm to solve the problem of SPM memory allocation.In the previous researches

these relationships of nodes are ignored

which result in a considerable expense of memory space during the process of SPM allocation.Our experiments show that our approach conduces to significant performance improvements (11% an average) compared to the previous.And the execution time of the application is reduced to 56% compared to none SPM environment.