"Minimizing resources in a repeating schedule for a split-node data-flow graph."

Timothy W. O'Neil, Edwin Hsing-Mean Sha (2002)

> Home

Details and statistics

DOI: 10.1145/505306.505336

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/glvlsi/ONeilS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/glvlsi/ONeilS02
Timothy W. O'Neil, Edwin Hsing-Mean Sha:
Minimizing resources in a repeating schedule for a split-node data-flow graph. ACM Great Lakes Symposium on VLSI 2002: 136-141

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.