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 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 submesh of the requested size and(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)
The performance of contiguous allocation strategies can be significantly affected by the distribution of job execution times. In this paper, the performance of the existing contiguous allocation strategies for 3D mesh multicomputers is re-visited in the context of heavy-tailed distributions (e.g., a Bounded Pareto distribution). The strategies are evaluated(More)
Several noncontiguous allocation policies have been proposed for 2D mesh-connected multicomputers. These allocation policies differ in their ability to detect free submeshes and in the degree of contiguity that exists among the submeshes they allocate to the same job. The previous Adaptive Noncontiguous Allocation (ANCA) policy was evaluated based on a(More)