|Program Partitioning for embedded systems. email@example.com (Bageshri Sathe) (2001-08-25)|
|Re: Program Partitioning for embedded systems. firstname.lastname@example.org (Mark Welter) (2001-08-26)|
|Re: Program Partitioning for embedded systems. email@example.com (Madhusudan Challa) (2001-09-03)|
|From:||Bageshri Sathe <firstname.lastname@example.org>|
|Date:||25 Aug 2001 13:29:17 -0400|
|Posted-Date:||25 Aug 2001 13:29:17 EDT|
I am working on a problem of partitioning the executable code for a
limited memory embedded system (non-parallel) which has neither an OS
nor any paging hardware. There are separate memories for code and
data. A large function may not fit in the code memory, so overlays
cannot be used.
We are trying to partition the executable code in order to achieve
(1) Each partition should fit in the available memory.
(2) Number of DMA calls (which are required to load new code in the
memory) are minimized. (Eg. avoiding partition boundaries to fall
within a loop if the loop entirely fits in the memory.)
(3) Number of data loads (corresponding to code loads) are minimized.
I would like to find out if any research has been done or is being
done on this. If any one knows about work done in this direction,
please give me some pointers.
[I told him that the usual way to solve this problem is to rewrite the
code into functions small enough to overlay, and then overlay them,
but he'd like something more automated. Sounds like a difficult and
interesting problem. -John]
Return to the
Search the comp.compilers archives again.