tures
You can compile and test the emulation codes by:
$ make test_fib_by_hand
$ export OMP_NUM_THREADS=(int number)
$ ./test_fib_by_hand (N for fib(N))
[3] http://nanos.ac.upc.edu/content/barcelona-openmp-task-suite
Sho Nakatani
libgomp_lock_fib.eps
Description: PostScript document
Hello Tobias,
> I think it makes sense to start working on libgomp; even if the chosen
> implementation is not perfect, one can make real-world experiments with
> it. Additionally, to be used at the end, it has to end up in libgomp.
Thank you for your advice.
I'll work on libg
Hi Jakub,
> Yeah. And, please post patches from time to time, even if they aren't
> completely finished, so that others can comment on them.
OK. I'll work on it.
Sho Nakatani
P_taskexit" ABI.
Sho Nakatani
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 Intel C
Compiler.
https://github.com/laysa
to show the reason why GOMP is slower compared to icc implementation
but to make my idea clear for myself :-)
So, I need to know OpenMPI API to get tasks info like:
- A task is created
- A task finished its job
- On which CPU core a task is on
Do you know any document?
Thanks,
--
Sho Nakatani
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 try
a sleeping thread if there are tasks it can transitively taskwait
> for, as if those don't complete, the current taskwait won't return.
>
> Jakub
--
Sho Nakatani
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
>>
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
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,
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:
>>>>
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 i
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
> start with tied for now and see if you have enough time.
Yeah. Although it is difficult to implement both tied and untied task,
I'll continue to try them after GSoC term finish.
> Antoniu
Thanks,
--
Sho Nakatani
Hi,
I'm Sho Nakatani, accepted by Google Summer of Code 2011.
I'm trying to add speed-up to libgomp, an OpenMP implementaion in GCC.
As GSoC project, I'll focus on OpenMP `task' directive (especially `tied task').
Around the beginning of April, some members here told
s more important at this
> point...
In GSoC project, I will not implement LTC but just focus on schedulers
which Nanos4 has already has.
I'll first implement `tied task' using breadth-first scheduler, and after that
I'll implement `untied task' using work-first scheduler (if I have time).
Thanks,
--
Sho Nakatani
OpenMP Tasks in Nanos v4, X. Teruel et al.
> - OpenMP 3.0 Tasking Implementation in OpenUH, C. Addison et al.
> - A Runtime Implementation of OpenMP Tasks, J. LaGrone et al.
Thanks. I'll read all of them ;-)
--
Sho Nakatani
is related to other ones
like taskwait, barrier, and parallel.
Thanks,
--
Sho Nakatani
so and current global task queue in libgomp is replaced by new
data structures, most accesses to task queues should be rewrote, then
most codes related to task scheduler should be rewrote, too.
Give me any comment freely on this point since it is very important
point in my project ;-)
Thanks,
--
Sho Nakatani
20 matches
Mail list logo
