Affiliation:
1. Prince Hussein Bin Abdullah College for Information Technology, Al al-Bayt University, Jordan
Abstract
This chapter presents an extensive evaluation of a new contiguous allocation strategy proposed for 3D mesh multicomputers. The strategy maintains a list of maximal free sub-meshes and gives priority to allocating corner and boundary free sub-meshes. This strategy, which we refer to as Turning Corner-Boundary Free List (TCBFL) strategy, is compared, using extensive simulation experiments, to several existing allocation strategies for 3D meshes. In addition to allocation strategies, two job scheduling schemes, First-Come-First-Served (FCFS) and Shortest-Service-Demand (SSD) are considered in comparing the performance of the allocation strategies. The simulation results show that TCBFL produces average turnaround times and mean system utilization values that are superior to those of the existing allocation strategies. The results also reveal that SSD scheduling is much better than FCFS scheduling. Thus, the scheduling and allocation strategies both have substantial effect on the performance of contiguous allocation strategies in 3D mesh-connected multicomputers.
Reference33 articles.
1. Job scheduling and contiguous processor allocation for three-dimensional mesh multicomputers;I.Ababneh;AMSE Advances in Modelling & Analysis,2001
2. An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers
3. On submesh allocation for 2D mesh multicomputers using the free-list approach: Global placement schemes
4. Non contiguous processor allocation for three-dimensional mesh multicomputers;I.Ababneh;Advances in Modelling and Analysis Journal,2003
5. Corner-Boundary Processor Allocation for 3D Mesh-Connected Multicomputers