Table 3.

Comparison of different mapping toolchains.

Toolchains		SpiNeMap [13]	SNEAP [22]	DFSynthesizer [23]	NEUTRAMS ${}^4$ [21]	EdgeMap
Partition	Algorithm	Kernighan–Lin(KL)	METIS	Greedy algorithm ${}^1$	Kernighan–Lin(KL)	Streaming-based
	Objective	Communication cost	Communication cost	Resource Utilization.	Communication cost	Communication cost
Mapping	Algorithm	PSO	SA ${}^2$	LSA ${}^3$	–	NSGA-II
	Objective	Communication cost	Average Hop	Energy consumption	–	Communication cost & Energy consumption

¹ This algorithm is a modified greedy algorithm. ² SA is short for simulated annealing. ³ LSA is short for the local search algorithm. ⁴ In NEUTRAMS, the mapping stage is not mentioned, we use sequential mapping as the default.