Abstract
Automatic parallelization of large and complex program regions requires the compiler to reason about complex semantic information. This paper describes a hierarchical reasoning system implemented within the Panorama parallelizing compiler. This reasoning system intelligently and efficiently extracts useful semantic information in the form of first-order predicates from program statements. It uses a hierarchical structure to represent the predicates, which enables fast determination of their truth in common cases. A hierarchical value graph facilitates rule-based, demand-driven retrieval of useful predicates.
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 callMore From: International Journal on Artificial Intelligence Tools
Disclaimer: 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.
