Saad Bani-Mohammad

Learn More
(2006) Non-contiguous processor allocation strategy for 2D mesh connected multicomputers based on sub-meshes available for allocation. Abstract Contiguous allocation of parallel jobs usually suffers from the degrading effects of fragmentation as it requires that the allocated processors be contiguous and has the same topology as the network topology(More)
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In non-contiguous allocation, a job request can be split into smaller parts that are allocated possibly non-adjacent free sub-meshes rather than always waiting until a single sub-mesh of the requested size and(More)
An efficient processor allocation strategy that maintains a high degree of contiguity among processors in 2D mesh connected multicomputers. Abstract Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In non-contiguous allocation, a job request can be split into(More)
In this paper, a fast and efficient busy-list sub-mesh allocation strategy, referred to as Turning Busy List (TBL), is suggested for 3D mesh connected multicomputers. Turning means that the orientation of the allocation request is changed when no sub-mesh is available in the requested orientation. The TBL strategy considers only those available free(More)