Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-29T02:47:53.441Z Has data issue: false hasContentIssue false
  • English
  • Français

Logic programming approaches for routing fault-free and maximally parallel wavelength-routed optical networks-on-chip (Application paper)

Published online by Cambridge University Press:  23 August 2017

MARCO GAVANELLI ,
MADDALENA NONATO ,
ANDREA PEANO  and
DAVIDE BERTOZZI
MARCO GAVANELLI
Affiliation:
Department of Engineering, Ferrara University, Ferrara, Italy (e-mails: marco.gavanelli@unife.it, maddalena.nonato@unife.it)
MADDALENA NONATO
Affiliation:
Department of Engineering, Ferrara University, Ferrara, Italy (e-mails: marco.gavanelli@unife.it, maddalena.nonato@unife.it)
ANDREA PEANO
Affiliation:
QuanTek, Bologna, Italy (e-mail: andrea.peano@quantek.it)
DAVIDE BERTOZZI
Affiliation:
Department of Engineering, Ferrara University, Ferrara, Italy (e-mail: davide.bertozzi@unife.it)
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

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.

Keywords

Answer set programmingLogic programming applicationsOptical networks-on-chipConstrained optimizationConstraint logic programming on finite domains
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 17 , Special Issue 5-6: 33rd International Conference on Logic Programming , September 2017 , pp. 800 - 818
Copyright
Copyright © Cambridge University Press 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

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–24, 2012, Russo, C. V. and Zhou, N., Eds. Lecture Notes in Computer Science, vol. 7149. Springer, 78–92.Google Scholar
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–26, 2014, Fermé, E. and Leite, J., Eds. Lecture Notes in Computer Science, vol. 8761. Springer, 529–542.Google Scholar
Berthold, J., Saleh, A. A. M., Blair, L. and Simmons, J. M. 2008. Optical networking: Past, present, and future. Journal of Lightwave Technology 26, 9 (May), 1104–1118.CrossRefGoogle Scholar
Bogaerts, W., De Heyn, P., Van Vaerenbergh, T., De Vos, K., Selvaraja, S. K., Claes, T., Dumon, P., Bienstman, P., Van Thourhout, D. and Baets, R. 2012. Silicon microring resonators. Laser Photonics Reviews 6, 1, 47–73.CrossRefGoogle Scholar
Brière, 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–6.Google Scholar
Chlamtac, I., Ganz, A. and Karmi, G. 1992. Lightpath communications: An approach to high bandwidth optical WAN's. IEEE Transactions on Communications 40, 7 (Jul), 1171–1182.Google Scholar
Drescher, C. and Walsh, T. 2010. A translational approach to constraint answer set solving. Theory and Practice of Logic Programming 10, 4–6, 465–480.CrossRefGoogle Scholar
Gebser, M., Kaminski, R., Ostrowski, M., Schaub, T. and Thiele, S. 2009. On the input language of ASP grounder Gringo. In LPNMR, Erdem, E., Lin, F. and Schaub, T., Eds. Lecture Notes in Computer Science, vol. 5753. Springer, 502–508.Google Scholar
Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T. and Schneider, M. 2011. Potassco: The potsdam answer set solving collection. AI Communications 24, 2, 107–124.CrossRefGoogle Scholar
Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of International Logic Programming Conference and Symposium, Kowalski, R., Bowen, and Kenneth, , Eds. MIT Press, 1070–1080.Google Scholar
Giunchiglia, E., Lierler, Y. and Maratea, M. 2006. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36, 4, 345–377.Google Scholar
Jaffar, J. and Maher, M. J. 1994. Constraint logic programming: A survey. Journal of Logic and Algebraic Programming 19/20, 503–581.Google Scholar
Janhunen, T., Liu, G. and Niemelä, 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–13.Google Scholar
Kaźmierczak, A., Bogaerts, W., Drouard, E., Dortu, F., Rojo-Romeo, P., Gaffiot, F., Van Thourhout, D. and Giannone, D. 2009. Highly integrated optical 4 × 4 crossbar in silicon-on-insulator technology. Journal of Lightwave Technology 27, 16 (August), 3317–3323.CrossRefGoogle Scholar
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–104.Google Scholar
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S. and Scarcello, F. 2006. The DLV system for knowledge representation and reasoning. Journal of Logic and Algebraic Programming 7, 3, 499–562.Google Scholar
Lin, F. and Zhao, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157, 1–2, 115–137.Google Scholar
Liu, G., Janhunen, T. and Niemelä, 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–14, 2012, Brewka, G., Eiter, T. and McIlraith, S. A., Eds. AAAI Press.Google Scholar
Lloyd, J. W. 1987. Foundations of Logic Programming, 2nd ed. Springer.CrossRefGoogle Scholar
Mellarkod, V. S., Gelfond, M. and Zhang, Y. 2008. Integrating answer set programming and constraint logic programming. Annals of Mathematics and Artificial Intelligence 53, 1–4, 251–287.Google Scholar
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.CrossRefGoogle Scholar
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–34.Google Scholar
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–3:8. http://doi.acm.org/10.1145/2966986.2967023.Google Scholar
Régin, J. 1994. A filtering algorithm for constraints of difference in CSPs. In Proc. of 12th National Conference on Artificial Intelligence, Hayes-Roth, B. and Korf, R. E., Eds. AAAI Press/The MIT Press, 362–367.Google Scholar
Schimpf, J. and Shen, K. 2012. Eclipse - from LP to CLP. Theory and Practice of Logic Programming 12, 1–2, 127–156.Google Scholar
Simons, P., Niemelä, I. and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138, 1–2 (June), 181–234.CrossRefGoogle Scholar
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–21, 2016, New York City, USA, Carro, M., King, A., Saeedloei, N. and De Vos, M., Eds. OASICS, vol. 52. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 1:1–1:15.Google Scholar
Tan, X., Yang, M., Zhang, L., Jiang, Y. and Yang, J. 2012. A generic optical router design for photonic network-on-chips. Journal of Lightwave Technology 30, 3 (Feb), 368–376.CrossRefGoogle Scholar
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, Shrobe, H. E., Mitchell, T. M., and Smith, R. G., Eds. AAAI Press/The MIT Press, 660–664.Google Scholar
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–165.Google Scholar
Zhou, N.-F. 2009. Encoding table constraints in CLP(FD) based on pair-wise AC. In Proc. of Logic Programming, 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14–17, 2009, Hill, P. M. and Warren, D. S., Eds. Lecture Notes in Computer Science, vol. 5649. Springer, 402–416.Google Scholar