Affordable Access

Task Scheduling for Context Minimization in Dynamically Reconfigurable Platforms

IFIP Lecture Notes in Computer Science (LNCS)
Publication Date
  • Computer Science
  • Design


Dynamically reconfigurable hardware provides useful means to reduce the time-to-prototype and even the time-to-market in product designs. It also offers a good alternative in reconfiguring hardware logics to optimize the system performance. This paper targets an essential issue in reconfigurable computing, i.e., the minimization of configuration contexts. We explore different constraints on the CONTEXT MINIMIZATION problem. When the resulting subproblems are polynomial-time solvable, optimal algorithms are presented.Full Text at Springer, may require registration or fee

There are no comments yet on this publication. Be the first to share your thoughts.