>>
>> As far as I know (I have not verified the source) they do.
>
> That's important information.
> If you remember the source, please tell me about it.
Sorry, I meant I didn't verify the "source code" :)
Jakub is right though, the paper clearly presents performance results
on tied vs. untied, so
From: Antoniu Pop
Date: Tue, 5 Apr 2011 17:45:18 +0200
>> Thanks a lot for your kind advice.
>> Then my latest plan is:
>> - Learn other implementations (as Antoniu said)
>> - Learn Mercurium implementation
>> - Implement the same/similar feature as Mercurium in libgomp/ ,
>> then evaluate it
>>
From: Jakub Jelinek
Date: Tue, 5 Apr 2011 17:43:57 +0200
> Content-Type: text/plain; charset=us-ascii
> Content-Disposition: inline
> Subject: Re: Give me advice on GSoC OpenMP
> From: Jakub Jelinek
> To: Sho Nakatani
> Cc: gcc@gcc.gnu.org, antoniu@mines-paristech.fr
> Thanks a lot for your kind advice.
> Then my latest plan is:
> - Learn other implementations (as Antoniu said)
> - Learn Mercurium implementation
> - Implement the same/similar feature as Mercurium in libgomp/ ,
> then evaluate it
> (This is the goal for GSoC project)
>
> However, I currently k
On Wed, Apr 06, 2011 at 12:40:21AM +0900, Sho Nakatani wrote:
> Thanks a lot for your kind advice.
> Then my latest plan is:
> - Learn other implementations (as Antoniu said)
> - Learn Mercurium implementation
> - Implement the same/similar feature as Mercurium in libgomp/ ,
> then evaluate it
>
From: Jakub Jelinek
Date: Tue, 5 Apr 2011 17:22:04 +0200
> On Wed, Apr 06, 2011 at 12:16:13AM +0900, Sho Nakatani wrote:
>> OK. I'll do it as soon as possible.
>> Then, my current plan is:
>> - Learn other implementations (as Antoniu said)
>> - Learn Mercurium implementation
>> - Implement the sa
From: Antoniu Pop
Date: Tue, 5 Apr 2011 15:45:26 +0200
> On Tue, Apr 5, 2011 at 3:01 PM, Sho Nakatani wrote:
>> From: Jakub Jelinek
>> Date: Tue, 5 Apr 2011 08:33:23 +0200
>>
>>> On Tue, Apr 05, 2011 at 11:05:01AM +0900, Sho Nakatani wrote:
- When task A encounters "#pragma omp task" der
On Wed, Apr 06, 2011 at 12:16:13AM +0900, Sho Nakatani wrote:
> OK. I'll do it as soon as possible.
> Then, my current plan is:
> - Learn other implementations (as Antoniu said)
> - Learn Mercurium implementation
> - Implement the same/similar feature as Mercurium in libgomp/ ,
> then evaluate it
From: Jakub Jelinek
Date: Tue, 5 Apr 2011 16:37:48 +0200
> On Tue, Apr 05, 2011 at 03:45:26PM +0200, Antoniu Pop wrote:
>> On Tue, Apr 5, 2011 at 3:01 PM, Sho Nakatani wrote:
>> > From: Jakub Jelinek
>> > Date: Tue, 5 Apr 2011 08:33:23 +0200
>> > Yes. Also, Lazy Task Creation has another good a
On Tue, Apr 5, 2011 at 4:37 PM, Jakub Jelinek wrote:
> On Tue, Apr 05, 2011 at 03:45:26PM +0200, Antoniu Pop wrote:
>> On Tue, Apr 5, 2011 at 3:01 PM, Sho Nakatani wrote:
>> > From: Jakub Jelinek
>> > Date: Tue, 5 Apr 2011 08:33:23 +0200
>> > Yes. Also, Lazy Task Creation has another good aspect
On Tue, Apr 05, 2011 at 03:45:26PM +0200, Antoniu Pop wrote:
> On Tue, Apr 5, 2011 at 3:01 PM, Sho Nakatani wrote:
> > From: Jakub Jelinek
> > Date: Tue, 5 Apr 2011 08:33:23 +0200
> > Yes. Also, Lazy Task Creation has another good aspect.
> > Look at the pictures below. Both shows the call-tree o
On Tue, Apr 5, 2011 at 3:01 PM, Sho Nakatani wrote:
> From: Jakub Jelinek
> Date: Tue, 5 Apr 2011 08:33:23 +0200
>
>> On Tue, Apr 05, 2011 at 11:05:01AM +0900, Sho Nakatani wrote:
>>> - When task A encounters "#pragma omp task" derective, worker creates a
>>> task
>>> and immediately execu
From: Jakub Jelinek
Date: Tue, 5 Apr 2011 08:33:23 +0200
> On Tue, Apr 05, 2011 at 11:05:01AM +0900, Sho Nakatani wrote:
>> - When task A encounters "#pragma omp task" derective, worker creates a
>> task
>> and immediately execute it. Worker pushes A to the head of deque.
>
> Immediately
On Tue, Apr 05, 2011 at 11:05:01AM +0900, Sho Nakatani wrote:
> - When task A encounters "#pragma omp task" derective, worker creates a task
> and immediately execute it. Worker pushes A to the head of deque.
Immediately starting a freshly created task on #pragma omp task is nice for
cache
From: Jakub Jelinek
Date: Mon, 4 Apr 2011 20:15:38 +0200
> On Sun, Apr 03, 2011 at 08:10:25PM +0200, Jakub Jelinek wrote:
>> On Sun, Apr 03, 2011 at 07:27:12PM +0900, Sho Nakatani wrote:
>> > Then, I'll compare the trees created by gcc and icc, and point out
>> > that the implementation of OpenMP
Hi. Sorry for being late.
> Depends on what you mean by lazy task creation, gcc schedules
> tasks lazily if they aren't if (0), some data structure if created
> for them when encountering #pragma omp task directive, but I guess
> any implementation will do something like that.
I mean the followin
On Sun, Apr 03, 2011 at 08:10:25PM +0200, Jakub Jelinek wrote:
> On Sun, Apr 03, 2011 at 07:27:12PM +0900, Sho Nakatani wrote:
> > Then, I'll compare the trees created by gcc and icc, and point out
> > that the implementation of OpenMP Task uses Lazy Task Creation while
> > gcc does not.
>
> Depen
On Sun, Apr 03, 2011 at 07:27:12PM +0900, Sho Nakatani wrote:
> Then, I'll compare the trees created by gcc and icc, and point out
> that the implementation of OpenMP Task uses Lazy Task Creation while
> gcc does not.
Depends on what you mean by lazy task creation, gcc schedules
tasks lazily if th
From: Richard Guenther
Date: Sun, 3 Apr 2011 09:28:49 +0200
> On Sat, Apr 2, 2011 at 10:53 AM, Sho Nakatani wrote:
>> Hi!
>>
>> 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.
>>
>> T
On Sat, Apr 2, 2011 at 10:53 AM, Sho Nakatani wrote:
> Hi!
>
> 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
Hi all,
I conducted another experiment.
Compiler version:
- gcc (GCC) 4.7.0 20110331 (experimental)
- icc (ICC) 12.0.3 20110309
CPU info:
32 AMD CPUs. Each has 4 cores.
I calculated fibonacci(37) both by gcc and icc.
As the OMP_NUM_THREADS increase,
- gcc increased the exec time steadly.
21 matches
Mail list logo
