-
Notifications
You must be signed in to change notification settings - Fork 3
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Configure algorithm runtime, don't schedule data object nodes as algortihms #21
Conversation
based on Mateusz's ideas without the datadeps updates
* added size_kb field to store size as a double * adjusted scheduling.jl treatment of size to align with test graphs
Changed size_kb to size_average_B
A future of an algorithm execution is stored in the successor DataObject vertices. I like this conceptually but would it work also for graphs in which all the paths are terminated by a algorithm (consumer algorithm that only takes input but doesn't produce any output)? |
I tried with How about the
function is_terminating_alg(graph::AbstractGraph, vertex_id::Int)
successor_dataobjects = outneighbors(graph, vertex_id)
is_terminating(vertex) = isempty(outneighbors(graph, vertex))
all(is_terminating, successor_dataobjects)
end and then append What do you think? |
We could store futures in the algorithm as well as its children, which should resolve it. I do like the idea of |
Both is good |
BEGINRELEASENOTES
Struct allows algorithm to access information about its vertex, including average runtime and size.
Ideas taken from @m-fila in #19.
ENDRELEASENOTES