Work in Progress: GeMS: A Generator for Modulo Scheduling Problems

GeMS is a customisable, open-source toolkit for generating random, yet constrained, modulo scheduling problems with a known optimal initiation interval. These can then be used to evaluate the behavior of different scheduling algorithms under controlled conditions.

[1]  Oliver Sinnen,et al.  Dependence Graph Preprocessing for Faster Exact Modulo Scheduling in High-Level Synthesis , 2018, 2018 28th International Conference on Field Programmable Logic and Applications (FPL).

[2]  Jean-Marc Vincent,et al.  Random graph generation for scheduling simulations , 2010, SimuTools.

[3]  B. Ramakrishna Rau,et al.  Iterative Modulo Scheduling , 1996, International Journal of Parallel Programming.

[4]  Alexandre E. Eichenberger,et al.  Efficient formulation for optimal modulo schedulers , 1997, PLDI '97.

[5]  Oliver Sinnen,et al.  ILP-based modulo scheduling for high-level synthesis , 2016, 2016 International Conference on Compliers, Architectures, and Sythesis of Embedded Systems (CASES).