8 Feb 2004 22:07:39 -0500

Related articles |
---|

Operation Latencies kernel_learner@yahoo.com (2004-02-08) |

Re: Operation Latencies touati-nospamplease@nospam-prism.uvsq.fr (TOUATI Sid) (2004-02-12) |

Re: Operation Latencies tmk@netvision.net.il (2004-02-12) |

Re: Operation Latencies tommy.hoffner@ericsson.com (Tommy Hoffner) (2004-02-13) |

From: | kernel_learner@yahoo.com (Learner) |

Newsgroups: | comp.compilers |

Date: | 8 Feb 2004 22:07:39 -0500 |

Organization: | http://groups.google.com |

Keywords: | optimize, architecture, question |

Posted-Date: | 08 Feb 2004 22:07:39 EST |

Dear All,

A question:

Many operations have variable latencies...so I was wondering how

compilers do scheduling for VLIW and how they calculate the critical

path of a data dependence graph when the latencies of operations are

not known at compile time.. Some scheduling like s/w pipelining

requires calculation of RecMII which needs to know the critical path

in the ddg... How can you be sure you have the critical path when the

latencies can vary?

What are the usual approaches ?

Thanks!

LEarner

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.