Krishna Chaithanya Chakilam

Learn More
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(More)
Since compiler spend most of the time in executing loop nests because of the dependences, minimizing dependences across loops is vital for compiler optimization. This paper explores two methods, sums of data dependencies and dominant data dependencies for eliminating dependencies in multi-dimensional loops. The first method eliminates dependences by(More)
  • 1