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
AbstractWe consider the problem of finding a schedule for n-independent identical malleable tasks on...
AbstractWe present an efficient parallel algorithm for scheduling n unit length tasks on m identical...
We are given a nite set of jobs of equal processing times with readiness times and tails and a set ...
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...
International audienceScheduling in High-Performance Computing (HPC) has been traditionally centered...
AbstractThe paper deals with algorithms for applying classical list scheduling to a project scheduli...
© 2017 Archives of Control Sciences 2017. The subject of this work is the new idea of blocks for the...
Communicated by Susumu Matsumae This paper studies task scheduling algorithms which schedule a set o...
none4Many real world cyclic scheduling problems involve applications that need to be repeated with d...
In this paper we propose an approximation algorithm for scheduling malleable tasks with precedence c...
Today the most commonly used system architectures in data processing can be divided into three categ...
We propose the adaptive algorithm for solving a set of similar scheduling problems using learning te...
AbstractIn this paper we propose an approximation algorithm for scheduling malleable tasks with prec...
AbstractWe consider the problem of finding a schedule for n-independent identical malleable tasks on...
AbstractWe present an efficient parallel algorithm for scheduling n unit length tasks on m identical...
We are given a nite set of jobs of equal processing times with readiness times and tails and a set ...
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...
International audienceScheduling in High-Performance Computing (HPC) has been traditionally centered...
AbstractThe paper deals with algorithms for applying classical list scheduling to a project scheduli...
© 2017 Archives of Control Sciences 2017. The subject of this work is the new idea of blocks for the...
Communicated by Susumu Matsumae This paper studies task scheduling algorithms which schedule a set o...
none4Many real world cyclic scheduling problems involve applications that need to be repeated with d...
In this paper we propose an approximation algorithm for scheduling malleable tasks with precedence c...
Today the most commonly used system architectures in data processing can be divided into three categ...
We propose the adaptive algorithm for solving a set of similar scheduling problems using learning te...
AbstractIn this paper we propose an approximation algorithm for scheduling malleable tasks with prec...
AbstractWe consider the problem of finding a schedule for n-independent identical malleable tasks on...
AbstractWe present an efficient parallel algorithm for scheduling n unit length tasks on m identical...
We are given a nite set of jobs of equal processing times with readiness times and tails and a set ...