This is the mail archive of the
mailing list for the GCC project.
Re: Give me advice on GSoC OpenMP
- From: Richard Guenther <richard dot guenther at gmail dot com>
- To: Sho Nakatani <dev dot laysakura at gmail dot com>
- Cc: gcc at gcc dot gnu dot org
- Date: Sun, 3 Apr 2011 09:28:49 +0200
- Subject: Re: Give me advice on GSoC OpenMP
- References: <email@example.com>
On Sat, Apr 2, 2011 at 10:53 AM, Sho Nakatani <firstname.lastname@example.org> wrote:
> I'm Sho Nakatani, a student of the University of Tokyo, Japan.
> I'd like to tackle GSoC this year!
> I'm trying to speed up the OpenMP implementation in GCC.
> The following graph shows the OpenMP in GCC is much slower than that of Intel C Compiler.
> Here is the code I on measured the exec time.
> And I compiled it by the following command:
> ? ?gcc -O3 -fopenmp -o openmp-fibonacci-gcc openmp-fibonacci.c
> ? ?icc -O3 -openmp -o openmp-fibonacci-icc openmp-fibonacci.c
> After that, I executed them on a machine with 32 AMD CPUs (each has 4 cores).
> Currently, I'm planning to change the algorighm of `task' premitive in `libgomp'.
> This plan is of course for GSoC but also for my graduation thesis.
> My teacher has some idea on the better algorithm (but I haven't learned it yet).
> Are there any advice from the members of GCC ML?
> Anything is OK:
> Although I know some about C programming and I have implemented a very small
> C compiler myself, I'm quite new to GCC.
> I welcome advice on how to get accepted from GSoC, too :-)
What does your fibonacci testcase trying to measure? It looks like it is
measuring thread creation/switching time only.
> Sho Nakatani