An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems

Authors:
Jianxun Ding;Laxmi N. Bhuyan
Affiliations:
Texas A&M University;Texas A&M University
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 02
Year:
1993

Citing 0
Cited 22

Good Processor Management = Fast Allocation + Efficient Scheduling

ICPP '97 Proceedings of the international Conference on Parallel Processing
An Integrated Processor Management Scheme for the Mesh-Connected Multicomputer Systems

ICPP '97 Proceedings of the international Conference on Parallel Processing
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
Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes

IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
Largest-job-first-scan-all scheduling policy for 2D mesh-connected systems

FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Finding Maximal Submeshes in Faulty 2D Mesh in the Presence of Failed Nodes

PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
An efficient submesh allocation scheme for 3D torus multicomputer systems

PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Multitoroidal Interconnects For Tightly Coupled Supercomputers

IEEE Transactions on Parallel and Distributed Systems
A dynamic processor management strategy on the reconfigurable meshes

International Journal of High Performance Computing and Networking
Availability-based noncontiguous processor allocation policies for 2D mesh-connected multicomputers

Journal of Systems and Software
Design and performance evaluation of combined first-fit task allocation and migration strategies in mesh multiprocessor systems

Parallel Computing
On submesh allocation for 2D mesh multicomputers using the free-list approach: Global placement schemes

Performance Evaluation
Resource allocation and utilization in the Blue Gene/L supercomputer

IBM Journal of Research and Development
Hardware implementation of processor allocation schemes for mesh-based chip multiprocessors

Microprocessors & Microsystems
Flexible DOR routing for virtualization of multicore chips

SOC'09 Proceedings of the 11th international conference on System-on-chip
Routing-contained virtualization based on Up*/Down* forwarding

HiPC'07 Proceedings of the 14th international conference on High performance computing
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
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
Multi-toroidal interconnects: using additional communication links to improve utilization of parallel computers

JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
An efficient, low-cost routing framework for convex mesh partitions to support virtualization

ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Wireless Health Systems, On-Chip and Off-Chip Network Architectures
Using task migration to improve non-contiguous processor allocation in NoC-based CMPs

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an adaptive scan (AS) strategy for submesh allocation. The earlier frame sliding (FS) strategy allocates submeshes based on fixed orientations of incoming faska. It also slides fiunaes om mesh planes by fdzed strides. Our AS a1Iocation strategy differs from the FS strategy in the following two ways: (1) it does not fiz the orientations of incoming tasks; (2) it scans on mesh planes adapfively. Experimental studies show that our AS strategy outperforms the FS strategy in terms of external fragmentation, completion time, and processor uitilizaiion.