This paper describes a technique to integrate the three major tasks of high-level synthesis (scheduling, allocation, and binding) into one optimization step. Furthermore, a fourth task is performed to select the clock period for the design. These tasks are performed to ensure that the local timing constraints used to capture the timing requirements given by the designer in the behavioral specification will be satisfied. The optimization problem is solved with a Tabu search technique. Experimental results show the efficiency of the proposed technique. 1. Introduction The high-level synthesis (HLS) task can be divided into three main subtasks; operation scheduling, resource allocation, and resource binding. Although these subtasks are inter...
The Resource Constrained Project Scheduling Problem (RCPS) is a well known difficult combinatorial o...
In this paper, a tabu search-based behavior level synthesis scheme is proposed to minimize power con...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
Multicycle scheduling, i.e., the possibility to schedule operations over several clock cycles, gives...
The paper describes objectives of high-level synthesis. It concentrates on operation scheduling stra...
International audience An appropriate tabu search implementation is designed to solve the resource c...
Most of multiple criteria scheduling problems are NP-hard, so that exact procedures can only solve s...
The High-Level Synthesis (HLS) problem consists in transforming a source code (e.g. in the C or VHDL...
This paper presents the use of Tabu Search algorithm for solving the problems of coherent synthesis ...
Real-time task scheduling problems are generally considered to be NP-hard problems. Therefore it is ...
Early scheduling algorithms usually adjusted the clock cycle duration to the execution time of the s...
International audienceThe scheduling problem under study may be viewed as an extension of the standa...
International audienceThis paper deals with an industrial shop scheduling problem that arises in a m...
Abstract-This paper presents an integer linear programming (ILP) model for the scheduling problem in...
This paper develops a two-phase tabu search-based methodology for detailed resource planning in make...
The Resource Constrained Project Scheduling Problem (RCPS) is a well known difficult combinatorial o...
In this paper, a tabu search-based behavior level synthesis scheme is proposed to minimize power con...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
Multicycle scheduling, i.e., the possibility to schedule operations over several clock cycles, gives...
The paper describes objectives of high-level synthesis. It concentrates on operation scheduling stra...
International audience An appropriate tabu search implementation is designed to solve the resource c...
Most of multiple criteria scheduling problems are NP-hard, so that exact procedures can only solve s...
The High-Level Synthesis (HLS) problem consists in transforming a source code (e.g. in the C or VHDL...
This paper presents the use of Tabu Search algorithm for solving the problems of coherent synthesis ...
Real-time task scheduling problems are generally considered to be NP-hard problems. Therefore it is ...
Early scheduling algorithms usually adjusted the clock cycle duration to the execution time of the s...
International audienceThe scheduling problem under study may be viewed as an extension of the standa...
International audienceThis paper deals with an industrial shop scheduling problem that arises in a m...
Abstract-This paper presents an integer linear programming (ILP) model for the scheduling problem in...
This paper develops a two-phase tabu search-based methodology for detailed resource planning in make...
The Resource Constrained Project Scheduling Problem (RCPS) is a well known difficult combinatorial o...
In this paper, a tabu search-based behavior level synthesis scheme is proposed to minimize power con...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...