|Title:||Some new models for multiprocessor interconnection networks||Journal:||Yugoslav Journal of Operations Research||Volume:||26||Issue:||4||First page:||423||Last page:||439||Issue Date:||1-Jan-2016||Rank:||M51||ISSN:||0354-0243||DOI:||10.2298/YJOR160315020C||Abstract:||
A multiprocessor system can be modeled by a graph G. The vertices of G correspond to processors while edges represent links between processors. To find suitable models for multiprocessor interconnection networks (briefly MINs), one can apply tools and techniques of spectral graph theory. In this paper, we extend some of the existing results and present several graphs which could serve as models for efficient MINs based on the small values of the previously introduced graph tightness. These examples of possible MINs arise as a result of some well-known and widely used graph operations. We also examine the suitability of strongly regular graphs (briefly SRGs) to model MINs, and prove the uniqueness of some of them.
|Keywords:||68M10 | Graph operation. MSC: 05C50 | Interconnection networks | Spectra of graphs | Tightness||Project:||Graph theory and mathematical programming with applications in chemistry and computer science
Methods of Functional and Harmonic Analysis and PDE with Singularities
Optoelectronics nanodimension systems ‚Äì the rout towards applications
Serbian Ministry for Education, Science and Technological Development, Grant no. F-159
Show full item record
checked on Nov 27, 2022
checked on Nov 28, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.