|About Mapping and Scheduling email@example.com (2008-07-11)|
|Re: About Mapping and Scheduling firstname.lastname@example.org (kamal) (2008-07-15)|
|Date:||Tue, 15 Jul 2008 06:56:23 -0700 (PDT)|
|Posted-Date:||19 Jul 2008 14:43:38 EDT|
On Jul 11, 6:42 pm, milla....@gmail.com wrote:
> Does there exist any compilers with these functions or addressing the
> following issues:
> 1.Given a task graph generated from program, allocate all the tasks,
> or to say "mapping the tasks to processors"
there are some parallel constructs defined by various languages like
fortran and C. There is UPC (unified parallel C) and HPF (high
performance fortran) which provide you with the desired constructs.
Instead of providing a task graph, you would need to put in parallel
those parts of code, which will end up as siblings in a task graph,
and sequwntialize code which ends up as a parent-child relationship in
> 2.the compilers do some task scheduling work according to some
> parameters(such as task execution time,etc) to minimize the cost
some amount of estimation can be done about task execution time
statically eg:- matrix calculations. But beyond that, a compiler
cannot statically predict how much time a task is guaranteed to take.
There are some runtime managers available like charm++ -which will do
some kind of load balancing.
> Any compilers have implemented these or correspond to these issues?
HP has an autopar option in the C compiler shipped by it. This one
does parallelization for you. If you want to use parallel constructs
as defined by the language, then it depends on the language and not
> And any good paper or research result related to these ?
look up HPF and UPC
Return to the
Search the comp.compilers archives again.