Abstract
The reasons that have not allowed the proper implementation of star graph topology are discussed. The star graph and the interconnection topology , the hypercube, are compared. The efficiency of various communication schemes on star networks, including point to point routing, multicasting, and broadcasting, is evaluated. It is found that the major disadvantages of star graph topology are poor scalability, cumbersome routing, expensive VLSI layouts, and unsuitability for matrix-based computations.
| Original language | English |
|---|---|
| Pages | 119-122 |
| Number of pages | 4 |
| Publication status | Published - 1998 |
| Event | 4th International Conference on Computer Science and Informatics, JCIS 1998, 1st International Workshop on High Performance, 1st International Workshop on Computer Vision, Pattern Recognition and Image Processing Volume 4 - Research Triangle Park, NC, United States Duration: Oct 23 1998 → Oct 28 1998 |
Other
| Other | 4th International Conference on Computer Science and Informatics, JCIS 1998, 1st International Workshop on High Performance, 1st International Workshop on Computer Vision, Pattern Recognition and Image Processing Volume 4 |
|---|---|
| Country/Territory | United States |
| City | Research Triangle Park, NC |
| Period | 10/23/98 → 10/28/98 |
ASJC Scopus subject areas
- Computer Science(all)