Journal of Big Data

Table 2 The Makespan of the proposed HGDSMO Scheme with different Tasks

From: Hybrid gradient descent spider monkey optimization (HGDSMO) algorithm for efficient resource scheduling for big data processing in heterogenous environment

Number of tasks	Proposed HGDSMO	HGDCSO	IHS-CSO	MGWO
100	612.78	637.58	678.21	689.84
200	657.56	686.68	695.87	703.42
300	725.13	786.14	804.68	826.85
400	765.12	786.94	821.46	845.68
500	812.12	824.68	846.84	867.32
600	896.28	905.68	934.94	945.64
700	1032.24	1068.92	1089.12	1123.44
800	1456.78	1568.56	1678.42	1289.42
900	1678.18	1719.32	1724.62	1768.94
1000	1858.14	1952.14	1968.94	1979.42

Back to article page