vix.ing · top · new · best · stats · spec

Logic Programming approaches for routing fault-free and\n maximally-parallel Wavelength Routed Optical Networks on Chip (Application\n paper)

2017/07/18 by Marco Gavanelli, Gavanelli, Marco, Maddalena Nonato +5 · 1 citation
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems

paper · pdf · doi:10.48550/arxiv.1707.05858

openalex publication_date 2017/07/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

One promising trend in digital system integration consists of boosting\non-chip communication performance by means of silicon photonics, thus\nmaterializing the so-called Optical Networks-on-Chip (ONoCs). Among them,\nwavelength routing can be used to route a signal to destination by univocally\nassociating a routing path to the wavelength of the optical carrier. Such\nwavelengths should be chosen so to minimize interferences among optical\nchannels and to avoid routing faults. As a result, physical parameter selection\nof such networks requires the solution of complex constrained optimization\nproblems. In previous work, published in the proceedings of the International\nConference on Computer-Aided Design, we proposed and solved the problem of\ncomputing the maximum parallelism obtainable in the communication between any\ntwo endpoints while avoiding misrouting of optical signals. The underlying\ntechnology, only quickly mentioned in that paper, is Answer Set Programming\n(ASP). In this work, we detail the ASP approach we used to solve such problem.\n Another important design issue is to select the wavelengths of optical\ncarriers such that they are spread across the available spectrum, in order to\nreduce the likelihood that, due to imperfections in the manufacturing process,\nunintended routing faults arise. We show how to address such problem in\nConstraint Logic Programming on Finite Domains (CLP(FD)).\n This paper is under consideration for possible publication on Theory and\nPractice of Logic Programming.\n

Cited by

Related