Author:
GAVANELLI MARCO,NONATO MADDALENA,PEANO ANDREA,BERTOZZI DAVIDE
Abstract
AbstractOne 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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference32 articles.
1. 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.
2. Integrating answer set programming and constraint logic programming
3. ASSAT: computing answer sets of a logic program by SAT solvers
4. 2. Zhou N.-F. 2009. Encoding table constraints in CLP
5. 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.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献