MSDN Magazine - June 2008 - (Page 18)

Guerrilla .NET: The Essentials C# & The .NET Platform July 28th-August 1st Los Angeles an array are reference-rich, the cost is high. If the element doesn’t contain any references, I wouldn’t need to go through the array at all. For example, if you use an array to store nodes in a binary tree, one way to implement it is to refer to a node’s right and left node by the actual nodes: class Node { Data d; Node left; Node right; }; Call 800.699.1932 to register today! or visit www.develop.com Node[] binary_tr = new Node [num_nodes]; New Hands-on .NET 3.0/3.5 Training What’s New in .NET 3.0-3.5 w/LINQ July 21st - Boston If num_nodes is a large number, it means you will need to go through at least two references per element. An alternative approach is to store the index of the right and the left node: class Node { Data d; uint left_index; uint right_index; }; Windows Communication Foundation w/ 3.5 content June 23rd -New York July 7th - Boston July 21st - Bellevue. WA This way, instead of referring to the left node’s data as left.d, you would refer to it as binary_tr[left_index].d. And the garbage collector wouldn’t need to look at any references for left and right node. Windows Presentation Foundation w/ 3.5 content June 9th - Los Angeles July 14th - Boston July 28th - Chicago Windows WorkFlow Foundation June 16th - Boston NEW COURSE What’s New in Microsoft Web Development June 30th - Los Angeles - July 28th - Boston It’s best if you can allocate a pool of large objects and reuse them instead of allocating temporary ones. Out of the three reasons for a collection, the first two are usually more dominant than the third. Therefore, it’s best if you can allocate a pool of large objects and reuse them instead of allocating temporary ones. Yun Jin has a good example of such a buffer pool in his blog entry (go.microsoft.com/fwlink/?LinkId=115870). Of course, you would want to make the buffer size larger. On-Site Training For groups of students, DevelopMentor’s On-Site course delivery may offer the most cost-effective solution – at your location, at the time you need it. OnSites also offer the ability to customize a course to your group’s needs, including course content, labs that run on your programming platform and lab exercises tailored to your business or project. Call us today to discuss your training needs! US -800.699.1932 UK -(0)8000.562.265 Europe-(0)01242.525.108 Collecting Performance Data for the LOH There are a few ways to collect performance data that’s relevant to the LOH. But before I explain them, let’s talk about why you would want to do it. Before you start collecting performance data for a specific area, hopefully you have already found evidence that you should be looking at this area or you have exhausted other areas that you know of and didn’t find any problems that could explain a performance problem you are observing. I would recommend reading a blog entry of mine for more explanation (see go.microsoft.com/fwlink/?LinkId=116467). There I talk about the fundamentals of memory and CPU. Additionally, the November 2006 installment of CLR Inside Out on investigating memory issues talks about steps involved in diagnosing performance probCLR Inside Out 18 msdn magazine http://www.develop.com http://www.develop.com http://go.microsoft.com/fwlink/?LinkId=115870 http://go.microsoft.com/fwlink/?LinkId=116467

Table of Contents Feed for the Digital Edition of MSDN Magazine - June 2008

MSDN Magazine - June 2008 Contents Toolbox CLR Inside Out Cutting Edge Patterns In Practice SAAS Concurrency Robotics Form Filler GUI Library Service Station Foundations Windows With C++ Concurrent Affairs Going Places { End Bracket }

MSDN Magazine - June 2008

For optimal viewing of this digital publication, please enable JavaScript and then refresh the page. If you would like to try to load the digital publication without using Flash Player detection, please click here.