Abstract
A novel iterative algorithm is proposed to compute the theoretical minimum initiation interval of a given recurrent algorithm when there is a known, fixed inter-module communication delay. Specifically, for a twin-module implementation problem, a novel representation called necessary initiation interval is introduced to facilitate the development of an iterative algorithm which yields both the minimum initiation interval and the corresponding cut set of the cyclic iterative computational dependence graph (ICDG). The convergence of this iterative algorithm in finite iterations is also proved.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
