Abstract
The paper presents a method of creating parallel-pipeline programs for reconfigurable computer systems based on iteration paralleling for the solution of graph NP-complete problems, which is different from others for processing the irregular sets with the elements accessed not by their addresses (like in arrays) but by values, the names of vertices and the graph arcs. It shows that the new iteration-parallel method is more efficient than the layer-parallel method when the available computing resource and the size of the solved graphs increase due to the significant reduction of the commutation connections.
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 callMore From: IOP Conference Series: Materials Science and Engineering
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.
