Linux(R) Debugging and Performance Tuning: Tips and - download pdf or read online

By Steve Best

ISBN-10: 0131492470

ISBN-13: 9780131492479

A different source that exhibits Linux kernel AND Linux software programmers tips to write bug-free code that is optimized for functionality. 1) Debugging innovations for Linux functions and the kernel 2) functionality tuning ideas for Linux software and the kernel. three) pattern courses that exhibit how debugging instruments can locate programming error. four) pattern courses that exhibit how profiling instruments can express which workouts purposes spend the main time in. five) Key positive factors that may be arrange within the kernel to seize info as soon as an issue happens.

Show description

Read or Download Linux(R) Debugging and Performance Tuning: Tips and Techniques PDF

Similar operating systems books

Download e-book for kindle: Solaris Performance and Tools: Dtrace and Mdb Techniques for by Richard McDougall

In overall, the 2 books Solaris functionality and instruments & Solaris Internals reviewed right here current a brand new point of information in regards to the internals of Solaris, what they do, how they behave, and the way to investigate that habit. The books are a needs to for builders, approach programmers, and structures directors who paintings with Solaris eight, nine, or 10.

Glenn Thomas Stephens's The tomes of Kylix--the Linux API PDF

From its basic beginnings, Linux has emerged as a robust server working procedure with a amazing machine setting and person interface. Now, with Kylix, Linux builders have a strong swift software improvement device for producing client-side purposes. The Tomes of Kylix: The Linux API courses builders throughout the basic Linux method functionality calls and programming interfaces, protecting the middle facets of Linux improvement from dossier processing and interprocess conversation to threading matters and sockets.

Bob LeVitus's Mac OS X Lion for Dummies PDF

The bestselling Mac consultant, up-to-date for the newest Mac OS X and now in complete colour! Mac OS X Lion represents a brand new period within the Mac working method. This pleasant advisor is totally up-to-date for the newest Mac OS X and offers every little thing new Mac clients and clients upgrading to Mac OS X Lion want to know. A bestseller in prior versions, Mac OS X Lion For Dummies covers all of the cool stuff and prepares you for the quirks.

Additional info for Linux(R) Debugging and Performance Tuning: Tips and Techniques

Sample text

6. 01 seconds. com to register it. Thanks Next we can use the gcov program to look at the actual number of times each line of the program was executed. 13. 14. 13. Building sample1 with gcov options. 14. Running sample1 and creating gcov output. com to register it. gcov. It shows the actual number of times each line of the program was executed. 7 is the output of gcov on sample1. 7. com to register it. Thanks 1: 9: int colcnt = 0; 50000: 10: for (i=2; i <= 50000; i++) 49999: 11: if (prime(i)) { 5133: 12: colcnt++; 5133: 13: if (colcnt%9 == 0) { 570: 14: printf("%5d\n",i); 570: 15: colcnt = 0; -: 16: } -: 17: else 4563: 18: printf("%5d ", i); -: 19: } 1: 20: putchar('\n'); 1: 21: return 0; -: 22: } -: 23: 49999: 24:int prime (int num) { -: 25: /* check to see if the number is a prime?

Com to register it. 9 shows the output of gprof for the sample2 program. 9. 01 seconds. 18. 17. Building sample2 with gcov and running sample2. [View full size image] . com to register it. 18. Running sample2 and getting gcov output. com to register it. 10 shows gcov output for the sample2 program. 10. com to register it. Thanks -: 24: } -: 25: 49999: 26:int prime (int num) { -: 27: /* check to see if the number is a prime? */ 49999: 28: int i; 1061109: 29: for (i=2; i <= faster(num); i++) 1055976: 30: if (num %i == 0) 44866: 31: return 0; 5133: 32: return 1; -: 33: } -: 34: -: 35:int faster (int num) 1061109: 36: { 1061109: 37: return (int) sqrt( (float) num); -: 38: } -: 39: The for loop in the prime routine has been reduced from 121 million executions to 1 million executions.

Thanks -: 24: } -: 25: 49999: 26:int prime (int num) { -: 27: /* check to see if the number is a prime? */ 49999: 28: int i; 1061109: 29: for (i=2; i <= faster(num); i++) 1055976: 30: if (num %i == 0) 44866: 31: return 0; 5133: 32: return 1; -: 33: } -: 34: -: 35:int faster (int num) 1061109: 36: { 1061109: 37: return (int) sqrt( (float) num); -: 38: } -: 39: The for loop in the prime routine has been reduced from 121 million executions to 1 million executions. 80 seconds. The tools gprof and gcov helped find the "hot spots" in this sample program.

Download PDF sample

Linux(R) Debugging and Performance Tuning: Tips and Techniques by Steve Best


by David
4.2

Rated 4.57 of 5 – based on 14 votes