Optimal vs. Heuristic Approaches to Context Scheduling for Multi-Context Reconfigurable Architectures

R. Maestre; M. Fernandez; R. Hermida; F.J. Kurdahi; N. Bagherzadeh; H. Singh

doi:10.1109/FPGA.2000.903424

Field-Programmable Custom Computing Machines, Annual IEEE Symposium on

Optimal vs. Heuristic Approaches to Context Scheduling for Multi-Context Reconfigurable Architectures

Year: 2000, Pages: 297

DOI Bookmark: 10.1109/FPGA.2000.903424

Authors

R. Maestre, Universidad Complutense
M. Fernandez, Universidad Complutense
R. Hermida, Universidad Complutense
F.J. Kurdahi, University of California at Irvine
N. Bagherzadeh, University of California at Irvine
H. Singh, University of California at Irvine

Abstract

This paper describes a methodology to efficiently obtain a solution to the problem of context scheduling for multi-context reconfigurable architectures, regarding the minimization of context loading overhead. The target applications are assumed periodic, since it is a typical feature of many DSP and multimedia applications. This work considers the tradeoff between achievable system performance and algorithm efficiency. It has been developed as a part of an automated design environment for reconfigurable systems.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!