Parallel GIA - Githubissues

TeamAmalgam / kodkod

Kodkod relational model finder

Other

3 stars 0 forks source link

Parallel GIA #14

Closed mhyee closed 10 years ago

mhyee commented 11 years ago

There are many possible ways of doing this. Since we want to experiment and try them out, create a new issue for each method.

Methods:

Bounded GIA (first step of Partitioned GIA): #25
Implement Solution Deduplicator (filter duplicate Pareto points and spawn new tasks for magnifying glass): #26
Finding the first Pareto point (requires Bounded GIA, first step of Partitioned GIA): #29
Partitioning the search space: #32

mhyee commented 10 years ago

Closing this to clear the clutter.