Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have a DataTable populated with 250,000 records with 5 columns, I am iterating over this at least 500,000 times.
The difference in performance between a table with 1000 records is massive and I can understand and appreciate why – however is there is a way to improve the performance?
I will assume that you have a good reason to be iterating over the list 500,000 times.
Depending on the work you are doing each iteration, you might be able to benifit from some parallization of the work load. Take a look at the TPL, you can use Parallel.ForEach to break the work into tasks that can be run concurrently. This way you can take advantage of more powerful hardware with more CPU cores.
Of course if you can do more of the work in fewer iterations you might also gain some performance, however without actually knowing what you are doing the only advice that can be offered are highlevel ideas without any bases on the actual problem domain.