An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead
碩士 === 國立臺灣科技大學 === 電機工程研究所 === 84 === This thesis proposes a new submesh allocation scheme for two- dimensional mesh systems. The proposed submesh detection mechanism considers only those available free submeshes that border from the left...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1996
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/35509372228090033266 |
| Summary: | 碩士 === 國立臺灣科技大學 === 電機工程研究所 === 84 === This thesis proposes a new submesh allocation scheme for two-
dimensional mesh systems. The proposed submesh detection
mechanism considers only those available free submeshes that
border from the left on the allocated submeshes. Consequently,
fragmentation can be reduced. An efficient method is then
presented to facilitate the detection of such available
submeshes. The method is simple and causes little overhead in
terms of time and storage space. It guarantees to identify an
available submesh as long as it exists. Simulation results show
the effectiveness of the proposed scheme. In particular, the
simple first-fit-oriented assignment policies are found to be
well suited with our mechanism. The proposed scheme is also
extended to multidimensional meshes.
|
|---|