On Submesh Allocation for Mesh Multicomputers: A Best-Fit Allocation and a Virtual Submesh Allocation for Faulty Meshes

Authors:
Geunmo Kim;Hyunsoo Yoon
Affiliations:
Korea Advanced Institute of Science and Technology, Yusong-Ku, Korea;Korea Advanced Institute of Science and Technology, Yusong-Ku, Korea
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1998

Citing 7
Cited 14

Numerical recipes in C: the art of scientific computing

Numerical recipes in C: the art of scientific computing
A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system

CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
A two-dimensional buddy systems for dynamic resource allocation in a partitionable mesh connected system

Journal of Parallel and Distributed Computing
The power of parallelism

IEEE Spectrum - Supercomputing
Japan: a competitive assessment

IEEE Spectrum - Supercomputing
Beyond today's supercomputers

IEEE Spectrum - Supercomputing
The Tera computer system

ICS '90 Proceedings of the 4th international conference on Supercomputing

A new “quad-tree-based” sub-system allocation technique for mesh-connected parallel machines

ICS '99 Proceedings of the 13th international conference on Supercomputing
Submesh Determination in Faulty Tori and Meshes

IEEE Transactions on Parallel and Distributed Systems
A "Generalized k-Tree-Based Model to Sub-system Allocation" for Partitionable Multi-dimensional Mesh-Connected Architectures

ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
Dynamic Processor Allocation in Large Mesh-Connected Multicomputers

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers

Journal of Systems and Software
Distributed dynamic processor allocation for multicomputers

Parallel Computing
Multitoroidal Interconnects For Tightly Coupled Supercomputers

IEEE Transactions on Parallel and Distributed Systems
Availability-based noncontiguous processor allocation policies for 2D mesh-connected multicomputers

Journal of Systems and Software
On submesh allocation for 2D mesh multicomputers using the free-list approach: Global placement schemes

Performance Evaluation
Hardware implementation of processor allocation schemes for mesh-based chip multiprocessors

Microprocessors & Microsystems
Routing-contained virtualization based on Up*/Down* forwarding

HiPC'07 Proceedings of the 14th international conference on High performance computing
An adaptive job scheduling scheme for mesh-connected multicomputers

The Journal of Supercomputing
Fast and efficient processor allocation algorithm for torus-based chip multiprocessors

Computers and Electrical Engineering
An FPGA-based fault-tolerant 2D systolic array for matrix multiplications

Transactions on computational science XIII

Quantified Score

Hi-index	0.00

Visualization

Abstract

The submesh allocation problem is to recognize and locate a free submesh that can accommodate a request for a submesh of a specified size. In this paper, we propose a new best-fit submesh allocation strategy for mesh-connected multiprocessor systems. The proposed strategy maintains and uses a free submesh list for an efficient allocation. For an allocation request, the strategy selects the best-fit submesh which causes the least amount of potential processor fragmentation. As many large free submeshes as possible are preserved for later allocations. For this purpose, we introduce a novel function quantifying the degree of potential fragmentation of submeshes. The proposed strategy has the capability of recognizing a complete submesh. We also propose an allocation strategy for faulty meshes which can maintain and allocate virtual submeshes derived from faulty submeshes. Extensive simulation is carried out to compare the proposed strategy with previous strategies. The proposed strategy has the best performance: a 6-50 percent improvement over the previous best strategy.