WRONoC

This page provides instances for two WRONoC problems.

Maximizing parallelism

To solve the problem:

clingo maxbottomparallelism.asp (instance file) -c k=4

where the value of k is the number of devices nR.

Maximally spreading selected resonances (CLP(FD))

Requires ECLiPSe

MILP formulations

The following .zip file contains two MILP formulations (see included README file): MILP formulations for both problems

  • maxpkmilp.py is the maximization of the parallelism (problem published in Andrea Peano, Luca Ramini, Marco Gavanelli, Maddalena Nonato, Davide Bertozzi: Design technology for fault-free and maximally-parallel wavelength-routed optical networks-on-chip. Proceedings of the 35th International Conference on Computer-Aided Design, ICCAD 2016, Austin, TX, USA, November 7-10, 2016.)
  • maxdistmilp.py is the maximization of the distance between selected resonances (published in Nonato, M., Bertozzi, D., Gavanelli, M., and Peano, A. 2017. A network model for routing-fault-free wavelength selection in WRONoCs design. In International Network Optimization Conference 2017. To appear on Electronic Notes in Discrete Mathematics).

Requires Python and Gurobi.