Performance evaluation of noncontiguous allocation algorithms for 2D mesh interconnection networks

Authors:
Saad Bani-Mohammad;Ismail Ababneh;Mazen Hamdan
Affiliations:
Department of Computer Science, Prince Hussein Bin Abdullah College for Information Technology, Al al-Bayt University, Mafraq 25113, Jordan;Department of Computer Science, Prince Hussein Bin Abdullah College for Information Technology, Al al-Bayt University, Mafraq 25113, Jordan;Faculty of Engineering Technology, Al-Balqa'a Applied University, Jordan
Venue:
Journal of Systems and Software
Year:
2011

Citing 12
Cited 0

A two-dimensional buddy systems for dynamic resource allocation in a partitionable mesh connected system

Journal of Parallel and Distributed Computing
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Performance improvement of allocation schemes for mesh-connected computers

Journal of Parallel and Distributed Computing
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead

IEEE Transactions on Parallel and Distributed Systems
iWarp: A 100-MOPS, LIW Microprocessor for Multicomputers

IEEE Micro
Allocating Precise Submeshes in Mesh Connected Systems

IEEE Transactions on Parallel and Distributed Systems
A New Processor Allocation Strategy Using ESS (Expanding Square Strategy)

PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers

Journal of Systems and Software
Processor Allocation in Mesh Multiprocessors Using a Hybrid Method

PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
An efficient non-contiguous processor allocation strategy for 2D mesh connected multicomputers

Information Sciences: an International Journal
Availability-based noncontiguous processor allocation policies for 2D mesh-connected multicomputers

Journal of Systems and Software
Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several noncontiguous allocation strategies have been proposed for 2D mesh-connected multicomputers. These allocation strategies 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 proposed formula that estimates the job execution time when the job is allocated noncontiguous submeshes. Using this formula, simulation results had shown that ANCA could outperform the preceding Multiple Buddy Strategy (MBS). However, the execution times of jobs under noncontiguous allocation depend on message sizes, the number of messages sent, message contention and distances messages traverse. In this paper, we evaluate ANCA for different communication patterns using an event-driven simulator operating at the flit level, which allows for a more realistic evaluation that takes into account the shape of allocation and contention among messages. Moreover, we compare the performance of ANCA with that of other noncontiguous allocation strategies, MBS, Greedy Available Busy List (GABL), and Paging(0). The results show that ANCA is inferior to the remaining strategies, and that GABL has the best performance results, expressed in terms of the average turnaround time and mean system utilization performance parameters.