Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


akron1184612284.pdf (568.5 KB)

ETD Abstract Container

Abstract Header

Static Scheduling for Synchronous Data Flow Graphs

Khasawneh, Samer Fayiz
http://rave.ohiolink.edu/etdc/view?acc_num=akron1184612284

Abstract Details

2007, Master of Science, University of Akron, Computer Science.
This thesis addresses the issue of determining the iteration bound for a synchronous data flow graph (SDFG) and determining whether or not a SDFG is live. The main result of this work is an iteration bound equation for finding an integral static schedule for a SDFG, in which a node is issued at the beginning of a clock cycle. We show that one can schedule a SDFG without converting it to its equivalent homogeneous graph (EHG). We support our results with some examples.
Timothy O'Neil (Advisor)
SDFG; iteration bound; static schedule; EHG; DFG; node; DATA FLOW GRAPHS

Recommended Citations

Citations

  • Khasawneh, S. F. (2007). Static Scheduling for Synchronous Data Flow Graphs [Master's thesis, University of Akron]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=akron1184612284

    APA Style (7th edition)

  • Khasawneh, Samer. Static Scheduling for Synchronous Data Flow Graphs. 2007. University of Akron, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=akron1184612284.

    MLA Style (8th edition)

  • Khasawneh, Samer. "Static Scheduling for Synchronous Data Flow Graphs." Master's thesis, University of Akron, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=akron1184612284

    Chicago Manual of Style (17th edition)

akron1184612284
785
© 2007, all rights reserved.
This open access ETD is published by University of Akron and OhioLINK.