phaniarnab opened a new pull request, #1827: URL: https://github.com/apache/systemds/pull/1827
This patch adds an initial version of cost-based instruction ordering. The idea is to apply a non-recursive exhaustive search to find all the possible orders and select the order with the minimum cost under memory constraints. We propagate the memory and compute estimates from HOPs to LOPs. Moreover, we simplify the DAG by removing literals and transient read, writes to reduce the search space. -- 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: dev-unsubscr...@systemds.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org
