Resource Partition in k-ary n-cube
碩士 === 國立中正大學 === 資訊工程研究所 === 81 === In this thesis, we discuss the problem of resources psrtition in the k-ary n-cube multiprocessor system. First, we introduce how resources should be placed in a k-ary n-cube to satisfy perfect j-adjacnec...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1993
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/23743330456857228789 |