Scheduling Fork graphs under LogP with an unbounded number of processors
This paper deals with the problem of scheduling a specific precedence task graph, namely the Fork graph, under the LogP model. LogP is a computational model more sophisticated than the usual ones which was introduced to be closer to actual machines.
We present a scheduling algorithm for this kind of graphs. Our algorithm is optimal under some assumptions especially when the messages have the same size and when the gap is equal to the overhead.
Unable to display preview. Download preview PDF.
- 1.P. Chrétienne. Task Scheduling over Distributed Memory Machines. In North Holland, editor, International Workshop on Parallel and Distributed Algorithms, 1989.Google Scholar
- 2.P. Chrétienne. Complexity of Tree-scheduling with Interprocessor Communication Delays. Technical Report 90.5, MASI, Pierre and Marie Curie University, Paris, 1990.Google Scholar
- 5.W. Löwe, M. Middendorf, and W. Zimmermann. Scheduling Inverse Trees under the Communication Model of the LogP-Machine. Theoretical Computer Science, 1997. to appear.Google Scholar
- 6.J. Verriet. Scheduling Tree-structured Programs in the Logp Model. Technical Report UU-CS-1997-18, Department of Computer Science, Utrecht University, 1997.Google Scholar