Tue, 1 Apr 2008 09:23:23 +0000 (UTC)

Related articles |
---|

Prediction of local code modifications plfriko@yahoo.de (Tim Frink) (2008-03-27) |

Re: Prediction of local code modifications gah@ugcs.caltech.edu (glen herrmannsfeldt) (2008-03-28) |

Re: Prediction of local code modifications preston.briggs@gmail.com (preston.briggs@gmail.com) (2008-03-28) |

Re: Prediction of local code modifications max@gustavus.edu (Max Hailperin) (2008-03-28) |

Re: Prediction of local code modifications gah@ugcs.caltech.edu (glen herrmannsfeldt) (2008-03-29) |

Re: Prediction of local code modifications preston.briggs@gmail.com (preston.briggs@gmail.com) (2008-03-29) |

Re: Prediction of local code modifications plfriko@yahoo.de (Tim Frink) (2008-04-01) |

Re: Prediction of local code modifications preston.briggs@gmail.com (preston.briggs@gmail.com) (2008-04-01) |

Re: Prediction of local code modifications max@gustavus.edu (Max Hailperin) (2008-04-02) |

Re: Prediction of local code modifications cfc@shell01.TheWorld.com (Chris F Clark) (2008-04-02) |

Re: Prediction of local code modifications gah@ugcs.caltech.edu (glen herrmannsfeldt) (2008-04-03) |

Re: Prediction of local code modifications max@gustavus.edu (Max Hailperin) (2008-04-03) |

Re: Prediction of local code modifications plfriko@yahoo.de (Tim Frink) (2008-04-03) |

[7 later articles] |

From: | Tim Frink <plfriko@yahoo.de> |

Newsgroups: | comp.compilers |

Date: | Tue, 1 Apr 2008 09:23:23 +0000 (UTC) |

Organization: | CS Department, University of Dortmund, Germany |

References: | 08-03-105 08-03-109 |

Keywords: | code |

Posted-Date: | 02 Apr 2008 00:57:24 EDT |

Hi,

*>> How do compiler developers cope with this problem? Are there any*

*>> approaches which allow to predict the influence of a local code*

*>> optimization on the global code performance for complex processors?*

*>*

*> If I understand your question right, the answer is 'dynamic*

*> programming'.*

Thank you for your answer.

I'm not sure if dynamic programming is an approach that I can apply to

my problem. When I understand the idea of dynamic programming

correctly, it exploits the idea of "overlapping subproblems" and

"memoization", i.e. it is assumed that the problem can be divided into

independent subproblems which can be solved separately and then their

optimal solution can be used to construct the global optimal solution.

For my problem with the alignment I could divide the code into smaller

subproblems where I could try to find an optimal local

solution. However, these subproblems are not independent. When I move

some code locally in one place (let's say that's the region of the

first subproblem), then this might possibly also influence some

following code in another region that I consider as a further

subproblem. Thus, calculating separate optimal local solutions and

them combine them will not work for me.

Do you see another way to cope with my optimization problem?

Regards,

Tim

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.