Journal of Computer Networks and Communications

Research Article

Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment

Table 3

Phasewise ECM(, ,) and RCM(, ,).


Phases	Tasks	Execution costs			Residence costs
		ECM(, ,)			RCM(, ,)
		$p_{1}$	$p_{2}$	$p_{3}$	$p_{1}$	$p_{2}$	$p_{3}$

1	$t_{1}$	—	—	—	3	1	2
	$t_{2}$	2	6	4	—	—	—
	$t_{3}$	—	—	—	3	4	2
	$t_{4}$	—	—	—	4	3	2
	$t_{5}$	—	—	—	4	3	2
	$t_{6}$	—	—	—	2	1	1
	$t_{7}$	—	—	—	3	1	2

2	$t_{1}$	6	4	8	—	—	—
	$t_{2}$	—	—	—	2	1	3
	$t_{3}$	—	—	—	3	2	2
	$t_{4}$	—	—	—	3	4	2
	$t_{5}$	—	—	—	3	3	2
	$t_{6}$	—	—	—	1	4	4
	$t_{7}$	—	—	—	2	3	2

3	$t_{1}$	—	—	—	2	3	1
	$t_{2}$	—	—	—	2	2	2
	$t_{3}$	—	—	—	3	4	2
	$t_{4}$	6	3	∞	—	—	—
	$t_{5}$	—	—	—	3	2	1
	$t_{6}$	—	—	—	3	2	2
	$t_{7}$	—	—	—	3	1	1

4	$t_{1}$	—	—	—	2	1	2
	$t_{2}$	—	—	—	1	1	2
	$t_{3}$	—	—	—	3	3	1
	$t_{4}$	—	—	—	1	2	4
	$t_{5}$	—	—	—	2	2	1
	$t_{6}$	8	6	4	—	—	—
	$t_{7}$	—	—	—	1	1	3

5	$t_{1}$	—	—	—	2	1	1
	$t_{2}$	—	—	—	2	1	2
	$t_{3}$	6	6	8	—	—	—
	$t_{4}$	—	—	—	2	2	2
	$t_{5}$	—	—	—	4	3	2
	$t_{6}$	—	—	—	1	2	3
	$t_{7}$	—	—	—	2	1	2

6	$t_{1}$	—	—	—	3	2	2
	$t_{2}$	—	—	—	1	4	1
	$t_{3}$	—	—	—	1	2	1
	$t_{4}$	—	—	—	2	1	1
	$t_{5}$	5	4	2	—	—	—
	$t_{6}$	—	—	—	2	2	1
	$t_{7}$	—	—	—	1	1	2

7	$t_{1}$	—	—	—	1	2	1
	$t_{2}$	∞	6	8	—	—	—
	$t_{3}$	—	—	—	2	3	1
	$t_{4}$	—	—	—	2	3	1
	$t_{5}$	—	—	—	1	2	2
	$t_{6}$	—	—	—	1	3	2
	$t_{7}$	—	—	—	2	2	1

8	$t_{1}$	—	—	—	2	1	1
	$t_{2}$	—	—	—	1	1	2
	$t_{3}$	—	—	—	2	4	2
	$t_{4}$	—	—	—	2	3	3
	$t_{5}$	—	—	—	1	1	4
	$t_{6}$	—	—	—	3	2	2
	$t_{7}$	4	7	8	—	—	—