6.8 KiB
6.8 KiB
compilation :
gcc -g -pg -o student_rank student_rank.c heapsort.c bubblesort.c
premier test:
./student_rank 5 5 1
lancement de gprof:
gprof ./student_rank
Each sample counts as 0.01 seconds.
no time accumulated
% cumulative self self total
time seconds seconds calls Ts/call Ts/call name
0.00 0.00 0.00 30 0.00 0.00 bubblesort
0.00 0.00 0.00 25 0.00 0.00 find_rank_student
0.00 0.00 0.00 10 0.00 0.00 print_array
0.00 0.00 0.00 5 0.00 0.00 generate_array
0.00 0.00 0.00 2 0.00 0.00 free_array
0.00 0.00 0.00 2 0.00 0.00 print_student_array
0.00 0.00 0.00 1 0.00 0.00 generate_grades
0.00 0.00 0.00 1 0.00 0.00 generate_ranks
0.00 0.00 0.00 1 0.00 0.00 sort_students
30 appel de bubblesort et 25 appel de find_rank_student
call graph :
granularity: each sample hit covers 2 byte(s) no time propagated
index % time self children called name
0.00 0.00 5/30 sort_students [9]
0.00 0.00 25/30 find_rank_student [2]
[1] 0.0 0.00 0.00 30 bubblesort [1]
-----------------------------------------------
0.00 0.00 25/25 sort_students [9]
[2] 0.0 0.00 0.00 25 find_rank_student [2]
0.00 0.00 25/30 bubblesort [1]
-----------------------------------------------
0.00 0.00 10/10 print_student_array [6]
[3] 0.0 0.00 0.00 10 print_array [3]
-----------------------------------------------
0.00 0.00 5/5 generate_grades [7]
[4] 0.0 0.00 0.00 5 generate_array [4]
-----------------------------------------------
0.00 0.00 2/2 main [16]
[5] 0.0 0.00 0.00 2 free_array [5]
-----------------------------------------------
0.00 0.00 2/2 main [16]
[6] 0.0 0.00 0.00 2 print_student_array [6]
0.00 0.00 10/10 print_array [3]
-----------------------------------------------
0.00 0.00 1/1 main [16]
[7] 0.0 0.00 0.00 1 generate_grades [7]
0.00 0.00 5/5 generate_array [4]
-----------------------------------------------
0.00 0.00 1/1 main [16]
[8] 0.0 0.00 0.00 1 generate_ranks [8]
-----------------------------------------------
0.00 0.00 1/1 main [16]
[9] 0.0 0.00 0.00 1 sort_students [9]
0.00 0.00 25/25 find_rank_student [2]
0.00 0.00 5/30 bubblesort [1]
-----------------------------------------------
- 30 appel de bubblesort
- 5 appel de sort_student
- 25 appel de find_rank_student
sort_student appel 25 fois find_rank_student et 5 fois bubblesort
find_rank_student appel 25 fois bubblesort
nouveau scénario via la commande suivante :
./student_rank 1000 1000 0
lancement de gprof :
gprof ./student_rank
résultats:
Each sample counts as 0.01 seconds.
% cumulative self self total
time seconds seconds calls s/call s/call name
83.16 5.11 5.11 1001000 0.00 0.00 bubblesort
16.30 6.11 1.00 1000000 0.00 0.00 find_rank_student
0.65 6.15 0.04 1 0.04 6.15 sort_students
0.00 6.15 0.00 1000 0.00 0.00 generate_array
0.00 6.15 0.00 2 0.00 0.00 free_array
0.00 6.15 0.00 1 0.00 0.00 generate_grades
0.00 6.15 0.00 1 0.00 0.00 generate_ranks
- 1001000 appel de bubblesort
- 1000000 appel de find_rank_student
execution du programme en 6.15s
call graph :
granularity: each sample hit covers 2 byte(s) for 0.16% of 6.15 seconds
index % time self children called name
0.04 6.11 1/1 main [2]
[1] 100.0 0.04 6.11 1 sort_students [1]
1.00 5.10 1000000/1000000 find_rank_student [3]
0.01 0.00 1000/1001000 bubblesort [4]
-----------------------------------------------
<spontaneous>
[2] 100.0 0.00 6.15 main [2]
0.04 6.11 1/1 sort_students [1]
0.00 0.00 2/2 free_array [6]
0.00 0.00 1/1 generate_grades [7]
0.00 0.00 1/1 generate_ranks [8]
-----------------------------------------------
1.00 5.10 1000000/1000000 sort_students [1]
[3] 99.3 1.00 5.10 1000000 find_rank_student [3]
5.10 0.00 1000000/1001000 bubblesort [4]
-----------------------------------------------
0.01 0.00 1000/1001000 sort_students [1]
5.10 0.00 1000000/1001000 find_rank_student [3]
[4] 83.1 5.11 0.00 1001000 bubblesort [4]
-----------------------------------------------
0.00 0.00 1000/1000 generate_grades [7]
[5] 0.0 0.00 0.00 1000 generate_array [5]
-----------------------------------------------
0.00 0.00 2/2 main [2]
[6] 0.0 0.00 0.00 2 free_array [6]
-----------------------------------------------
0.00 0.00 1/1 main [2]
[7] 0.0 0.00 0.00 1 generate_grades [7]
0.00 0.00 1000/1000 generate_array [5]
-----------------------------------------------
0.00 0.00 1/1 main [2]
[8] 0.0 0.00 0.00 1 generate_ranks [8]
-----------------------------------------------
arbre d'appel du programme :
main |-->generate_grades | |-->generate_array |-->generate_ranks |-->sort_students | |-->find_rank_student | | |-->bubblesort | |-->bubblesort |-->free_array## optimisation du programme : ## - réduire les appel de bubblesort - optimiser bubbesort (plus complexe) - réduire les appel de sort_student car elle appelle les autres fonctions ### changmenent effectué : ### suppression de la ligne 58 de student_rank.c