loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2000 IEEE Symposium on Field-Programmable Custom Computing Machines
Optimal vs. Heuristic Approaches to Context Scheduling for Multi-Context Reconfigurable Architectures
Napa, California
April 17-April 19
ISBN: 0-7695-0871-5
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
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.
Citation:
R. Maestre, M. Fernandez, R. Hermida, F.J. Kurdahi, N. Bagherzadeh, H. Singh, "Optimal vs. Heuristic Approaches to Context Scheduling for Multi-Context Reconfigurable Architectures," fccm, pp.297, 2000 IEEE Symposium on Field-Programmable Custom Computing Machines, 2000
Usage of this product signifies your acceptance of the Terms of Use.