ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
نویسندگان
چکیده
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Polyhedral theory and duality theory are used to demonstrate that e cient solutions of the scheduling problem can be expected from a carefully formulated integer linear program (ILP). Furthermore, we present an algorithm to lower bound the resource requirement of the time-constrained scheduling problem that enables us to solve the ILP more e ciently.
منابع مشابه
An ILP-based scheduling scheme for energy efficient high performance datapath synthesis
In this paper, we describe an integer linear programming (ILP) based datapath scheduling algorithm which uses both multiple supply voltages and dynamic frequency clocking for power optimization. The scheduling technique assumes the number and type of different functional units as resource constraints and minimizes the energy delay product (EDP). The energy savings directly comes from the use of...
متن کاملA Flow - Based Approach to Solving Resource - Constrained Scheduling
A novel integer linear programming (ILP) formulation for resource-constrained scheduling problems is presented. Existing ILP-based methods for the same problem typically have a complexity (measured in terms of the number of unknown integer variables) that is proportional to the latency bound of the problem. Hence, they are restricted in scope (e.g., high-level synthesis). Our approach consists ...
متن کاملAn ILP Approach to the Simultaneous Application of Operation Scheduling and Power Management
At the behavioral level, large power saving is possible by shutting down unused operations, which is commonly referred to as power management. However, on the other hand, operation scheduling has a significant impact on the potential for power saving via power management. In this paper, we present an integer linear programming (ILP) model for the simultaneous application of operation scheduling...
متن کاملSINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملAnalyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem
|In integer linear programming (ILP), formulating a \good" model is of crucial importance to solving that model [1]. In this paper, we begin with a mathematical analysis of the structure of the assignment, timing, and resource constraints in high-level synthesis, and then evaluate the structure of the scheduling polytope described by these constraints. We then show how the structure of the cons...
متن کامل