dc.creator | Craig, Morgenstern, | |
dc.date.accessioned | 2019-11-08T18:59:27Z | |
dc.date.available | 2019-11-08T18:59:27Z | |
dc.date.issued | 1994-05-05 | |
dc.identifier.uri | https://doi.org/10.1155/1994/317328 | |
dc.identifier.uri | https://repository.tcu.edu/handle/116099117/35794 | |
dc.identifier.uri | https://www.hindawi.com/journals/sp/1994/317328/abs/ | |
dc.description.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. | |
dc.language.iso | en | en_US |
dc.publisher | Hindawi | |
dc.rights.uri | https://creativecommons.org/licenses/by/3.0/ | |
dc.source | Scientific Programming | |
dc.subject | submesh allocation | |
dc.subject | interval set scan | |
dc.subject | FCFS | |
dc.subject | maximum boundary value heuristic | |
dc.subject | frame sliding | |
dc.title | Methods for Precise Submesh Allocation | |
dc.type | Article | |
dc.rights.holder | Craig et al. | |
dc.rights.license | CC BY 3.0 | |
local.college | College of Science and Engineering | |
local.department | Computer Science | |
local.persons | Morgenstern (COSC) | |