2019-11-082019-11-081994-05-05https://doi.org/10.1155/1994/317328https://repository.tcu.edu/handle/116099117/35794https://www.hindawi.com/journals/sp/1994/317328/abs/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.enhttps://creativecommons.org/licenses/by/3.0/submesh allocationinterval set scanFCFSmaximum boundary value heuristicframe slidingArticleCC BY 3.0