Show simple item record

dc.creatorCraig, Morgenstern,
dc.date.accessioned2019-11-08T18:59:27Z
dc.date.available2019-11-08T18:59:27Z
dc.date.issued1994-05-05
dc.identifier.urihttps://doi.org/10.1155/1994/317328
dc.identifier.urihttps://repository.tcu.edu/handle/116099117/35794
dc.identifier.urihttps://www.hindawi.com/journals/sp/1994/317328/abs/
dc.description.abstractIn 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.isoenen_US
dc.publisherHindawi
dc.rights.urihttps://creativecommons.org/licenses/by/3.0/
dc.sourceScientific Programming
dc.subjectsubmesh allocation
dc.subjectinterval set scan
dc.subjectFCFS
dc.subjectmaximum boundary value heuristic
dc.subjectframe sliding
dc.titleMethods for Precise Submesh Allocation
dc.typeArticle
dc.rights.holderCraig et al.
dc.rights.licenseCC BY 3.0
local.collegeCollege of Science and Engineering
local.departmentComputer Science
local.personsMorgenstern (COSC)


Files in this item

Thumbnail
This item appears in the following Collection(s)

Show simple item record

https://creativecommons.org/licenses/by/3.0/
Except where otherwise noted, this item's license is described as https://creativecommons.org/licenses/by/3.0/