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 |
id |
ndltd-TW-084NTUST442064 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-084NTUST4420642016-07-13T04:11:03Z http://ndltd.ncl.edu.tw/handle/35509372228090033266 An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead 二維網狀系統之子網狀配置 Shin-Kung Chen 陳世恭 碩士 國立臺灣科技大學 電機工程研究所 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. Ge-Ming Chiu 邱舉明 1996 學位論文 ; thesis 41 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣科技大學 === 電機工程研究所 === 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.
|
author2 |
Ge-Ming Chiu |
author_facet |
Ge-Ming Chiu Shin-Kung Chen 陳世恭 |
author |
Shin-Kung Chen 陳世恭 |
spellingShingle |
Shin-Kung Chen 陳世恭 An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead |
author_sort |
Shin-Kung Chen |
title |
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead |
title_short |
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead |
title_full |
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead |
title_fullStr |
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead |
title_full_unstemmed |
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead |
title_sort |
efficient submesh allocation scheme for two-dimensional meshes with little overhead |
publishDate |
1996 |
url |
http://ndltd.ncl.edu.tw/handle/35509372228090033266 |
work_keys_str_mv |
AT shinkungchen anefficientsubmeshallocationschemefortwodimensionalmesheswithlittleoverhead AT chénshìgōng anefficientsubmeshallocationschemefortwodimensionalmesheswithlittleoverhead AT shinkungchen èrwéiwǎngzhuàngxìtǒngzhīziwǎngzhuàngpèizhì AT chénshìgōng èrwéiwǎngzhuàngxìtǒngzhīziwǎngzhuàngpèizhì AT shinkungchen efficientsubmeshallocationschemefortwodimensionalmesheswithlittleoverhead AT chénshìgōng efficientsubmeshallocationschemefortwodimensionalmesheswithlittleoverhead |
_version_ |
1718347525851709440 |