Referenced Items are not available for this document.
In this paper, we propose a new presentation of graphs, called the index-permutation (IP) graph model, and apply it to the systematic development of communication-efficient interconnection networks. We derive several new classes of interconnection networks based on IP graphs to achieve the desired properties. We show that the diameters of some classes of IP graphs are optimal within a factor of 1+0(1) given their node degrees. Designs based on IP graphs can balance system resources by appropriately selecting network parameters, thus providing adaptability to future technology and application requirements
Published in:
Parallel and Distributed Systems, 1998. Proceedings. 1998 International Conference on
Date of Conference: 14-16 Dec 1998
- Page(s):
- 702 - 709
- Meeting Date :
- 14 Dec 1998-16 Dec 1998
- ISSN :
- 1521-9097
- Print ISBN:
- 0-8186-8603-0
- INSPEC Accession Number:
- 6135797
- Conference Location :
- Tainan
- Digital Object Identifier :
- 10.1109/ICPADS.1998.741158
- Product Type:
- Conference Publications
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.
