arrow
返回

The hyperstar interconnection network

delete1998-02-01
delete19
PRE
AI
K
Khaled Day
DOI:10.1006/jpdc.1997.1414delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper, a multiprocessor interconnection topology, the hyperstar, based on the Cartesian product elf star graphs is studied. The basic properties of the hyperstar are discussed and proved. This includes reduced degree and diameter, hierarchical structure, vertex symmetry, optimal routing, and shortest path characterization. The hyperstar is shown to l-le a member of the Cayley class of symmetric graphs. Embeddings of hypercubes, star graphs, and meshes are discussed. An optimal one-to-all broadcasting algorithm is obtained and analyzed. Some results on fault tolerance, parallel paths, Hamiltonian cycles, and VLSI layouts are obtained. Furthermore, a comparative study between the hyperstar and seven related networks is conducted. The comparison is based on scalability, broadcasting cost, link requirements, cost/performance ratio, and other static parameters such as degree, diameter, and average diameter. (C) 1998 Academic Press.
Keyword:
Cartesian product networks
embedding
interconnection networks
star graph

期刊

Journal of Parallel and Distributed Computing 封面图
Journal of Parallel and Distributed Computing
IF:
4
论文数:
3.8K
被引数:
4.8K

机构

暂无机构信息
引用论文

引用论文

Risk of Suicide Attempt in Patients With Recent Diagnosis of Mild Cognitive Impairment or Dementia
err2021-06-01
err0
errOAAI
errMia Maria Günak; Deborah E. Barnes; Kristine Yaffe; Yixia Li; Amy L. Byers
err分享
err收藏
Insulin Pump Therapy in Adolescents With Very Poor Glycemic Control During a 12-Month Cohort Trial
err2018-04-05
err0
errOAAI
errMartin de Bock; Jaimee Rossborough; Aris Siafarikas; Megan Evans; Helen Clapin; Grant Smith; Timothy Jones; Elizabeth Davis
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
学者 查看更多内容