Skip to content
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.

Sign up for GitHub

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

Feat straighten task nodes #8347

Merged
merged 23 commits into from
Jun 17, 2022
Merged

Feat straighten task nodes #8347

Show file tree
Hide file tree
Changes from 13 commits
Commits
Show all changes
23 commits
Select commit Hold shift + click to select a range
213cfa1
Add a fast topological traversal
Yipeng1994 May 26, 2022
ea6370a
Add an initial implementation of straighen nodes
Yipeng1994 May 26, 2022
d99ebf4
Add the straighen nodes algorithm
Yipeng1994 May 26, 2022
e807d0b
Change algorithm structure
Yipeng1994 May 26, 2022
c438bda
Remove some debug information
Yipeng1994 May 26, 2022
1f70c6b
Finalize the straighten algorithm after
Yipeng1994 Jun 1, 2022
20b3925
Notify the usage of straighten algorithm
Yipeng1994 Jun 1, 2022
71cac09
Of format
Yipeng1994 Jun 14, 2022
840b8de
Update oneflow/core/graph/straighten_nodes.cpp
Yipeng1994 Jun 14, 2022
fc65801
Of format
Yipeng1994 Jun 14, 2022
2682005
Stop using visual string before we find a better key
Yipeng1994 Jun 14, 2022
e8917a7
Remove magic numbers and Of format
Yipeng1994 Jun 14, 2022
86d2499
Remove starts
Yipeng1994 Jun 15, 2022
c480685
Of format
Yipeng1994 Jun 15, 2022
c532e7c
Fix a bug of using GetMaxVal<int32_t>() as an
Yipeng1994 Jun 15, 2022
60e7800
Refactor add straighten algo interface (#8435)
wyg1997 Jun 16, 2022
2f0b93b
Use TopoForEachNodeFast as default. (#8436)
Yipeng1994 Jun 17, 2022
19f0e81
Rename the switch and code clean up
Yipeng1994 Jun 17, 2022
513828c
Hide the class TopoStruct
Yipeng1994 Jun 17, 2022
e1bd526
Hide all the other functions
Yipeng1994 Jun 17, 2022
de4c5ae
Grammar
Yipeng1994 Jun 17, 2022
032092c
Merge branch 'master' into feat-straighten_task_nodes
Yipeng1994 Jun 17, 2022
5232350
Of format
Yipeng1994 Jun 17, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
48 changes: 48 additions & 0 deletions oneflow/core/graph/graph.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,8 +35,10 @@ class Graph {
void ForEachNode(std::function<void(NodeType*)> NodeHandler) const;
Maybe<void> MaybeForEachNode(std::function<Maybe<void>(NodeType*)> NodeHandler) const;
void TopoForEachNode(std::function<void(NodeType*)> NodeHandler) const;
void TopoForEachNodeFast(std::function<void(NodeType*)> NodeHandler) const;
Maybe<void> TopoForEachNodeWithErrorCaptured(
std::function<Maybe<void>(NodeType*)> NodeHandler) const;
Maybe<void> TopoForEachNodeFastMaybe(std::function<Maybe<void>(NodeType*)> NodeHandler) const;
void ReverseTopoForEachNode(std::function<void(NodeType*)> NodeHandler) const;
void ForEachEdge(std::function<void(EdgeType*)> EdgeHandler) const;

Expand Down Expand Up @@ -65,6 +67,11 @@ class Graph {
const std::function<void(NodeType*, const std::function<void(NodeType*)>&)>& ForEachOutNode,
const std::function<Maybe<void>(NodeType*)>& Handler) const;

Maybe<void> TopoForEachNodeFastMaybe(
const std::function<void(NodeType*, const std::function<void(NodeType*)>&)>& ForEachInNode,
const std::function<void(NodeType*, const std::function<void(NodeType*)>&)>& ForEachOutNode,
const std::function<Maybe<void>(NodeType*)>& Handler) const;

void DfsTopoForEachNode(
const std::list<NodeType*>& starts,
const std::function<void(NodeType*, const std::function<void(NodeType*)>&)>& ForEachInNode,
Expand Down Expand Up @@ -217,13 +224,30 @@ void Graph<NodeType, EdgeType>::TopoForEachNode(std::function<void(NodeType*)> N
NodeHandler);
}

template<typename NodeType, typename EdgeType>
void Graph<NodeType, EdgeType>::TopoForEachNodeFast(
std::function<void(NodeType*)> NodeHandler) const {
CHECK_JUST(TopoForEachNodeFastMaybe(&NodeType::ForEachNodeOnInEdge,
&NodeType::ForEachNodeOnOutEdge, [&](NodeType* node) {
NodeHandler(node);
return Maybe<void>::Ok();
}));
}

template<typename NodeType, typename EdgeType>
Maybe<void> Graph<NodeType, EdgeType>::TopoForEachNodeWithErrorCaptured(
std::function<Maybe<void>(NodeType*)> NodeHandler) const {
return TopoForEachNodeWithErrorCaptured(source_nodes(), &NodeType::ForEachNodeOnInEdge,
&NodeType::ForEachNodeOnOutEdge, NodeHandler);
}

template<typename NodeType, typename EdgeType>
Maybe<void> Graph<NodeType, EdgeType>::TopoForEachNodeFastMaybe(
std::function<Maybe<void>(NodeType*)> NodeHandler) const {
return TopoForEachNodeFastMaybe(&NodeType::ForEachNodeOnInEdge, &NodeType::ForEachNodeOnOutEdge,
NodeHandler);
}

template<typename NodeType, typename EdgeType>
void Graph<NodeType, EdgeType>::SortedTopoForEachNode(
std::function<bool(const EdgeType* lhs, const EdgeType* rhs)> LessThan,
Expand Down Expand Up @@ -537,6 +561,30 @@ Maybe<void> Graph<NodeType, EdgeType>::TopoForEachNodeWithErrorCaptured(
return Maybe<void>::Ok();
}

template<typename NodeType, typename EdgeType>
Maybe<void> Graph<NodeType, EdgeType>::TopoForEachNodeFastMaybe(
Yipeng1994 marked this conversation as resolved.
Show resolved Hide resolved
const std::function<void(NodeType*, const std::function<void(NodeType*)>&)>& ForEachInNode,
const std::function<void(NodeType*, const std::function<void(NodeType*)>&)>& ForEachOutNode,
const std::function<Maybe<void>(NodeType*)>& Handler) const {
HashMap<NodeType*, int32_t> counter_in;
std::queue<NodeType*> queue;
ForEachNode([&](NodeType* node) {
int32_t count = 0;
ForEachInNode(node, [&](NodeType*) { count++; });
counter_in[node] = count;
if (count == 0) { queue.push(node); }
});
Yipeng1994 marked this conversation as resolved.
Show resolved Hide resolved
while (!queue.empty()) {
NodeType* cur_node = queue.front();
queue.pop();
JUST(Handler(cur_node));
ForEachOutNode(cur_node, [&](NodeType* out) {
if (--counter_in[out] == 0) { queue.push(out); }
Yipeng1994 marked this conversation as resolved.
Show resolved Hide resolved
});
}
return Maybe<void>::Ok();
}

template<typename NodeType, typename EdgeType>
void Graph<NodeType, EdgeType>::DfsTopoForEachNodeSortByDistanceToSink(
const std::list<NodeType*>& starts,
Expand Down
Loading