Performance Evaluation of Contiguous and Noncontiguous Processor Allocation Based on Common Communication Patterns for 2D Mesh Interconnection Network

Abstract

Several processor allocation studies show that the performance of noncontiguous allocation is dramatically better than that of contiguous allocation, but this is not always true. The communication pattern may have a great effect on the performance of processor allocation algorithms. In this paper, the performance of well-known allocation algorithms is re-considered based on several communication patterns, including Near Neighbor, Ring, All-to-All, Divide and Conquer Binomial Tree (DQBT), Fast Fourier Transform (FFT), One-to-All, All-to-One, and Random. The allocation algorithms investigated include the contiguous First Fit (FF) and Best Fit (BF) and the noncontiguous Paging(0), Greedy Available Busy List (GABL) and Multiple Buddy Strategy (MBS). In near neighbor, FFT and DQBT, the simulation results show that the performance of contiguous allocation is dramatically better than that of the noncontiguous allocation in terms of response time; except for MBS in DQBT. In All-to-All, the results show that the performance of contiguous FF and BF is better than that of the noncontiguous MBS.