TimeIndexed Formulations and a Large Neighborhood Search for the ResourceConstrained Modu.pdfVIP

Time-Indexed Formulations and a Large Neighborhood Search for the Resource-Constrained Modulo Scheduling Problem Benoˆıt Dupont de Dinechin STMicroelectronics STS/CEC 12, rue Jules Horowitz - BP 217. F-38019 Grenoble benoit.dupont-de-dinechin@ The resource-constrained modulo scheduling problem is motivated by the 1-periodic cyclic instruc- tion scheduling problems that are solved by compilers when optimizing inner loops for instruction- level parallel processors. In production compilers, modulo schedules are computed by heuristics, because even the most efficient integer programming formulation of resource-constrained modulo scheduling by Eichenberger and Davidson appears too expensive to solve relevant problems. We present a new time-indexed integer programming formulation for the resource-constrained modulo scheduling problem and we propose a large neighborhood search heuristic to make it tractable. Based on experimental data from a production compiler, we show that this combination enables to solve near optimally resource-constrained modulo scheduling problems of significant size. We also show that our large neighborhood search benefits to a lesser extent the resource-constrained modulo scheduling integer programming formulation of Eichenberger and Davidson. Keywords: Cyclic Scheduling, Modulo Scheduling, Instruction Scheduling, Time-Indexed Formula- tion, Large Neighborhood Search, Adaptive Margins 1 Introduction Modulo scheduling is the cyclic instruction scheduling framework used by highly optimizing com- pilers to schedule instructions of innermost program loops [1]. Modulo scheduling is an effective optimization for instruction-level parallel processors [15], especially the Very Long Instruction W