{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:44:27Z","timestamp":1726062267165},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030365912"},{"type":"electronic","value":"9783030365929"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36592-9_47","type":"book-chapter","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T06:02:43Z","timestamp":1575871363000},"page":"573-583","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extended Routing Table Generation Algorithm for the Angara Interconnect"],"prefix":"10.1007","author":[{"given":"Anatoly","family":"Mukosey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey","family":"Simonov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Semenov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,10]]},"reference":[{"issue":"2.3","key":"47_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1147\/rd.492.0265","volume":"49","author":"NR Adiga","year":"2005","unstructured":"Adiga, N.R., et al.: Blue Gene\/L torus interconnection network. IBM J. Res. Dev. 49(2.3), 265\u2013276 (2005)","journal-title":"IBM J. Res. Dev."},{"key":"47_CR2","unstructured":"Agarkov, A., Ismagilov, T., Makagon, D., Semenov, A., Simonov, A.: Performance evaluation of the Angara interconnect. In: Proceedings of the International Conference on Russian Supercomputing Days, Moscow, Russia, pp. 626\u2013639 (2016)"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Bulut, E., Geyik, S.C., Szymanski, B.K.: Conditional shortest path routing in delay tolerant networks. In: International Symposium on World of Wireless Mobile and Multimedia Networks (WoWMoM), pp. 1\u20136. IEEE (2010)","DOI":"10.1109\/WOWMOM.2010.5534960"},{"issue":"7","key":"47_CR4","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/71.877831","volume":"11","author":"GM Chiu","year":"2000","unstructured":"Chiu, G.M.: The odd-even turn model for adaptive routing. IEEE Trans. Parallel Distrib. Sys. 11(7), 729\u2013738 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Sys."},{"issue":"4","key":"47_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01660031","volume":"1","author":"WJ Dally","year":"1986","unstructured":"Dally, W.J., Seitz, C.L.: The torus routing chip. Distrib. Comput. 1(4), 187\u2013196 (1986)","journal-title":"Distrib. Comput."},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Dally, W.J., Seitz, C.L.: Deadlock-free message routing in multiprocessor interconnection networks (1988)","DOI":"10.1109\/TC.1987.1676939"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Domke, J., Hoefler, T., Matsuoka, S.: Routing on the dependency graph: a new approach to deadlock-free high-performance routing. In: Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing, pp. 3\u201314. ACM (2016)","DOI":"10.1145\/2907294.2907313"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 27\u201334. ACM (2003)","DOI":"10.1145\/863955.863960"},{"issue":"2","key":"47_CR9","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1145\/146628.140384","volume":"20","author":"CJ Glass","year":"1992","unstructured":"Glass, C.J., Ni, L.M.: The turn model for adaptive routing. ACM SIGARCH Comput. Archit. News 20(2), 278\u2013287 (1992)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"issue":"9","key":"47_CR10","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1134\/S1995080218090111","volume":"39","author":"M Khalilov","year":"2018","unstructured":"Khalilov, M., Timofeev, A.: Optimization of MPI-process mapping for clusters with Angara interconnect. Lobachevskii J. Math. 39(9), 1188\u20131198 (2018)","journal-title":"Lobachevskii J. Math."},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Kim, J.H., Liu, Z., Chien, A.A.: Compressionless routing: a framework for adaptive and fault-tolerant routing. In: ACM SIGARCH Computer Architecture News, vol. 22, pp. 289\u2013300. IEEE Computer Society Press (1994)","DOI":"10.1145\/192007.192050"},{"issue":"3","key":"47_CR12","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/292469.292472","volume":"30","author":"P Mohapatra","year":"1998","unstructured":"Mohapatra, P.: Wormhole routing techniques for directly connected multicomputer systems. ACM Comput. Surv. (CSUR) 30(3), 374\u2013410 (1998)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"1","key":"47_CR13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.26089\/NumMet.v18r105","volume":"18","author":"AV Mukosey","year":"2017","unstructured":"Mukosey, A.V., Semenov, A.S.: An approximate algorithm for choosing the optimal subset of nodes in the Angara interconnect with failures. Vychislitel\u2019nye Metody i Programmirovanie 18(1), 53\u201364 (2017)","journal-title":"Vychislitel\u2019nye Metody i Programmirovanie"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.diamond.2019.01.019","volume":"94","author":"G Ostroumova","year":"2019","unstructured":"Ostroumova, G., Orekhov, N., Stegailov, V.: Reactive molecular-dynamics study of onion-like carbon nanoparticle formation. Diam. Relat. Mater. 94, 14\u201320 (2019)","journal-title":"Diam. Relat. Mater."},{"issue":"3","key":"47_CR15","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1109\/TPDS.2008.106","volume":"20","author":"M Palesi","year":"2008","unstructured":"Palesi, M., Holsmark, R., Kumar, S., Catania, V.: Application specific routing algorithms for networks on chip. IEEE Trans. Parallel Distrib. Sys. 20(3), 316\u2013330 (2008)","journal-title":"IEEE Trans. Parallel Distrib. Sys."},{"issue":"9","key":"47_CR16","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1134\/S1995080218090160","volume":"39","author":"S Polyakov","year":"2018","unstructured":"Polyakov, S., Podryga, V., Puzyrkov, D.: High performance computing in multiscale problems of gas dynamics. Lobachevskii J. Math. 39(9), 1239\u20131250 (2018)","journal-title":"Lobachevskii J. Math."},{"key":"47_CR17","unstructured":"Puente, V., Beivide, R., Gregorio, J.A., Prellezo, J., Duato, J., Izu, C.: Adaptive bubble router: a design to improve performance in torus networks. In: Proceedings of the 1999 International Conference on Parallel Processing, pp. 58\u201367. IEEE (1999)"},{"key":"47_CR18","unstructured":"Scott, S.L., et al.: The Cray T3E network: adaptive routing in a high performance 3D torus (1996)"},{"issue":"1","key":"47_CR19","first-page":"21","volume":"15","author":"A Simonov","year":"2014","unstructured":"Simonov, A., Makagon, D., Zhabin, I., Shcherbak, A., Syromyatnikov, E., Polyakov, D.: Pervoye pokoleniye vysokoskorostnoy kommunikatsionnoy seti $$\\ll $$Angara$$\\gg $$ (the first generation of Angara high-speed interconnect). Naukoyemkiye tekhnologii (Sci. Technol.) 15(1), 21\u201328 (2014)","journal-title":"Naukoyemkiye tekhnologii (Sci. Technol.)"},{"key":"47_CR20","unstructured":"Skeie, T., Lysne, O., Theiss, I.: Layered shortest path (lash) routing in irregular system area networks. In: Proceedings of the 16th International Parallel and Distributed Processing Symposium, IPDPS 2002, pp. 194\u2013201. IEEE Computer Society, Washington, DC (2002). http:\/\/dl.acm.org\/citation.cfm?id=645610.661560"},{"key":"47_CR21","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1177\/1094342019826667","volume":"33","author":"V Stegailov","year":"2019","unstructured":"Stegailov, V., et al.: Angara interconnect makes GPU-based Desmos supercomputer an efficient tool for molecular dynamics calculations. Int. J. High Perform. Comput. Appl. 33, 507\u2013521 (2019)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"47_CR22","doi-asserted-by":"publisher","first-page":"e5136","DOI":"10.1002\/cpe.5136","volume":"31","author":"V Stegailov","year":"2019","unstructured":"Stegailov, V., Smirnov, G., Vecher, V.: VASP hits the memory wall: processors efficiency comparison. Concurrency Comput. Pract. Exp. 31, e5136 (2019). https:\/\/doi.org\/10.1002\/cpe.5136","journal-title":"Concurrency Comput. Pract. Exp."},{"issue":"4","key":"47_CR23","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1134\/S1995080218040145","volume":"39","author":"M Tolstykh","year":"2018","unstructured":"Tolstykh, M., Goyman, G., Fadeev, R., Shashkin, V.: Structure and algorithms of SLAV atmosphere model parallel program complex. Lobachevskii J. Math. 39(4), 587\u2013595 (2018)","journal-title":"Lobachevskii J. Math."}],"container-title":["Communications in Computer and Information Science","Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36592-9_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T23:27:17Z","timestamp":1665185237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36592-9_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030365912","9783030365929"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36592-9_47","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RuSCDays","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russian Supercomputing Days","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ruscdays2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/russianscdays.org\/en\/node\/1","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"127","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}