DocumentCode :
610150
Title :
Dijkstra´s algorithm for cyber structures analysis
Author :
Svetlana, C. ; Alexander, G. ; Ihor, C. ; Dmytriy, S.
Author_Institution :
Design Autom. Dept., Kharkov Nat. Univ. of Radioelectron., Kharkov, Ukraine
fYear :
2013
fDate :
19-23 Feb. 2013
Firstpage :
61
Lastpage :
65
Abstract :
A modified Dijkstra´s algorithm to determine the average cost of interconnections in computing architecture for every pair of nodes is proposed. Verification of the criterion, when evaluating the effectiveness of different topologies of computational structures is performed.
Keywords :
graph theory; multiprocessor interconnection networks; parallel processing; Dijkstra algorithm; average interconnection cost; computational structure topology; computing architecture; criterion verification; cyber structures analysis; parallel processing; Algorithm design and analysis; Arrays; Computers; Digital systems; Estimation; Joining processes; Topology; Dijkstra´s algorithm; computer structures; topology of digital system components;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Experience of Designing and Application of CAD Systems in Microelectronics (CADSM), 2013 12th International Conference on the
Conference_Location :
Polyana Svalyava
Print_ISBN :
978-1-4673-6461-4
Type :
conf
Filename :
6543192
Link To Document :
بازگشت