Performance evaluation of task migration in contiguous allocation for mesh interconnection topology

摘要

In this paper, several efficient migration algorithms have been proposed to improve existing non-preemptive sub-mesh allocation strategies in multiprocessors which are two-row boundary migration algorithm (TRBMA) and different types of combined migration mechanisms. These methods are presented to solve the external fragmentation problem in contiguous allocation. In this process, the mentioned methods contain the algorithms, called the minimum threshold and prime number (MT&MPN), which determine the best sub-mesh size for the incoming job. These algorithms are used to increase continuity in multiprocessor systems. Using extensive simulations, we evaluated the proposed methods and compared them with previous strategies. Simulation outcomes clearly showed the TRBMA and the MT&MPN procedure produced the best average job execution time and average system utilization. Also, hybrid migration methods produced the best average job waiting time and average number of waiting jobs in comparison with the previous algorithms. Meanwhile, most of the traditional methods had better average job response time.