processor Allocation in K-ary n-cube Multiprocessors
碩士 === 淡江大學 === 電機工程研究所 === 85 === This paper presents an extension of a previous processor allocation scheme, the Tree Collapsing (TC) strategy, to recognize m-ary r-cubes in a K-ary n-cube system, where m□K and r□n. We assume that tasks arrive dynamically and request processors connected in spe...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1997
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/89141043138551811077 |