An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers

Authors:
Ismail Ababneh
Affiliations:
Computer Science Department, Al al-Bayt University, Mafraq, Jordan
Venue:
Journal of Systems and Software
Year:
2006

Citing 9
Cited 12

Multicomputers: Message-Passing Concurrent Computers

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

Journal of Parallel and Distributed Computing
Submesh allocation in mesh multicomputers using busy-list: a best-fit approach with complete recognition capability

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

IEEE Transactions on Parallel and Distributed Systems
An Efficient Task Allocation Scheme for 2D Mesh Architectures

IEEE Transactions on Parallel and Distributed Systems
On Submesh Allocation for Mesh Multicomputers: A Best-Fit Allocation and a Virtual Submesh Allocation for Faulty Meshes

IEEE Transactions on Parallel and Distributed Systems
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead

IEEE Transactions on Parallel and Distributed Systems
Allocating Precise Submeshes in Mesh Connected Systems

IEEE Transactions on Parallel and Distributed Systems
Lookahead Processor Allocation in Mesh-Connected Massively Parallel Multicomputer

Proceedings of the 8th International Symposium on Parallel Processing

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
A temperature-aware virtual submesh allocation scheme for noc-based manycore chips

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On submesh allocation for 2D mesh multicomputers using the free-list approach: Global placement schemes

Performance Evaluation
Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers

Journal of Systems and Software
Hardware implementation of processor allocation schemes for mesh-based chip multiprocessors

Microprocessors & Microsystems
Fast and efficient processor allocation algorithm for torus-based chip multiprocessors

Computers and Electrical Engineering
On improved processor allocation in 2D mesh-based multicomputers: controlled splitting of parallel requests

Proceedings of the 2011 International Conference on Communication, Computing & Security
Task migration in three-dimensional meshes

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

Journal of Systems and Software
Energy characteristic of a processor allocator and a network-on-chip

International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
A performance comparison of the contiguous allocation strategies in 3D mesh connected multicomputers

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient free-list submesh allocation scheme for two-dimensional mesh-connected systems. The scheme maintains an unordered list of free submeshes. For allocation, it selects the first free submesh that has at least the same size as the request, and when the selected submesh is larger than the request the part actually allocated is one that has the largest number of busy neighbors and mesh boundary processors. Whereas the best previously proposed schemes have time complexities that are either quadratic or cubic in the number of free or allocated submeshes, the time complexity of the proposed scheme is linear in the number of free submeshes. To evaluate the effectiveness of the scheme, its system performance in terms of parameters such as the average job turnaround time was compared to that of promising previously proposed schemes. Simulation results show that the scheme performs at least as well as these schemes, yet it has the lowest time complexity.