Re: [Algorithms] General purpose task parallel threading approach

[Jarkko L. <al...@gm...>]

Task priorities are updated once per frame, but there is no list of tasks to
be sorted before execution of tasks begins. That's purely your own wrong
conclusion drawn from. wherever. So, it's online scheduler in the sense that
tasks are spawn "randomly" within tasks, but their priorities are determined
in the end of the frame for next execution based on task dependencies and
execution times. That clears things up? If not, please ask rather than draw
further wrong conclusions.

 

 

Cheers, Jarkko

 

  _____  

From: Sebastian Sylvan [mailto:seb...@gm...] 
Sent: Saturday, April 11, 2009 8:51 PM
To: Game Development Algorithms
Subject: Re: [Algorithms] General purpose task parallel threading approach

 

 

On Sat, Apr 11, 2009 at 6:42 PM, Jarkko Lempiainen <al...@gm...>
wrote:

> Where am I going wrong here?

 

I already clearly told you that I don't define dependencies beforehand but
they are defined at call site, so you are going wrong starting from your 1st
assumption. I'm sorry, but why do I have to keep repeating myself and
correcting your false assumptions if you are not disregard what people tell
you?

Probably because you also say that you sort your tasks ahead of time, which
is a contradiction. So are you now saying that your scheduler is *not* an
ahead-of-time scheduler but actually an on-line one?

 


-- 
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862