Methods for Precise Submesh Allocation

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,...

Full description

Bibliographic Details
Main Author: Craig Morgenstern
Format: Article
Language:English
Published: Hindawi Limited 1994-01-01
Series:Scientific Programming
Online Access:http://dx.doi.org/10.1155/1994/317328
id doaj-25eb59cde8214d00b20aa985c9ac4aa9
record_format Article
spelling doaj-25eb59cde8214d00b20aa985c9ac4aa92021-07-02T06:29:46ZengHindawi LimitedScientific Programming1058-92441875-919X1994-01-013435336410.1155/1994/317328Methods for Precise Submesh AllocationCraig Morgenstern0Department of Computer Science, Texas Christian University, Fort Worth, TX 76129, USAIn 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.http://dx.doi.org/10.1155/1994/317328
collection DOAJ
language English
format Article
sources DOAJ
author Craig Morgenstern
spellingShingle Craig Morgenstern
Methods for Precise Submesh Allocation
Scientific Programming
author_facet Craig Morgenstern
author_sort Craig Morgenstern
title Methods for Precise Submesh Allocation
title_short Methods for Precise Submesh Allocation
title_full Methods for Precise Submesh Allocation
title_fullStr Methods for Precise Submesh Allocation
title_full_unstemmed Methods for Precise Submesh Allocation
title_sort methods for precise submesh allocation
publisher Hindawi Limited
series Scientific Programming
issn 1058-9244
1875-919X
publishDate 1994-01-01
description 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.
url http://dx.doi.org/10.1155/1994/317328
work_keys_str_mv AT craigmorgenstern methodsforprecisesubmeshallocation
_version_ 1721337127747190784