The Non-Contiguous Allocation Strategies Performance for k-ary n-cube Connected Multi Computers Using Smallest Job First Scheduling Strategy

The performance of the famous non-contiguous allocation algorithms (Paging (0), Multiple Partner, and Random) proposed for k-ary n-cube connected multi computers have been compared by wide simulation experiments. In the paper, smallest job first scheduling strategy (SJF), and three communication patterns were measured, these are random, one-to-all, and all-to-all. The simulation results display that the performance of the non-contiguous Paging (0) is superior to that of wholly additional non-contiguous allocation algorithms (strategies) in our scenario due to their capability to reduce together (internal and external) fragmentation and reduction the dispute inside the network by persevere a huge contiguity degree through allocated processors.