dawidwys commented on pull request #16655: URL: https://github.com/apache/flink/pull/16655#issuecomment-893201393
First a few questions to the description. Most probably I just don't understand what is written there. >The processors of a partly finished vertex connected via ALL_TO_ALL edges must be fully finished if the vertex is partly finished. > The processors of a partly finished vertex connected via POINTWISE edges must be partly finished or fully finished if the vertex is partly finished. Do you mean successors or predecessors in those cases? I guess you meant predecessors, right? > Currently there is only one bad case is that for a graph composed of source1 -> forward() -> map1 and source2 -> forword with key -> map2[with keyed state] and source2 and map2 are connected via DataStreamUtils#reinterpretAsKeyedStream(), and after all the vertices become partly finished, users create a new graph with source1 -> forward with key -> map2[with keyed state]. I don't get this example. Could you try to explain it a bit more? Do you mean a checkpoint is used by a completely different graph? Is the original graph a disjoint graph? I have a hard time understanding it. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
