Saad Bani-Mohammad

Learn More
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 connecting these processors. In non-contiguous allocation, a job can execute on multiple disjoint smaller sub-meshes rather than always waiting until a(More)
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In noncontiguous allocation, a job request can be split into smaller parts that are allocated to non-adjacent free sub- meshes rather than always waiting until a single sub-mesh of the requested size and shape(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)
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)