Referenced Items are not available for this document.
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
Published in:
Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on
Date of Conference: 18-20 Dec 1997
- Page(s):
- 310 - 316
- Meeting Date :
- 18 Dec 1997-20 Dec 1997
- ISSN :
- 1087-4089
- Print ISBN:
- 0-8186-8259-6
- INSPEC Accession Number:
- 5816507
- Conference Location :
- Taipei
- Digital Object Identifier :
- 10.1109/ISPAN.1997.645113
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
