Issue No. 11 - November (1994 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.329666
<p>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/.</p>
Index Termsmultiprocessor interconnection networks; parallel architectures; resource allocation;graph theory; task allocation; star graph; processor interconnection; special subgraphs;substars; topological features; star code; statically optimal; recognition ability; substarrecognition
S. Latifi, "Task Allocation in the Star Graph," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 1220-1224, 1994.