Click here to Skip to main content
12,997,441 members (59,812 online)
Rate this:
Please Sign up or sign in to vote.

So I am currently working on a project and now I feel the need to try and speed up the execution. I have a method with a foreach loop in it that I wish to parallelize as efficiently as possible.

This is how it looks now:
public void Simulate()
    List<Coordinate> Locations = retrieveLocations();
    int min = int.MaxValue;
    int bestX = -1, bestY = -1;
    foreach (Coordinate currPos in Locations)
        string[,] tempMap = new string[globalMap.GetLength(0), globalMap.GetLength(1)];
        matrixCopy(globalMap, tempMap);
        int result = processData(currPos, tempMap);
        if (result < min)
            min = result;
            bestX = currPos.X;
            bestY = currPos.Y;
    MessageBox.Show(bestX + " " + bestY + " " + min);

I would like to change the foreach loop to use Parallel.ForEach or perhaps use PLINQ. My concerns are how I can find the minimal value with as little locking as possible. Also I want to preserve some other values than just the minimum.

Another issue is the globalMap, is it good to copy it like I do now? All threads can't work on the original at the same time because they change the data. But perhaps I should do the copy in my processData()-method? Any thoughts?
Posted 10-Oct-11 17:36pm

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

  Print Answers RSS
Top Experts
Last 24hrsThis month

Advertise | Privacy | Mobile
Web02 | 2.8.170622.1 | Last Updated 10 Oct 2011
Copyright © CodeProject, 1999-2017
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100