{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:51:37Z","timestamp":1730281897370,"version":"3.28.0"},"reference-count":51,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/memcod.2018.8556886","type":"proceedings-article","created":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T00:57:30Z","timestamp":1544144250000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Self-Routing Split Modules for Radix-based Interconnection Networks"],"prefix":"10.1109","author":[{"given":"Tripti","family":"Jain","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0743-7315(85)90037-1","article-title":"Equivalence relations among interconnection networks","volume":"2","author":"oru\u00e7","year":"1985","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.1994.580197"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90023-I"},{"key":"ref32","volume":"3","author":"knuth","year":"1969","journal-title":"The Art of Computer Programming Vol 3 Sorting and Searching"},{"key":"ref31","article-title":"Evolution of non-deterministic incremental algorithms as a new approach for search in state spaces","author":"juill\u00e9","year":"1995","journal-title":"International Conference on Genetic Algorithms"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ReCoSoC.2018.8449372"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675960"},{"key":"ref36","first-page":"71","article-title":"Synthesis of parallel sorting networks using SAT solvers","author":"morgenstern","year":"2011","journal-title":"Methoden und Beschreibungssprachen Zur Modellierung und Verifikation Von Schaltungen und Systemen (MBMV)"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1109\/71.372780","article-title":"A fast parallel algorithm for routing unicast assignments in Beneš networks","volume":"6","author":"lee","year":"1995","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224157"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626418500019"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MEMCOD.2016.7797744"},{"key":"ref29","article-title":"Routing partial permutations in general interconnection networks based on radix sorting","author":"jain","year":"2018","journal-title":"Methoden und Beschreibungssprachen Zur Modellierung und Verifikation Von Schaltungen und Systemen (MBMV)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.09.004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579338"},{"journal-title":"Principles and Practices of Interconnection Networks","year":"2004","author":"dally","key":"ref20"},{"key":"ref22","first-page":"167","article-title":"New bounds on optimal sorting networks","volume":"9136","author":"ehlers","year":"2015","journal-title":"Conference on Computability in Europe (CiE)"},{"journal-title":"Faster sorting networks for 17 19 and 20 inputs","year":"2014","author":"ehlers","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/C-M.1981.220290"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/RECONFIG.2017.8279784"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3139540.3139546"},{"journal-title":"The Complexity of Boolean Functions","year":"1987","author":"wegener","key":"ref50"},{"key":"ref51","first-page":"694","article-title":"On a class of multistage interconnection networks","volume":"29","author":"wu","year":"1980","journal-title":"IEEE Transactions on Computers (T-C)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2014.36"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2015.11.014"},{"journal-title":"Parallel Complexity Theory Research Notes in Theoretical Computer Science","year":"1987","author":"parberry","key":"ref40"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/12.509917"},{"key":"ref14","first-page":"327","article-title":"Isomorphism, normalization, and a genetic algorithm for sorting network optimization","author":"choi","year":"2002","journal-title":"Genetic and Evolutionary Computation Conference (GECCO)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/26.328986"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1953.tb01433.x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15579-1_52"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-017-9405-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61660-5_25"},{"key":"ref4","first-page":"307","article-title":"Sorting networks and their applications","volume":"32","author":"batcher","year":"1968","journal-title":"AFIPS Spring Joint Computer Conference"},{"journal-title":"A 12-step sorting network for 22 elements","year":"2008","author":"al-haj baddar","key":"ref3"},{"journal-title":"Equivalence of seven major theorems in combinatorics","year":"2004","author":"borgersen","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1964.tb04103.x"},{"journal-title":"Sorting networks to the end and back again","year":"2015","author":"codish","key":"ref8"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-3-319-04921-2_19","article-title":"Optimal sorting networks","volume":"8370","author":"bundala","year":"2014","journal-title":"Language and Automata Theory and Applications (LATA)"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"ref9","article-title":"Sorting networks: To the end and back again","author":"codish","year":"2018","journal-title":"Journal of Computer and System Sciences (JCSS)"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9025-6"},{"journal-title":"Verbindungsnetze –Strukturen und Eigenschaften","year":"1996","author":"schwederski","key":"ref45"},{"key":"ref48","first-page":"303","article-title":"Using symmetry and evolutionary search to minimize sorting networks","volume":"14","author":"valsalam","year":"2013","journal-title":"Journal of Machine Learning Research"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675014"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/BF02090393"},{"key":"ref41","first-page":"152","article-title":"A computer assisted optimal depth lower bound for sorting networks with nine inputs","author":"parberry","year":"1989","journal-title":"Supercomputing"},{"journal-title":"Models of Computation–Exploring the Power of Computing","year":"1998","author":"savage","key":"ref44"},{"journal-title":"Improved sorting networks with O(log(n)) depth","year":"1987","author":"paterson","key":"ref43"}],"event":{"name":"2018 16th ACM\/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","start":{"date-parts":[[2018,10,15]]},"location":"Beijing, China","end":{"date-parts":[[2018,10,18]]}},"container-title":["2018 16th ACM\/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8536775\/8556861\/08556886.pdf?arnumber=8556886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T02:37:02Z","timestamp":1643251022000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8556886\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/memcod.2018.8556886","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}