issues
search
dice-group
/
hypertrie
A flexible data structure for low-rank (≤ 5), sparse tensors supporting slices by any dimension and Einstein summation (einsum).
https://tentris.dice-research.org/
Apache License 2.0
14
stars
4
forks
source link
optimize the Cartesian Operator
#57
Open
bigerl
opened
4 years ago
bigerl
commented
4 years ago
The Cartesian operator should:
[x] estimate which is the largest of its operands (which it should iterate)
[ ] calculate it's operand's results in parallel (all of them exept the one which is evaluated live)
[ ] advanced: calculate all operand's results in advance and start returning results as soon as all but one have finished
[ ] even more advanced: start returning results immediately as soon as each of it's operands has calculated at least one result
The Cartesian operator should: