Minimizing Synchronization in Parallel Nested Loops

Although, computer system architecture and the throughput enhances continuously, the need for high computational speed and power in many scientific applications grows every day. As a result, implementation of parallel applications has gained more attention. Since nested loops are the most time-consuming parts of most programs, we propose a method for scheduling uniform nested loops to processors based on the equation of a straight line which includes the maximum possible number of dependence vectors. Experimental results show that the proposed method imposes a lower communication between processors compared with similar methods