Combinatorial model of the class of rearrangeable nonsymmetric interconnection networks

Simple item page
dc.contributor.authorBashirov, R
dc.date.accessioned2026-02-06T18:28:58Z
dc.date.issued2000
dc.departmentDoğu Akdeniz Üniversitesi
dc.descriptionInternational Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2000) -- JUN 26-29, 2000 -- LAS VEGAS, NV
dc.description.abstractThe rearrangeability of (2s-1)-stage nonsymmetric interconnection networks is proved. This result is used to show that two passes through some s-stsge networks, (2log(n)N-1)-stage nonsymmetric networks employing uniform connection pattern, and 2log(n)N-1 circulations through single-stage networks are rearrangeable.
dc.description.sponsorshipComp Sci Res, Educ & Applicat Press,Informat Processing Soc Japan,SIGMPS,Int Technol Inst,Java High Performance Comp Res Grp,Korea Informat Processing Soc,World Sci & Engn Soc
dc.identifier.endpage897
dc.identifier.isbn1-892512-52-1
dc.identifier.scopusqualityN/A
dc.identifier.startpage891
dc.identifier.urihttps://hdl.handle.net/11129/11206
dc.identifier.wosWOS:000167676300122
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.language.isoen
dc.publisherC S R E A Press
dc.relation.ispartofProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Vols I-V
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectinterconnection network
dc.subjectrearrangeability
dc.subjectnonsymmetric
dc.subjectmultistage
dc.subjectsingle-stage
dc.titleCombinatorial model of the class of rearrangeable nonsymmetric interconnection networks
dc.typeConference Object

Files

Collections

WoS Indexed Publications Collection