loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97)
Processor Allocation in the Star Graph Using Sg-lattice Model
Taipei, Taiwan
December 18-December 20
ISBN: 0-8186-8259-0
Fan Wu, National Taiwan University, Taipei, Taiwan
Ching-Chi Hsu, National Taiwan University, Taipei, Taiwan
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.
Citation:
Fan Wu, Ching-Chi Hsu, "Processor Allocation in the Star Graph Using Sg-lattice Model," ispan, pp.310, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.