Parallel Architectures, Algorithms, and Networks, International Symposium on (1997)

Taipei, Taiwan

Dec. 18, 1997 to Dec. 20, 1997

ISSN: 1087-4089

ISBN: 0-8186-8259-0

pp: 310

Fan Wu , National Taiwan University, Taipei, Taiwan

Ching-Chi Hsu , National Taiwan University, Taipei, Taiwan

ABSTRACT

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. Index terms-- Allocation, star graph, first-fit, Sg-lattice, star code.

INDEX TERMS

CITATION

F. Wu and C. Hsu, "Processor Allocation in the Star Graph Using Sg-lattice Model,"

*Parallel Architectures, Algorithms, and Networks, International Symposium on(ISPAN)*, Taipei, Taiwan, 1997, pp. 310.

doi:10.1109/ISPAN.1997.645113

CITATIONS