computeChains with nomnigraph (#15366)
authorBram Wasti <bwasti@fb.com>
Wed, 19 Dec 2018 22:31:06 +0000 (14:31 -0800)
committerFacebook Github Bot <facebook-github-bot@users.noreply.github.com>
Wed, 19 Dec 2018 23:04:23 +0000 (15:04 -0800)
commit055de167d5aecab73423174e5be3b1bad0a55a03
tree54b0b3243d971c9d290f4cf38d5a2e86bcff3fa1
parent9217bde807115bf8e161dc54faeed0851a247780
computeChains with nomnigraph (#15366)

Summary:
Pull Request resolved: https://github.com/pytorch/pytorch/pull/15366

swap the old implementation with a slightly easier one to understand

I ran the tests and compared the number of chains compared to the old algorithm.  This one outperforms on every test, but we have yet to see if that impacts performance at all.

old chain 34 nomnigraph chain 25
old chain 46 nomnigraph chain 34
old chain 228 nomnigraph chain 188
old chain 397 nomnigraph chain 338

Reviewed By: ilia-cher

Differential Revision: D13057451

fbshipit-source-id: ccd050bfead6eb94ab9c7b0a70b09a22c2b9e499
caffe2/core/net_async_base.cc
caffe2/core/net_dag_utils.cc
caffe2/core/net_dag_utils.h
caffe2/python/test/executor_test.py