DAIS - Digital Archive of the Serbian Academy of Sciences and Arts
    • English
    • Српски
    • Српски (Serbia)
  • English 
    • English
    • Serbian (Cyrillic)
    • Serbian (Latin)
  • Login
View Item 
  •   DAIS
  • Математички институт САНУ / Mathematical Institute of SASA
  • Glavna kolekcija
  • View Item
  •   DAIS
  • Математички институт САНУ / Mathematical Institute of SASA
  • Glavna kolekcija
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Some new models for multiprocessor interconnection networks

Thumbnail
2016
MI_rad.pdf (512.0Kb)
Authors
Cvetković, Dragoš
Davidović, Tatjana
Jovanović, Irena M.
Article (Published version)
BY-NC-CA
Metadata
Show full item record
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.
Keywords:
Spectra of graphs / Tightness / Interconnection networks / Graph operation
Source:
Yugoslav Journal of Operations Research, 2016, 26, 4, 423-439
Funding / projects:
  • Optoelectronics nanodimension systems - the rout towards applications (RS-45003)
  • Methods of Functional and Harmonic Analysis and PDE with Singularities (RS-174024)
  • Graph theory and mathematical programming with applications in chemistry and computer science (RS-174033)

DOI: 10.2298/YJOR160315020C

ISSN: 2334-6043; 0354-0243

Scopus: 2-s2.0-85009726354
[ Google Scholar ]
1
Handle
https://hdl.handle.net/21.15107/rcub_dais_947
URI
https://dais.sanu.ac.rs/123456789/947
Collections
  • Glavna kolekcija
Institution/Community
Математички институт САНУ / Mathematical Institute of SASA
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 .

DSpace software copyright © 2002-2015  DuraSpace
About DAIS - Digital Archive of the Serbian Academy of Sciences and Arts | Send Feedback

CoreTrustSealre3dataOpenAIRERCUB
 

 

All of DSpaceInstitutions/communitiesAuthorsTitlesSubjectsThis institutionAuthorsTitlesSubjects

Statistics

View Usage Statistics

DSpace software copyright © 2002-2015  DuraSpace
About DAIS - Digital Archive of the Serbian Academy of Sciences and Arts | Send Feedback

CoreTrustSealre3dataOpenAIRERCUB