Task scheduling for context minimization in dynamically reconfigurable platforms

Nei Chiung Perng, Shih Hao Hung, Chia Heng Tu

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

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. We also present a greedy algorithm for the CONTEXT MINIMIZATION problem, that is proved {NP}-complete. The capability of the proposed algorithm is evaluated by a series of experiments.

Original languageEnglish
Pages (from-to)3-12
Number of pages10
JournalJournal of Signal Processing Systems
Volume59
Issue number1
DOIs
Publication statusPublished - 2010 Apr

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Modelling and Simulation
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Task scheduling for context minimization in dynamically reconfigurable platforms'. Together they form a unique fingerprint.

Cite this