The resource-constrained modulo scheduling problem: an experimental study

Authors:
Maria Ayala;Abir Benabid;Christian Artigues;Claire Hanen
Affiliations:
LAAS, CNRS, Toulouse, France 31400 and LAAS, Univ de Toulouse, Toulouse, France 31400 and Facultad de Ciencias Económicas y Sociales, Departamento de Estadística, Universidad de los Ande ...;LIP6, Paris cedex 05, France 75252;LAAS, CNRS, Toulouse, France 31400 and LAAS, Univ de Toulouse, Toulouse, France 31400;LIP6, Paris cedex 05, France 75252 and Université Paris Ouest Nanterre, Nanterre, France 92000
Venue:
Computational Optimization and Applications
Year:
2013

Citing 14
Cited 0

Iterative modulo scheduling: an algorithm for software pipelining loops

MICRO 27 Proceedings of the 27th annual international symposium on Microarchitecture
Minimum register requirements for a modulo schedule

MICRO 27 Proceedings of the 27th annual international symposium on Microarchitecture
Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on low-power design
Software pipelining

ACM Computing Surveys (CSUR)
Dynamically scheduled VLIW processors

MICRO 26 Proceedings of the 26th annual international symposium on Microarchitecture
Efficient formulation for optimal modulo schedulers

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Circuit Retiming Applied to Decomposed Software Pipelining

IEEE Transactions on Parallel and Distributed Systems
Lx: a technology platform for customizable VLIW embedded processing

Proceedings of the 27th annual international symposium on Computer architecture
Loop Shifting for Loop Compaction

International Journal of Parallel Programming - Special issue on instruction-level parallelism and parallelizing compilation, part 2
Loop Shifting for Loop Compaction

LCPC '99 Proceedings of the 12th International Workshop on Languages and Compilers for Parallel Computing
Probabilistic Predicate-Aware Modulo Scheduling

Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
A cyclic scheduling problem with an undetermined number of parallel identical processors

Computational Optimization and Applications
A constraint based approach to cyclic RCPSP

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
SCAN: a heuristic for near-optimal software pipelining

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus on the resource-constrained modulo scheduling problem (RCMSP), a general periodic scheduling problem, abstracted from the problem solved by compilers when optimizing inner loops at instruction level for VLIW parallel processors. Heuristic solving scheme have been proposed since many years to solve this problem, among which the decomposed software pipeling method. In this method, a cyclic scheduling problem ignoring resource constraints is first considered and a so-called legal retiming of the operations is issued. Second, a standard acyclic problem, taking this retiming as input, is solved through list scheduling techniques. In this paper, we propose a novel hybrid approach, which uses the decomposed software pipeling method to obtain a good retiming. Then the obtained retiming is used to build an integer linear programming formulation of reduced size, which allows to solve it exactly. Experimental results show that a lot more problems are solved with this new approach. The gap to the optimal solution is less than 1 % on most of the tested problem instances and the method appears to be competitive with a recently proposed constraint programming algorithm (Bonfietti et al., Lect. Notes Comput. Sci. 6876:130---144, 2011).