Add to ORKGIn a coarse-grained reconfigurable architecture, the function of resources such as Arithmetic Logic Units (ALU) can be reconfigured at run-time. The traditional scheduling algorithms always assume a fixed resource pattern. In this paper, we propose an efficient scheduling algorithm assuming that different resource patterns are given. The multi-pattern scheduling algorithm is based on the list scheduling algorithm. The complexity of the proposed algorithm is linear in the number of given patterns
International audienceScheduling in High-Performance Computing (HPC) has been traditionally centered...
While high-performance architectures have included some Instruction-Level Parallelism (ILP) for at l...
For decades combinatorial problems have been studied in numerous disciplines. The scheduling problem...
In a coarse-grained reconfigurable architecture, the function of resources such as Arithmetic Logic ...
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfi...
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfi...
In a coarse-grained reconfigurable architecture, the functions of resources such as Arithmetic Logic...
In a coarse-grained reconfigurable architecture, the functions of resources such as Arithmetic Logic...
This paper presents a new operation chaining reconfigurable scheduling algorithm (CRS) based on list...
Abstract—Dynamic scheduling algorithms have been success-fully used for parallel computations of nes...
Communicated by Susumu Matsumae This paper studies task scheduling algorithms which schedule a set o...
AbstractWe present an efficient parallel algorithm for scheduling n unit length tasks on m identical...
A novel list-based threshold-accepting (LBTA) algorithm is proposed for solving the zero-wait (ZW) s...
We present an algorithm for scheduling precedence constrained parallel tasks on multiprocessors with...
International audienceWe present a new representation for the scheduling problem that allows a signi...
International audienceScheduling in High-Performance Computing (HPC) has been traditionally centered...
While high-performance architectures have included some Instruction-Level Parallelism (ILP) for at l...
For decades combinatorial problems have been studied in numerous disciplines. The scheduling problem...
In a coarse-grained reconfigurable architecture, the function of resources such as Arithmetic Logic ...
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfi...
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfi...
In a coarse-grained reconfigurable architecture, the functions of resources such as Arithmetic Logic...
In a coarse-grained reconfigurable architecture, the functions of resources such as Arithmetic Logic...
This paper presents a new operation chaining reconfigurable scheduling algorithm (CRS) based on list...
Abstract—Dynamic scheduling algorithms have been success-fully used for parallel computations of nes...
Communicated by Susumu Matsumae This paper studies task scheduling algorithms which schedule a set o...
AbstractWe present an efficient parallel algorithm for scheduling n unit length tasks on m identical...
A novel list-based threshold-accepting (LBTA) algorithm is proposed for solving the zero-wait (ZW) s...
We present an algorithm for scheduling precedence constrained parallel tasks on multiprocessors with...
International audienceWe present a new representation for the scheduling problem that allows a signi...
International audienceScheduling in High-Performance Computing (HPC) has been traditionally centered...
While high-performance architectures have included some Instruction-Level Parallelism (ILP) for at l...
For decades combinatorial problems have been studied in numerous disciplines. The scheduling problem...