Table 1.
Variable notations and definitions.
Table 2.
The estimated running time for each program.
Fig 1.
Shortest execution time schedule for Example 1.
Fig 2.
Longest execution time schedule for Example 2.
Fig 3.
4-programs and 2-supercomputers example for the design model.
Fig 4.
Design of the supercomputers-program model.
Fig 5.
Performance test measurement.
Table 3.
Overview of all proposed algorithms.
Table 4.
The Gp values variation for all proposed algorithms according to the number of programs.
Table 5.
The Gp values for all algorithms when nsu according to the number of supercomputers.
Table 6.
The Gp values for all algorithms and for each class.
Table 7.
The Time variation for all proposed algorithms when npr changes.
Table 8.
The Time variation for all proposed algorithms when nsu changes.
Fig 6.
The Gp values variation when Tp changes for algorithm BPC.
Fig 7.
Time variation when Tp changes for algorithm BPC.