| Summary: | 碩士 === 國立中正大學 === 資訊工程研究所 === 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-adjacnecy constraint. A perfect j-adjaacnecy
placement in a k-ary n-cube can be described as follows: each
processor of k-ary n-cube is either placed a copy of resource
on it, or adjacent to exactly j processors that has resources
placed on them. Then, we derive the algorithm of partitioning
resources into j types to satisfy that every non-resource
processor is adjacent to different j types of resources. The
algorithm we constructed consists of two parts: (1) n/j is an
integer and (2) n/j is not an integer.
|
|---|
