Abstract
Loops are predominant in computer programs. Data dependencies in loops dictate their execution time. An algorithm to execute loops in parallel based on the preordering of data in [2] is presented in this paper. This algorithm can be applied to Chip Multi Processors. The algorithm performs a fair share allocation of the loops to the available processors. Data accessed for loops accessed in a processor are fetched into its level one cache. The preordered data in the level one cache improve the performance of the cache. An example is simulated for the proposed algorithm and a performance improvement of 92% is observed in the overall execution time.
Sign-in/Register to access full text options 
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.
