Scientific Programming

Scientific Programming / 1994 / Article
Special Issue

Operating system Support for Massively Parallel Computer Architectures

View this Special Issue

Open Access

Volume 3 |Article ID 317328 | https://doi.org/10.1155/1994/317328

Craig Morgenstern, "Methods for Precise Submesh Allocation", Scientific Programming, vol. 3, Article ID 317328, 12 pages, 1994. https://doi.org/10.1155/1994/317328

Methods for Precise Submesh Allocation

Received05 Apr 1994
Accepted05 May 1994

Abstract

In this article we describe and compare several recently proposed algorithms for precise submesh allocation in a two-dimensional mesh connected system. The methods surveyed include various frame sliding strategies, the maximum boundary value heuristic, and interval set scan techniques. In addition, a new enhancement to the interval set scan method is described. This enhancement results in an algorithm that has better allocation and run-time performance under a FCFS scheduling policy than any of the other proposed methods. We present results drawn from an extensive simulation study to illustrate the relative efficiency of the various methods.

Copyright © 1994 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Order printed copiesOrder
Views117
Downloads441
Citations

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.