Skip to content

implementation of clustering/scheduling for combinators, using ILP

Notifications You must be signed in to change notification settings

amosr/clustering

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

36 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Clustering

This is an implementation of clustering/scheduling for combinators, using ILP. The version shown in the paper Fusing Filters with Integer Linear Program is in Program/Paper/*.

GLPK, and glpk-hs are required.

Example

$ ./Benchmarks benches/QuadTree.comb
Clustering:
Found a 3-length clustering
1: { minx maxx miny maxy }
2: { External(xmym) }
3: { tl tr bl br }

About

implementation of clustering/scheduling for combinators, using ILP

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published