| 952 | } |
| 953 | |
| 954 | double Model::OutputTime(std::shared_ptr<Node> node, |
| 955 | std::map<string, double>* gradient) { |
| 956 | std::vector<double> input_times(1, 0); |
| 957 | // TODO(jsimsa): Now that we are accounting for buffer size in wait time |
| 958 | // computation, assuming that the input is infinitely fast will result in |
| 959 | // inaccurate estimates of the output latency. |
| 960 | // |
| 961 | // We should compute the output latency as a fix-point of the following |
| 962 | // equation: `output_time = node(OutputTime(input_times(1, output_time))`. |
| 963 | return node->OutputTime(&input_times, gradient); |
| 964 | } |
| 965 | |
| 966 | double Model::TotalBufferedBytes(std::shared_ptr<Node> node) { |
| 967 | return node->TotalBufferedBytes(); |
no outgoing calls