Sponsored Content
Full Discussion: semaphore access speed
Top Forums Programming semaphore access speed Post 302238478 by otheus on Saturday 20th of September 2008 08:26:43 AM
Old 09-20-2008
Quote:
Originally Posted by migurus
Jim,
I never tried profiling before, so I ran into some problem here:
$ gcc -pg -o tstloop tstloop.c
$ tstloop
128205.13 semop/s [0,0]
$ gprof tstloop
gprof: gmon.out file is missing call-graph data
That's strange. Any chance you're running a different program that's elsewhere in the path? Try for instance running "./tstloop".

Also, for gprof, use the -l option (small L). I get:

Code:
$ gprof -l  ./semget
Flat profile:

Each sample counts as 0.01 seconds.
  %   cumulative   self              self     total
 time   seconds   seconds    calls  Ts/call  Ts/call  name
 57.10      0.13     0.13                             main (semget.c:21 @ 80485f0)
 25.12      0.18     0.06                             main (semget.c:18 @ 804861f)
  9.14      0.20     0.02                             main (semget.c:17 @ 8048614)
  6.85      0.22     0.02                             main (semget.c:16 @ 80485e4)

Line 21 is the semctl() function. Line 18 is the semget() call.

Now that we have concrete results, I'd cross-post this on the Linuxquestions.org com site.

The next step would be to use the debug/profiling version of libc (which I don't have floating around) and see if we can use gprof to find the bottleneck therein. Or, look at the source. It would seem to be of great benefit to have this improved.
 

9 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

semaphore

hi, is there any command where we can monitor semaphores? (1 Reply)
Discussion started by: yls177
1 Replies

2. UNIX for Dummies Questions & Answers

Semaphore

Hi, I'm new to UNIX. I need to know what's a semaphore Do reply. Thanks VJ (3 Replies)
Discussion started by: vjsony
3 Replies

3. Filesystems, Disks and Memory

dmidecode, RAM speed = "Current Speed: Unknown"

Hello, I have a Supermicro server with a P4SCI mother board running Debian Sarge 3.1. This is the "dmidecode" output related to RAM info: RAM speed information is incomplete.. "Current Speed: Unknown", is there anyway/soft to get the speed of installed RAM modules? thanks!! Regards :)... (0 Replies)
Discussion started by: Santi
0 Replies

4. Shell Programming and Scripting

Semaphore

Hi, I am looking to use a semaphore for the first time in one of my scripts. I am just wondering if there are any simple examples or tutorials around? I am a beginner so the simpler the better :) Thanks -Jaken (2 Replies)
Discussion started by: Jaken
2 Replies

5. UNIX for Dummies Questions & Answers

semaphore

what is semaphore? can any body explain it in a more simple way than the manual ?? replies appreciated Regards raguram R (7 Replies)
Discussion started by: raguramtgr
7 Replies

6. Filesystems, Disks and Memory

data from blktrace: read speed V.S. write speed

I analysed disk performance with blktrace and get some data: read: 8,3 4 2141 2.882115217 3342 Q R 195732187 + 32 8,3 4 2142 2.882116411 3342 G R 195732187 + 32 8,3 4 2144 2.882117647 3342 I R 195732187 + 32 8,3 4 2145 ... (1 Reply)
Discussion started by: W.C.C
1 Replies

7. Shell Programming and Scripting

semaphore

Control two exclusively shared resources(semaphore). The two resources are two files. The producer will write even numbers to one file, and odd numbers to another one. The consumer respectively reads from each file until it gets 5 even numbers and 5 odd numbers. Can any one help me with the... (0 Replies)
Discussion started by: gokult
0 Replies

8. Programming

Semaphore

If I create a semaphore and then I fork a number of child processes then all the child process use that same semaphore. Since the process address spaces are different rfom each other then how all the child process are able to access the same semaphore? I understand that semaphore/mutex is at os... (0 Replies)
Discussion started by: rupeshkp728
0 Replies

9. UNIX for Beginners Questions & Answers

Semaphore

I was asked to add this piece of code to a c program which I will execute through the shell: for(long i = 0; i < NITER; i++) { sem_wait( &sema); count++; sem_post( &sema); } I didn't get it, which is the critical section ? if it's "count++" how would a thread wake up in order to enter it... (1 Reply)
Discussion started by: uniran
1 Replies
GPROF(1)						    BSD General Commands Manual 						  GPROF(1)

NAME
gprof -- display call graph profile data SYNOPSIS
gprof [-abKlLsuz] [-C count] [-e name] [-E name] [-f name] [-F name] [-k fromname toname] [a.out [a.out.gmon ...]] DESCRIPTION
The gprof utility produces an execution profile of C, Pascal, or Fortran77 programs. The effect of called routines is incorporated in the profile of each caller. The profile data is taken from the call graph profile file which is created by programs that are compiled with the -pg option of cc(1), pc(1), and f77(1). The -pg option also links in versions of the library routines that are compiled for profiling. By convention these libraries have their name suffixed with _p, i.e., the profiled version of libc.a is libc_p.a and if you specify libraries directly to the compiler or linker you can use -lc_p instead of -lc. Read the given object file (the default is a.out) and establishes the relation between its symbol table and the call graph profile. The default graph profile file name is the name of the executable with the suffix .gmon appended. If more than one profile file is specified, the gprof output shows the sum of the profile information in the given profile files. The gprof utility calculates the amount of time spent in each routine. Next, these times are propagated along the edges of the call graph. Cycles are discovered, and calls into a cycle are made to share the time of the cycle. The first listing shows the functions sorted accord- ing to the time they represent including the time of their call graph descendants. Below each function entry is shown its (direct) call graph children, and how their times are propagated to this function. A similar display above the function shows how this function's time and the time of its descendants is propagated to its (direct) call graph parents. Cycles are also shown, with an entry for the cycle as a whole and a listing of the members of the cycle and their contributions to the time and call counts of the cycle. Second, a flat profile is given, similar to that provided by prof(1). This listing gives the total execution times, the call counts, the time that the call spent in the routine itself, and the time that the call spent in the routine itself including its descendants. The units for the per-call times are normally milliseconds, but they are nanoseconds if the profiling clock frequency is 10 million or larger, and if a function appears to be never called then its total self time is printed as a percentage in the self time per call column. The very high pro- filing clock frequencies needed to get sufficient accuracy in the per-call times for short-lived programs are only implemented for ``high resolution'' (non-statistical) kernel profiling. Finally, an index of the function names is provided. The following options are available: -a Suppress the printing of statically declared functions. If this option is given, all relevant information about the static function (e.g., time samples, calls to other functions, calls from other functions) belongs to the function loaded just before the static function in the a.out file. -b Suppress the printing of a description of each field in the profile. -C count Find a minimal set of arcs that can be broken to eliminate all cycles with count or more members. Caution: the algorithm used to break cycles is exponential, so using this option may cause gprof to run for a very long time. -e name Suppress the printing of the graph profile entry for routine name and all its descendants (unless they have other ancestors that are not suppressed). More than one -e option may be given. Only one name may be given with each -e option. -E name Suppress the printing of the graph profile entry for routine name (and its descendants) as -e, above, and also excludes the time spent in name (and its descendants) from the total and percentage time computations. (For example, -E mcount -E mcleanup is the default.) -f name Print the graph profile entry of only the specified routine name and its descendants. More than one -f option may be given. Only one name may be given with each -f option. -F name Print the graph profile entry of only the routine name and its descendants (as -f, above) and also uses only the times of the printed routines in total time and percentage computations. More than one -F option may be given. Only one name may be given with each -F option. The -F option overrides the -E option. -k fromname toname Will delete any arcs from routine fromname to routine toname. This can be used to break undesired cycles. More than one -k option may be given. Only one pair of routine names may be given with each -k option. -K Gather information about symbols from the currently-running kernel using the sysctl(3) and kldsym(2) interfaces. This forces the a.out argument to be ignored, and allows for symbols in kld(4) modules to be used. -l Suppress the printing of the call-graph profile. -L Suppress the printing of the flat profile. -s A profile file gmon.sum is produced that represents the sum of the profile information in all the specified profile files. This sum- mary profile file may be given to later executions of gprof (probably also with a -s) to accumulate profile data across several runs of an a.out file. -u Suppress the printing of functions whose names are not visible to C programs. For the ELF object format, this means names that con- tain the '.' character. For the a.out object format, it means names that do not begin with a '_' character. All relevant informa- tion about such functions belongs to the (non-suppressed) function with the next lowest address. This is useful for eliminating "functions" that are just labels inside other functions. -z Display routines that have zero usage (as shown by call counts and accumulated time). FILES
a.out The namelist and text space. a.out.gmon Dynamic call graph and profile. gmon.sum Summarized dynamic call graph and profile. SEE ALSO
cc(1), profil(2), clocks(7) S. Graham, P. Kessler, and M. McKusick, "An Execution Profiler for Modular Programs", Software - Practice and Experience, 13, pp. 671-685, 1983. S. Graham, P. Kessler, and M. McKusick, "gprof: A Call Graph Execution Profiler", Proceedings of the SIGPLAN '82 Symposium on Compiler Construction, SIGPLAN Notices, 6, 17, pp. 120-126, June 1982. HISTORY
The gprof profiler appeared in 4.2BSD. BUGS
The granularity of the sampling is shown, but remains statistical at best. We assume that the time for each execution of a function can be expressed by the total time for the function divided by the number of times the function is called. Thus the time propagated along the call graph arcs to the function's parents is directly proportional to the number of times that arc is traversed. Parents that are not themselves profiled will have the time of their profiled children propagated to them, but they will appear to be sponta- neously invoked in the call graph listing, and will not have their time propagated further. Similarly, signal catchers, even though pro- filed, will appear to be spontaneous (although for more obscure reasons). Any profiled children of signal catchers should have their times propagated properly, unless the signal catcher was invoked during the execution of the profiling routine, in which case all is lost. The profiled program must call exit(3) or return normally for the profiling information to be saved in the graph profile file. BSD
December 25, 2008 BSD
All times are GMT -4. The time now is 08:49 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy