Processor allocation in the star graph using Sg-lattice model
Fan Wu, Ching‐Chi Hsu · 2002
The star graph has been known as an attractive alternative to the hypercube multiprocessor. When tasks arrive at the star graph, the tasks should be assigned appropriate free processors before execution. A new model, called Star graph (Sg)-lattice, is proposed to model the construction and free configuration of the star graph. Based on this model, the Sg-lattice scheme can fully recognizes the substars. Finally, mathematical analyses and simulation results show that the Sg-lattice scheme outperforms the previous work in storage and time complexities and the average allocation time.