Journal of Big Data

Table 4 The Throughput 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	2945.24	2892.24	2784.56	2656.22
200	2956.35	2893.67	2786.56	2658.92
300	2963.12	2894.78	2788.64	2712.35
400	2974.86	2898.45	2789.64	2716.89
500	2798.62	2912.68	2812.35	2718.24
600	2832.56	2926.84	2843.58	2719.48
700	2868.42	2956.84	2849.58	2846.42
800	2879.12	2976.52	2856.82	2858.96
900	2983.42	2988.14	2878.42	2869.42
1000	3078.42	2998.85	2889.54	2876.82

Back to article page