c# - Remove Interlocked.Add in Parallel.For? -

I have some code to do some lookup and virtual calculations using parallel. For: Start the _table with

  // ... int values ​​... int element = 60; Int [] External Quality = New Ent [element]; (I1 = i0 + 1; i1 & lt; 1990; i1 ++) for (1, 2000, i0 => {int] [] counter = new int [element]; IT next peak 0 = _table [10 + I0] / ... Here are some additional calculations too ... int nextPos1 = _table [nextPos0 + i1]; Counter [next piece 1] ++;} // to synchronize (int i = 0; i & Lt; element; i ++) {Add interlock. (Referee outer quarter [i], counter [i]);}}   
 This is faster than sequential calculation. I want to find a different solution to count the occurance as an interaction. Adding is an obstacle. I check Plinq was an option, but was not able to find a way to count the invasion of nextPos1 elements in an array so far.   
 
 
 I basically give the same suggestion as a swan, but I thought it would be helpful in providing some code. ... Start _table with int values ​​... int element = 60; list & lt; int []> external control = new list & lt; int [] & gt; (); Parallel.For (1, 2000, i0 = & gt; {int [] counter; lock (external control) {if (external counter number == 0) counter = new int [element]; other {counter = external quarter [ External Counter.11; External Control Revolve (External Quarter No. 1);}} int nextPos0 = _table [10 + i0]; for (i1 = i0 + 1; i1 & lt; 1990; i1 ++) { // Also some additional calculations were done ... int nextPos1 = _table [nextPos0 + i1]; counter [nextPos1] ++;} lock (external counter) external control. Add (counter);}); Int totalCounter = new int [element]; Parallel (0, element - 1, i = & gt; {external (external) (counter in outer counter) total quarter [i] + = counter [i];});