Multiprocessor interconnection networks

MaRDI QIDQ3070761zbMATH OpenFDO

Authors Tatjana Davidović, Dragoš Cvetković

Publication date 26 January 2011

zbMATH Keywords

graphs with small tightnessinterconnection networksload balancing problemminimal tightness

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Recommendations

• Multiprocessor interconnection networks
• MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS
• Exhaustive search for multiprocessor interconnection networks with small tightness value
• Application of some graph invariants to the analysis of multiprocessor interconnection networks
• Well-suited multiprocessor topologies with small number of processors

Cited in

(12)

• Lower bounds on communication overlap of networks
• Multiprocessor interconnection networks
• Well-suited multiprocessor topologies with small number of processors
• Exhaustive search for multiprocessor interconnection networks with small tightness value
• MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS
• Application of some graph invariants to the analysis of multiprocessor interconnection networks
• scientific article; zbMATH DE number 4010561 (Why is no real title available?)
• scientific article; zbMATH DE number 4043770 (Why is no real title available?)
• scientific article; zbMATH DE number 1151834 (Why is no real title available?)
• Some new models for multiprocessor interconnection networks
• Graphs for small multiprocessor interconnection networks
• Per-spectral characterizations of bicyclic networks

This page was built for publication: Multiprocessor interconnection networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070761)