Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

Static Scheduling and Rotation Scheduling on Cyclo Static Data Flow Graphs

Abstract Details

2009, Master of Science, University of Akron, Computer Science.
There are few processes which display cyclically changing but predefined behavior. These processes can be represented using cyclo static data flow graphs (CSDFG). This capability results in a higher degree of parallelism. In this research we present the iteration bound for a CSDFG which is used to find the integral static schedule and determine whether a CSDFG is live or not based on some calculation. We also present an algorithm that schedules cyclo static data flow graphs without converting to their equivalent homogeneous graphs (EHG’s). Later we present an algorithm that schedules CSDFGs with different types of functional units, and also a technique called rotation scheduling which is applied for reducing the execution times of CSDFG and produce an optimal schedule. Finally all these are demonstrated with a suitable example.
Timothy O' Neil, PhD (Advisor)
81 p.

Recommended Citations

Citations

  • Anapalli, S. R. (2009). Static Scheduling and Rotation Scheduling on Cyclo Static Data Flow Graphs [Master's thesis, University of Akron]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=akron1246908859

    APA Style (7th edition)

  • Anapalli, Sukumar Reddy. Static Scheduling and Rotation Scheduling on Cyclo Static Data Flow Graphs. 2009. University of Akron, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=akron1246908859.

    MLA Style (8th edition)

  • Anapalli, Sukumar Reddy. "Static Scheduling and Rotation Scheduling on Cyclo Static Data Flow Graphs." Master's thesis, University of Akron, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=akron1246908859

    Chicago Manual of Style (17th edition)