Learning Based Genetic Algorithm for Task Graph Scheduling

Table 5

Comparison of LAGA with well-known genetic-based algorithms on FFT benchmarks.

Graph	Sequential Time	CGL [9]	BCGA [10]	Parsa; [8]	LAGA	LAGA	Speedup	improvement
FFT 1	296	152	124	124	124	124	2.38	0%
FFT 2	760	270	240	240	240	200	3.80	16%
FFT 4	480	260	255	185	255	170	2.82	8%

Speedup = sequential time / LAGA () completion time.
improvement = ((Parsa completion time - LAGA () completion time)/Parsa completion time) × 100.