Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
On the fault-diameter of the star graph
Information Processing Letters
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Statistical Properties of the Buddy System
Journal of the ACM (JACM)
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
A comparative study of job allocation and migration in the pancake network
Information Sciences: an International Journal
| Hi-index | 0.00 |
The star graph has been known as an attractive candidate for interconnecting a largenumber of processors. The hierarchy of the star graph allows the assignment of itsspecial subgraphs (substars), which have the same topological features as the originalgraph, to a sequence of incoming tasks. The paper proposes a new code, called starcode (SC), to recognize available substars of the required size in the star graph. It isshown that task allocation based on the SC is statically optimal. The recognition ability ofa given SC or a class of SC's is derived. The optimal number of SC's required for thecomplete substar recognition in an n-dimensional star is shown to be 2/sup n-2/.