Jun 30, 2006 · This paper deals with the problem of scheduling a specific precedence task graph, namely the Fork graph, under the LogP model.
precedence task graph , namely the Fork graph, under the LogP model. LogP is a computational model more sophisticated than the usual ones.
Scheduling Fork Graphs under LogP with an Unbounded Number of Processors. Authors: Iskander Kort. Iskander Kort. View Profile. , Denis Trystram. Denis Trystram.
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 ...
length schedule for a fork graph on an unrestricted number of processors can be constructed in polynomial time [5]. 4 A 2-approximation algorithm. In this ...
Missing: Unbounded | Show results with:Unbounded
We first report some experiments on an IBM-SP machine to assess this model. Then the problem of scheduling a Fork graph with an unbounded number of processors ...
We present a low-complexity heuristic, named the, dominant sequence clustering algorithm (DSC), for scheduling parallel tasks on an unbounded number of ...
Missing: LogP | Show results with:LogP
Oct 22, 2024 · We present a low-complexity heuristic, named the dominant sequence clustering algorithm (DSC), for scheduling parallel tasks on an unbounded ...
Missing: LogP | Show results with:LogP
Scheduling Fork Graphs under LogP with an Unbounded Number of Processors · I. KortD. Trystram. Computer Science. Euro-Par. 1998. This paper deals with the ...
is tractable when the number of processors is unbounded and when either the tree is flat or the communication times are not greater than the execution times ...