Frequency-Based List Scheduling (FBLS) extends standard List Scheduling by considering execution frequencies within a schedule. This is useful for global instruction scheduling methods that schedule groups of basic blocks, called meta-blocks, as though they were a single block. Traditional local schedulers operate on the premise that each instruction is executed the same number of times as ever...

Abstract: In standard linear fractional representation (LFR)-based linear parameter-varying (LPV) modeling the size of the (diagonal) scheduling block depends on the number of scheduling parameters and their repetitions, which in turn influences both the complexity of synthesis conditions and the computational load during online implementation of LPV controllers. A modeling framework motivated ...

Scheduling is one of the most often addressed optimization problems in DSP compilation, behavioral synthesis, and system-level synthesis research. With the rapid pace of changes in modern DSP applications requirements and implementation technologies, however, new types of scheduling challenges arise. This paper is concerned with the problem of scheduling blocks of computations in order to optim...

Scheduling is probably the most often addressed optimization problem in DSP compilation, behav-ioral synthesis, and system-level synthesis research. With the rapid pace of changes in modern DSP applications requirements and implementation technologies, however, new types of scheduling challenges arise. This paper is concerned with the problem of scheduling blocks of computations in order to opt...

The theory of scheduling has expanded rapidly during the past years. As multi-core architectures begin to emerge, operating system issues are to be considered for best use of multi-core processes. Due to the architectural differences in the state of art multi-core processors such as shared caches, memory controllers etc., it becomes the responsibility of the operating system to make use of inte...

Self scheduling is a method for task scheduling in parallel programs in which each processor acquires a new block of tasks for execution whenever it becomes idle To get the best performance the block size must be chosen to balance the scheduling overhead against the load imbalance To determine the best block size a better understanding of the role of load imbalance in self scheduling performanc...

Classical scheduling approaches are applied here to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. List schedulinglike approaches are proposed j r s t as greedy algorithms to tackle the fore mentioned problem. Then, distributiongraph based approaches are described in order to achieve balanced test concurrency and test power dissipation. An exte...