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.

No abstract

No abstract

No abstract