Allocating Precise Submeshes in Mesh Connected Systems

Authors:
P. J. Chuang;N. F. Tzeng
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 8
Cited 20

The CLIP7A Image Processor

IEEE Transactions on Pattern Analysis and Machine Intelligence - Special Issue on Industrial Machine Vision and Computer Vision Technology:8MPart
Task migration in hypercube multiprocessors

ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
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
Minis and mainframes: the mainframe resurges

IEEE Spectrum
The Tera computer system

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

Communications of the ACM
Parallel Computers Two: Architecture, Programming and Algorithms

Parallel Computers Two: Architecture, Programming and Algorithms
Processor Allocation in k-ary n-cube Multiprocessors

ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks

Methods for precise submesh allocation

Scientific Programming - Special issue on operating system support for massively parallel computer architectures
An Efficient Method for Approximating Submesh Reliability of Two-Dimensional 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
A new “quad-tree-based” sub-system allocation technique for mesh-connected parallel machines

ICS '99 Proceedings of the 13th international conference on Supercomputing
Impact of job mix on optimizations for space sharing schedulers

Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
On Dependability Evaluation of Mesh-Connected Processors

IEEE Transactions on Computers
Processor Allocation in the Mesh Multiprocessors Using the Leapfrog Method

IEEE Transactions on Parallel and Distributed Systems
On fault tolerance of 3-dimensional mesh networks

Journal of Computer Science and Technology
Efficient Subtorus Processor Allocation in a Multi-Dimensional Torus

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Non-contiguous Processor Allocation Strategy for 2D Mesh Connected Multicomputers based on Sub-meshes Available for Allocation

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 2
An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers

Journal of Systems and Software
Probabilistic analysis on mesh network fault tolerance

Journal of Parallel and Distributed Computing
An efficient non-contiguous processor allocation strategy for 2D mesh connected multicomputers

Information Sciences: an International Journal
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
Processor allocation and job scheduling on 3D mesh interconnection networks

International Journal of Computers and Applications
Performance-asymmetry-aware topology virtualization for defect-tolerant NoC-based many-core processors

Proceedings of the Conference on Design, Automation and Test in Europe
On improved processor allocation in 2D mesh-based multicomputers: controlled splitting of parallel requests

Proceedings of the 2011 International Conference on Communication, Computing & Security
Performance evaluation of noncontiguous allocation algorithms for 2D mesh interconnection networks

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new processor allocation strategy that applies to any mesh system andrecognizes submeshes of arbitrary sizes at any locations in a mesh system. The proposedstrategy allocates a submesh of exactly the size requested by an incoming task,completely avoiding internal fragmentation. Because of its efficient allocation, thisstrategy exhibits better performance than an earlier allocation strategy based on thebuddy principle. An efficient implementation of this strategy is presented. Extensivesimulation runs are carried out to collect experimental cost and performance measures ofinterest under different allocation schemes.