### Abstract

A class of incrementally expandable interconnection networks with high connectivity and low diameter is introduced for massively parallel and distributed processing. This class of networks can be constructed for any number of computing nodes, and the network size can easily be incremented without a major reconfiguration of the network. The connectivity and the diameter of the network are on the order of the logarithm of the number of nodes. It is shown that the connectivity of the network is equal to the minimum node degree. In this sense the connectivity is optimal. The routing algorithms for the network are simple to implement.

Original language | English (US) |
---|---|

Title of host publication | Proc 3 Symp Front Massively Parallel Comput Frontiers 90 |

Publisher | Publ by IEEE |

Pages | 384-387 |

Number of pages | 4 |

ISBN (Print) | 0818620536 |

State | Published - Dec 1 1990 |

Event | Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation - Frontiers '90 - College Park, MD, USA Duration: Oct 8 1990 → Oct 10 1990 |

### Publication series

Name | Proc 3 Symp Front Massively Parallel Comput Frontiers 90 |
---|

### Other

Other | Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation - Frontiers '90 |
---|---|

City | College Park, MD, USA |

Period | 10/8/90 → 10/10/90 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Proc 3 Symp Front Massively Parallel Comput Frontiers 90*(pp. 384-387). (Proc 3 Symp Front Massively Parallel Comput Frontiers 90). Publ by IEEE.