In this paper we propose a new scheduling algorithm for a three-dimensional grid precedence graph of size n (3D-grid in short). This work is an extension of.

We propose a new scheduling algorithm for a three-dimensional grid precedence graph of size n, and we prove that the communication overhead is just in Θ(log ...

Abstract: We propose a new scheduling algorithm for a three-dimensional grid precedence graph of size n, and we prove that the communication overhead is ...

We propose a new scheduling algorithm for a three-dimensional grid precedence graph of size n, and we prove that the communication overhead is just in Θ( log ...

First, we compute a lower bound of the overhead and we present two simple algorithms, easy to implement, with an overhead of O (n 9 4 ) and O(n2) respectively.

First, we compute a lower bound of the overhead and we present two simple algorithms, easy to implement, with an overhead of O (n 9 4 ) and O(n2) respectively.

König, D. Trystram, A Low overhead schedule for a 3D-Grid Graph, Parallel Processing Letters 2 4 363–372 (1992). Article Google Scholar.

For its solution, we propose a mixed integer linear programming model, and an adaptive large neighborhood search metaheuristic which invokes several shaking and ...

König and D. Trystram, A low overhead schedule for a 3D-grid graph. Parallel Proces. Lett. 2 (1992). [Google Scholar]; E. Bampis, A. Giannakos and J-C. König ...