Abstract
The paper describes a new approach for automatic extraction of parallelism from sequential programs. The proposed method translates first the sequential programs to their intermediate ETPN (extended timed Petri net) representation and then extracts parallel operations by data dependency analysis. The data dependency analysis is carried out iteratively using interval partitioning and place composition techniques so as to reduce the extraction algorithm complexity. The parallel algorithms produced by the extraction process can then be optimized and improved by an iterative improvement algorithm driven by an optimization strategy and finally implemented directly in VLSI.
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.
