Abstract

The execution time of Pascal-like programs can be decreased by putting solutions to problems in their maximally parallel forms. In this study Pascal-like programs are considered, and analysis of parallelism is performed by using a dynamic recent data dependency graph (DDG). The means taken in this paper is able to derive maximally parallel versions of the programs and to minimize the execution time. The advantage of this means is not only to save the effort in implementation but also to possess generality and high-efficiency resulting from dynamically locating parallelism in program. The study shows that the maximally parallel program can run in considerably less time than that needed to run the original sequential Pascal-like program.

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 call

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.