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 e cient 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.
TY - JOUR
AU - Cvetković, Dragoš
AU - Davidović, Tatjana
AU - Jovanović, Irena M.
PY - 2016
UR - https://dais.sanu.ac.rs/123456789/947
AB - 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 e cient 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.
T2 - Yugoslav Journal of Operations Research
T1 - Some new models for multiprocessor interconnection networks
SP - 423
EP - 439
VL - 26
IS - 4
DO - 10.2298/YJOR160315020C
UR - https://hdl.handle.net/21.15107/rcub_dais_947
ER -
@article{
author = "Cvetković, Dragoš and Davidović, Tatjana and Jovanović, Irena M.",
year = "2016",
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 e cient 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.",
journal = "Yugoslav Journal of Operations Research",
title = "Some new models for multiprocessor interconnection networks",
pages = "423-439",
volume = "26",
number = "4",
doi = "10.2298/YJOR160315020C",
url = "https://hdl.handle.net/21.15107/rcub_dais_947"
}
Cvetković, D., Davidović, T.,& Jovanović, I. M.. (2016). Some new models for multiprocessor interconnection networks. in Yugoslav Journal of Operations Research, 26(4), 423-439.
https://doi.org/10.2298/YJOR160315020C
https://hdl.handle.net/21.15107/rcub_dais_947
Cvetković D, Davidović T, Jovanović IM. Some new models for multiprocessor interconnection networks. in Yugoslav Journal of Operations Research. 2016;26(4):423-439.
doi:10.2298/YJOR160315020C
https://hdl.handle.net/21.15107/rcub_dais_947 .
Cvetković, Dragoš, Davidović, Tatjana, Jovanović, Irena M., "Some new models for multiprocessor interconnection networks" in Yugoslav Journal of Operations Research, 26, no. 4 (2016):423-439,
https://doi.org/10.2298/YJOR160315020C .,
https://hdl.handle.net/21.15107/rcub_dais_947 .
