Welcome to the InfoSci Platform
Reference Hub5
A New Compacting Non-Contiguous Processor Allocation Algorithm for 2D Mesh Multicomputers

A New Compacting Non-Contiguous Processor Allocation Algorithm for 2D Mesh Multicomputers

Saad Bani-Mohammad, Ismail M. Ababneh, Mohammad Yassen
Copyright: © 2015 |Volume: 8 |Issue: 4 |Pages: 19
ISSN: 1938-7857|EISSN: 1938-7865|EISBN13: 9781466676527|DOI: 10.4018/JITR.2015100104
Cite Article Cite Article

MLA

Bani-Mohammad, Saad, et al. "A New Compacting Non-Contiguous Processor Allocation Algorithm for 2D Mesh Multicomputers." JITR vol.8, no.4 2015: pp.57-75. http://doi.org/10.4018/JITR.2015100104

APA

Bani-Mohammad, S., Ababneh, I. M., & Yassen, M. (2015). A New Compacting Non-Contiguous Processor Allocation Algorithm for 2D Mesh Multicomputers. Journal of Information Technology Research (JITR), 8(4), 57-75. http://doi.org/10.4018/JITR.2015100104

Chicago

Bani-Mohammad, Saad, Ismail M. Ababneh, and Mohammad Yassen. "A New Compacting Non-Contiguous Processor Allocation Algorithm for 2D Mesh Multicomputers," Journal of Information Technology Research (JITR) 8, no.4: 57-75. http://doi.org/10.4018/JITR.2015100104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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 shape is available. Lifting the contiguity condition is expected to reduce processor fragmentation and increase system utilization. However, the distances traversed by messages can be long, and as a result the communication overhead, especially contention, is likely to increase. The extra communication overhead depends on how the allocation request is partitioned and assigned to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as Compacting Non-Contiguous Processor Allocation Strategy (CNCPA), is suggested for the 2D mesh multicomputers. In the proposed strategy, a job is compacted into free locations. The selection of the free locations has for goal leaving large free sub-meshes in the system. To evaluate the performance improvement achieved by the proposed strategy and compare it against well-known existing non-contiguous allocation strategies, the authors conducted extensive simulation experiments. The results show that the proposed strategy can improve performance in terms of job turnaround times and system utilization.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.