Skip to content

Project for Combinatorial Decision Making and Optimization at UniBo

Notifications You must be signed in to change notification settings

LeonidasY/vlsi-design

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

79 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

CDMO Project (VLSI Design)

Overview

The CDMO project involves the solving of a VLSI (Very Large Scale Integration) problem using (i) Constraint Programming (CP), and (ii) propositional SATisfiability (SAT) and/or its extension to Satisfiability Modulo Theories (SMT). VLSI refers to the trend of integrating circuits into silicon chips.

Authors

  • Leonidas Gee
  • Anna Fabris

Dataset

The dataset consist of 40 VLSI instances, where each instance is a text file containing the following:

  • The first line gives w, which is the width of the silicon plate.
  • The following line gives n, which is the number of necessary circuits to place inside the plate.
  • Then n lines follow, each with xi and yi , representing the horizontal and vertical dimensions of the i-th circuit.

Methodologies

The steps taken for each method are described in a series of reports as follows:

Results

The images below show the visualisations of different solved instances using either CP, SAT or SMT.

About

Project for Combinatorial Decision Making and Optimization at UniBo

Resources

Stars

Watchers

Forks

Languages