Referenced Items are not available for this document.
Trees are a common structure to represent the inter-task communication pattern of a parallel algorithm. In this paper, we consider the problem of embedding a complete binary tree in a star graph with the objective of minimizing congestion and dilation. We develop a congestion-free, dilation-2, load-1 embedding of a level-p binary tree into an n-dimensional star graph, where p=Σi=2n [log i] and k is any positive integer. The result offers a tree of size comparable or superior to existing results, but with less congestion and dilation
Published in:
Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on
Date of Conference: 10-12 Dec 1997
- Page(s):
- 331 - 344
- Meeting Date :
- 10 Dec 1997-12 Dec 1997
- Print ISBN:
- 0-7803-4229-1
- INSPEC Accession Number:
- 5842325
- Conference Location :
- Melbourne, Vic.
- Digital Object Identifier :
- 10.1109/ICAPP.1997.651502
- 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.
