CoreMap: a rapid prototyping environment for distributed reconfigurable systems
by Christophe Bobda
International Journal of Embedded Systems (IJES), Vol. 1, No. 1/2, 2005

Abstract: We present two methods for solving the temporal partitioning problem. The first one is an enhancement of the well-known list scheduling method. The enhancement uses the so-called configuration switching to minimise the number of partitions. The second method first uses a three-dimensional spectral placement to position the modules in a three-dimensional vector space. The partitioning is done by picking components along the time-axis in increasing order of the time-coordinates. The Kernighan-Lin (KL) (Kernighan and Lin, 1970; Fiduccia and Mattheyses, 1982; Lengauer, 1990) algorithm with a modified gain function adapted to our need is then used to move the nodes of the graph from one partition to the other to insure an unidirectional partition.

Online publication date: Thu, 26-Jan-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