Successive stage multi-round scheduling for cube based multi-processor systems

Multi-processor systems are advantageous in the sense that they allow concurrent execution of the given workload. The workload can be thought as the computation units which can be either processes or tasks. These processes or tasks can either be independent programs or partitioned modules of a single program. This paper presents an algorithm named as “Successive Stage Multi Round Scheduling” which is able to allocate and balance the given workload among the connected processing units of the Multi-processor system in order to improve the efficiency of the system. Simulation results are obtained using the hypercube architecture due to its simple design and high interconnectivity and results are compared with two existing schemes namely “Minimum Distance Scheduling” and “Two Round Scheduling.”