Static Scheduling for Cyclo Static Data Flow Graphs

@inproceedings{Anapalli2009StaticSF,
  title={Static Scheduling for Cyclo Static Data Flow Graphs},
  author={Sukumar Reddy Anapalli and Krishna Chaithanya Chakilam and Timothy W. O'Neil},
  booktitle={PDPTA},
  year={2009}
}
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 paper we present the iteration bound for a CSDFG which is used to find the integral static schedule and determine whether a csdf is live or not based on some calculation. We also present an algorithm that schedules cyclo static data flow graphs without converting to… CONTINUE READING
2 Citations
4 References
Similar Papers