We present scheduling techniques considering the source code as well as the task graph of a parallel program. This approach
allows to chose the proper scheduling algorithm and to estimate the execution time of the target program. We demonstrate this
on stencil computations and their optimizations.