![]() Sending push notifications via Firebase using AWS Lambda 2.97 views per day | posted on August 20, 2017.Save SVG element with custom font as an image 3 views per day | posted on January 22, 2019.Update complex state using immutability-helper or immer 3.17 views per day | posted on July 22, 2020.Cache Aside vs Read Through Cache 3.28 views per day | posted on December 24, 2013.Alternate way to invoke a REST API using WCF 3.31 views per day | posted on March 12, 2014.Simple Menu using React router and SASS 3.59 views per day | posted on January 5, 2019.Challenges in server side rendering React apps (SSR) 3.69 views per day | posted on December 23, 2018.Async functions with AngularJS 4.07 views per day | posted on April 5, 2015.Drag and Drop using react-dnd 4.52 views per day | posted on July 21, 2020.Conditional Promise Chaining Pattern – Better code 5.21 views per day | posted on July 5, 2018.How do I animate the background color of a button in React Native? 6.17 views per day | posted on July 1, 2017.Export data as CSV client-side using Papaparse 6.52 views per day | posted on November 10, 2020.Background sync in Progressive web apps (PWA) 7.79 views per day | posted on September 10, 2021.NET with LINQ to SQL and Entity Framework 6 8.07 views per day | posted on January 2, 2014 Sharing components using a monorepo built with Lerna and Yarn workspace 9.03 views per day | posted on July 28, 2021.Drag and Drop example using plain React 9.07 views per day | posted on August 29, 2021.Cancel navigation to a different page in a React app 9.38 views per day | posted on May 7, 2017.Functional Testing using React testing library and Jest 20.31 views per day | posted on August 10, 2021.Hope this helps to detect performance issues in your system. This reduced the Page Reads /sec and my system returned back to normal. To fine-tune the system, I rewrote my app to use lesser memory. It is followed by Chrome and McAfee with about 100 faults per second. The Bellman Ford app has about 207 faults per second. The Page Reads /sec has a value of 3.446 (quite high). Here is a sample snapshot of the output from the utility: It orders the list of counter values by decreasing value and displays it on the screen. It then iterates through each instance of the Process category. The above application gets the Page Reads /sec counter from the Memory category. Var counterValue = new PerformanceCounterValue(counter) Ĭonsole.WriteLine("Getting ", ) Var counter = new PerformanceCounter("Process", Var readCounterValue = new PerformanceCounterValue(readCounter) įoreach (var instanceName in category.GetInstanceNames()) Var readCounter = new PerformanceCounter("Memory", Var category = new PerformanceCounterCategory("Process") static bool CheckPerm()Ĭonsole.WriteLine("Getting perf counters") Below is a simple utility to identify the top 5 applications causing the maximum Page faults. If Page Reads / sec is lower, performance is better.įor each application, there is another performance counter that measures the faults. Page Reads / sec counter in Memory category measures the hard faults happening ever second. ![]() Page Faults / sec counter in Memory category is the sum of both soft and hard faults happening every second. Page faults are measured using Performance counters. My computer has 6 GB of physical memory (RAM), which is fairly adequate. This is because Windows usually swaps stale physical memory into the Paging file (stored in the disk). Hard fault occurs when an application requests a resource from memory which is paged into the physical disk. Soft faults happen quite frequently and are not that expensive as hard faults. Either the process requests for more physical memory or does garbage collection to free up memory. And the memory is not available as a continuous block. Soft fault occurs within an application when the application requests for a large amount of memory. There are two types of Page faults: Hard fault and Soft fault. Page faults degrade performance, especially the hard fault. I noticed a significant degradation in performance due to Page faults within the application. ![]() ![]() The program ran for four hours with a CPU load of 100% on a quad-core processor. And it was pretty dense or more inter-connected. The algorithm has a running time of O(n 2m). ![]() Over the weekend, I ran the Bellman Ford algorithm (All Pair Shortest Path). ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |