Hi, My application involves building spanning trees. It takes one minute to create trees from 3 MB data. But it takes close to 1.5 hours to create tree for 15 MB data. Is is taking this long because it takes a while to allocate space during new operation? I thought the algorithm is straight forward and I don't see any performance tuning in the algorithm. I need convincing answers of time taken is because of new object creation only.
There are two things I can think of that can be the problem (neither of which is object creation)
1) Algorithm - Are you using an algorithm that gets exponentially worse for large data? If so, can you tune it? 2) Memory - Are all 15 megs of data in memory at once? If so, there is a lot of paging going on. You would need to do some sort of tuning of the algorithm to reduce the paging.
The soul is dyed the color of its thoughts. Think only on those things that are in line with your principles and can bear the light of day. The content of your character is your choice. Day by day, what you do is who you become. Your integrity is your destiny - it is the light that guides your way. - Heraclitus
I’ve looked at a lot of different solutions, and in my humble opinion Aspose is the way to go. Here’s the link: http://aspose.com