Martin Grajcar

Learn More
×ØÖÖÖØ Our problem consists of a partially ordered set of tasks communicating over a shared bus which are to be mapped to a heterogeneous multiprocessor system. The goal is to minimize the makespan, while satisfying constrains implied by data dependencies and exclusive resource usage. We present a new efficient heuristic approach based on list scheduling(More)
MILP-based models are useful for finding optimal schedules and for proving their optimality. Because of the problem complexity, model improvements have to be investigated. We analyze the constraints necessary for precluding resource conflicts, present novel formulations, and evaluate them. The efficiency of the solution process can be improved significantly(More)
Most of the existing Digital Signal Processors (DSPs) are optimized for a fast and ecient computation of the Fast Fourier Transform (FFT). However, there are only two oating-point DSPs available, which perform the butter BLOCKINy operation of a FFT in 4 processor cycles, but no xed-point DSP is designed that way. The new 24 bit xed-point DSP DAISY, which is(More)
  • 1