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

Authors:
Affiliations:
Venue:
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Year:
2000

Citing 6
Cited 1

Configuration prefetch for single context reconfigurable coprocessors

FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
Kernel scheduling in reconfigurable computing

DATE '99 Proceedings of the conference on Design, automation and test in Europe
Temporal partitioning combined with design space exploration for latency minimization of run-time reconfigured designs

DATE '99 Proceedings of the conference on Design, automation and test in Europe
MorphoSys: case study of a reconfigurable computing system targeting multimedia applications

Proceedings of the 37th Annual Design Automation Conference
Temporal Partitioning and Scheduling for Reconfigurable Computing

FCCM '98 Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines
A Framework for Scheduling and Context Allocation in Reconfigurable Computing

Proceedings of the 12th international symposium on System synthesis

Adaptive gabor wavelet for efficient object recognition

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

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 trade-off between achievable system performance and algorithm efficiency. It has been developed as a part of an automated design environment for reconfigurable systems.