B. Heuristic Graph Matching This is a graph matching based method, which uses a task graph and a processor-graph. While the task-graph denotes the dependency amongst the task modules, the processor graph defines the topology of interconnection amongst the processors. A classical example of this is the work by Shen and Tsai et al. [3] which uses the well-known A* algorithm to find the optimal task assignment.