{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T17:11:56Z","timestamp":1718039516067},"reference-count":32,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T00:00:00Z","timestamp":1503446400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2017,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>One promising trend in digital system integration consists of boosting on-chip communication performance by means of silicon photonics, thus materializing the so-called Optical Networks-on-Chip. Among them, wavelength routing can be used to route a signal to destination by univocally associating a routing path to the wavelength of the optical carrier. Such wavelengths should be chosen so to minimize interferences among optical channels and to avoid routing faults. As a result, physical parameter selection of such networks requires the solution of complex constrained optimization problems. In previous work, published in the proceedings of the International Conference on Computer-Aided Design, we proposed and solved the problem of computing the maximum parallelism obtainable in the communication between any two endpoints while avoiding misrouting of optical signals. The underlying technology, only quickly mentioned in that paper, is Answer Set Programming. In this work, we detail the Answer Set Programming approach we used to solve such problem.<\/jats:p><jats:p>Another important design issue is to select the wavelengths of optical carriers such that they are spread across the available spectrum, in order to reduce the likelihood that, due to imperfections in the manufacturing process, unintended routing faults arise. We show how to address such problem in Constraint Logic Programming on Finite Domains.<\/jats:p>","DOI":"10.1017\/s1471068417000424","type":"journal-article","created":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T07:07:51Z","timestamp":1503472071000},"page":"800-818","source":"Crossref","is-referenced-by-count":2,"title":["Logic programming approaches for routing fault-free and maximally parallel wavelength-routed optical networks-on-chip (Application paper)"],"prefix":"10.1017","volume":"17","author":[{"given":"MARCO","family":"GAVANELLI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MADDALENA","family":"NONATO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANDREA","family":"PEANO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVIDE","family":"BERTOZZI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"key":"S1471068417000424_ref22","doi-asserted-by":"crossref","unstructured":"Parini A. , Ramini L. , Bellanca G. and Bertozzi D. 2011. Abstract modelling of switching elements for optical networks-on-chip with technology platform awareness. In Proc. of the 5th International Workshop on Interconnection Network Architecture: On-Chip, Multi-Chip, INA-OCMC '11. ACM, New York, NY, USA, 31\u201334.","DOI":"10.1145\/1930037.1930046"},{"key":"S1471068417000424_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9116-y"},{"key":"S1471068417000424_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"#cr-split#-S1471068417000424_ref31.1","unstructured":"2. Zhou N.-F. 2009. Encoding table constraints in CLP"},{"key":"#cr-split#-S1471068417000424_ref31.2","unstructured":"3. (FD) based on pair-wise AC. In Proc. of Logic Programming, 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009, P. M. Hill and D. S. Warren, Eds. Lecture Notes in Computer Science, vol. 5649. Springer, 402-416."},{"key":"S1471068417000424_ref18","unstructured":"Liu G. , Janhunen T. and Niemel\u00e4 I. 2012. Answer set programming via mixed integer programming. In Principles of Knowledge Representation and Reasoning: Proc. of the 13th International Conference, KR 2012, Rome, Italy, June 10\u201314, 2012, G. Brewka , T. Eiter and S. A. McIlraith , Eds. AAAI Press."},{"key":"S1471068417000424_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9033-2"},{"key":"S1471068417000424_ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000469"},{"key":"S1471068417000424_ref23","unstructured":"Peano A. , Ramini L. , Gavanelli M. , Nonato M. and Bertozzi D. 2016. Design technology for fault-free and maximally-parallel wavelength-routed optical networks-on-chip. In Proc. of ICCAD'16, the 35th IEEE\/ACM International Conference on Computer-Aided Design, Austin, Texas. IEEE\/ACM, 3:1\u20133:8. http:\/\/doi.acm.org\/10.1145\/2966986.2967023."},{"key":"S1471068417000424_ref13","unstructured":"Janhunen T. , Liu G. and Niemel\u00e4 I. 2011. Tight integration of non-ground answer set programming and satisfiability modulo theories. In Proc. of Working Notes of the 1st Workshop on Grounding and Transformations for Theories with Variables. Vancouver, BC, Canada, 1\u201313."},{"key":"S1471068417000424_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000220"},{"key":"S1471068417000424_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"S1471068417000424_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"S1471068417000424_ref9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","article-title":"Potassco: The potsdam answer set solving collection","volume":"24","author":"Gebser","year":"2011","journal-title":"AI Communications"},{"key":"S1471068417000424_ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2008.923609"},{"key":"S1471068417000424_ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2008.2010462"},{"key":"S1471068417000424_ref15","doi-asserted-by":"crossref","unstructured":"Koohi S. , Abdollahi M. and Hessabi S. 2011. All-optical wavelength-routed NoC based on a novel hierarchical topology. In Proc. of the 5th ACM\/IEEE International Symposium, 97\u2013104.","DOI":"10.1145\/1999946.1999962"},{"key":"S1471068417000424_ref8","doi-asserted-by":"crossref","unstructured":"Gebser M. , Kaminski R. , Ostrowski M. , Schaub T. and Thiele S. 2009. On the input language of ASP grounder Gringo. In LPNMR, E. Erdem , F. Lin and T. Schaub , Eds. Lecture Notes in Computer Science, vol. 5753. Springer, 502\u2013508.","DOI":"10.1007\/978-3-642-04238-6_49"},{"key":"S1471068417000424_ref4","doi-asserted-by":"publisher","DOI":"10.1002\/lpor.201100017"},{"key":"S1471068417000424_ref2","unstructured":"Bartholomew M. and Lee J. 2014. System aspmt2smt: Computing ASPMT theories by SMT solvers. In Proc. of Logics in Artificial Intelligence - 14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, September 24\u201326, 2014, E. Ferm\u00e9 and J. Leite , Eds. Lecture Notes in Computer Science, vol. 8761. Springer, 529\u2013542."},{"key":"S1471068417000424_ref1","doi-asserted-by":"crossref","unstructured":"Balduccini M. and Lierler Y. 2012. Practical and methodological aspects of the use of cutting-edge ASP tools. In Proc. of Practical Aspects of Declarative Languages - 14th International Symposium, PADL 2012 Philadelphia, PA, USA, January 23\u201324, 2012, C. V. Russo and N. Zhou , Eds. Lecture Notes in Computer Science, vol. 7149. Springer, 78\u201392.","DOI":"10.1007\/978-3-642-27694-1_7"},{"key":"S1471068417000424_ref5","unstructured":"Bri\u00e8re M. , Girodias B. , Bouchebaba Y. , Nicolescu G. , Mieyeville F. , Gaffiot F. and O'Connor I. 2007. System level assessment of an optical NoC in an MPSoC platform. In Proc. of Design, Automation Test in Europe Conference Exhibition. IEEE, 1\u20136."},{"key":"S1471068417000424_ref16","first-page":"499","article-title":"The DLV system for knowledge representation and reasoning","volume":"7","author":"Leone","year":"2006","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"S1471068417000424_ref24","unstructured":"R\u00e9gin J. 1994. A filtering algorithm for constraints of difference in CSPs. In Proc. of 12th National Conference on Artificial Intelligence, B. Hayes-Roth and R. E. Korf , Eds. AAAI Press\/The MIT Press, 362\u2013367."},{"key":"S1471068417000424_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8"},{"key":"S1471068417000424_ref30","unstructured":"Wittocx J. , Marien M. and Denecker M. 2008. The IDP system: A model expansion system for an extension of classical logic. In Proc. of Workshop on Logic and Search, Computation of Structures from Declarative Descriptions (LaSh), 153\u2013165."},{"key":"S1471068417000424_ref21","doi-asserted-by":"crossref","unstructured":"Nonato M. , Bertozzi D. , Gavanelli M. and Peano A. 2017. A network model for routing-fault-free wavelength selection in WRONoCs design. In Proc. of International Network Optimization Conference 2017. Electronic Notes in Discrete Mathematics.","DOI":"10.1016\/j.endm.2018.02.003"},{"key":"S1471068417000424_ref6","doi-asserted-by":"publisher","DOI":"10.1109\/26.153361"},{"key":"S1471068417000424_ref29","unstructured":"Van Hentenryck P. and Carillon J. 1988. Generality versus specificity: An experience with AI and OR techniques. In Proc. 7th National Conference on Artificial Intelligence, H. E. Shrobe , T. M. Mitchell , and R. G. Smith , Eds. AAAI Press\/The MIT Press, 660\u2013664."},{"key":"S1471068417000424_ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2011.2178019"},{"key":"S1471068417000424_ref10","unstructured":"Gelfond M. and Lifschitz V. 1988. The stable model semantics for logic programming. In Proceedings of International Logic Programming Conference and Symposium, R. Kowalski , Bowen and Kenneth , Eds. MIT Press, 1070\u20131080."},{"key":"S1471068417000424_ref27","unstructured":"Susman B. and Lierler Y. 2016. SMT-based constraint answer set solver EZSMT (system description). In Proc. of Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016 TCs October 16\u201321, 2016, New York City, USA, M. Carro , A. King , N. Saeedloei and M. De Vos , Eds. OASICS, vol. 52. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 1:1\u20131:15."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068417000424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T02:32:50Z","timestamp":1602815570000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068417000424\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,23]]},"references-count":32,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["S1471068417000424"],"URL":"https:\/\/doi.org\/10.1017\/s1471068417000424","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,23]]}}}