Multi task hyperreconfigurable architectures: models and reconfiguration problems
by Sebastian Lange, Martin Middendorf
International Journal of Embedded Systems (IJES), Vol. 1, No. 3/4, 2005

Abstract: Hyperreconfigurable architectures can adapt their reconfiguration abilities during run time and have been proposed to increase the speed of dynamic reconfiguration. In this paper we study the concept of partial hyperreconfiguration for multitask environments. Several models for partially hyperreconfigurable architectures are proposed and the problem to find optimal (hyper) reconfigurations is studied. While under a general cost model the problem is known to be NP-complete even for a single task, an interesting special case is identified that can be solved in polynomial time for multiple tasks. An example for a partially hyperreconfigurable architecture is given and results of simulations with a test application are presented.

Online publication date: Mon, 05-Jun-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com