home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lsi.cad
- Path: sparky!uunet!stanford.edu!leland.Stanford.EDU!sirius!rgupta
- From: rgupta@sirius.Stanford.EDU (Rajesh K. Gupta)
- Subject: Re: How to measure regularity in CDFGs ? Help !!
- Message-ID: <1992Aug25.212943.12827@leland.Stanford.EDU>
- Keywords: High-level Synthesis,allocation etc.
- Sender: news@leland.Stanford.EDU (Mr News)
- Reply-To: rgupta@sirius.Stanford.EDU (Rajesh K. Gupta)
- Organization: Stanford University
- References: <1992Aug25.173351.7393@cse.uta.edu>
- Distribution: usa
- Date: Tue, 25 Aug 92 21:29:43 GMT
- Lines: 32
-
- >
- > Can someone suggest a metric to represent the regularity
- > in digital systems described using CDFGs?
- >
- > I have allocation program which scans input data-flow graph,
- > extracts operator-operator interaction and uses this
- > information during allocation. I want to plot a graph of
- > some metric representative of regularity in DFG and
- > the quality of the allocation. I tried few tricks but
- > none gave me a unique quantity to describe regularity.
- > Your help and/or pointer to info will be greatly
- > appreciated.
- >
- > sandeep
- >
-
- If you haven't already done so, you may want to check out
- notions of "operator similarity" metrices used by McFarland
- (dac 83, I think).
- I believe he refined it in his bottom-up design (BUD) system
- that was published in Trans. CAD sometime last year.
-
- There was also a paper from somebody from UC Irvine (Kurdahi?)
- in DAC92 on regularity extraction from DF graphs.
-
- Sorry, couldn't be any more specific for now.
-
-
-
- Rajesh
-
- 725-1776 CSL Modulars I rgupta@sirius.stanford.edu
-