Algorithm 1 The main procedure of the proposed multi-phase multi-application mapping

Input: a set of N applications, a 2D Mesh based NoC architecture Output: mutli-application mapping results 1. for i=1 to N 2. analyze potential rectangles Ri1, Ri2, …Rij…, based on the number of tasks of the application and  the bounds of width and height 3. for a single application, under different potential rectangles, a genetic algorithm is used to map  tasks onto cores with selected regions on the NoC platform 4. identify the rectangle which performs best as the mapping region for the application 5. end for 6. packet each mapping region as a block and generate initial placement for multiple applications  mapping using a B*Tree representation 7. use a simulated annealing algorithm to explore optimal placements 8. output the optimal solution