| Abstract |
|---|
| This paper deals with the problem of scheduling a specific precedence task graph , namely the Fork graph, under the LogP model. LogP is an architectural model more sophisticated than the usual ones which was introduced to be closer to actual machines. We present a scheduling algorithm and we show that this algorithm is optimal under some assumptions especially when the messages have the same size and when the gap is equal to the overhead. |
| Contact |
| Iskander Kort LMC-IMAG,BP53 Domaine Universitaire,38041, Grenoble Cedex 9, France Iskander.kort@imag.fr |