Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Marked a few tensor operations as read only | Benoit Steiner | 2016-05-05 |
| | |||
* | Deleted trailing commas | Benoit Steiner | 2016-04-29 |
| | |||
* | Fixed the partial evaluation of non vectorizable tensor subexpressions | Benoit Steiner | 2016-04-25 |
| | |||
* | Eigen cost model part 1. This implements a basic recursive framework to ↵ | Rasmus Munk Larsen | 2016-04-14 |
| | | | | estimate the cost of evaluating tensor expressions. | ||
* | Marked variables that's only used in debug mode as such | Benoit Steiner | 2016-03-21 |
| | |||
* | Decoupled the packet type definition from the definition of the tensor ops. ↵ | Benoit Steiner | 2016-03-08 |
| | | | | All the vectorization is now defined in the tensor evaluators. This will make it possible to relialably support devices with different packet types in the same compilation unit. | ||
* | Added missing EIGEN_DEVICE_FUNC qualifier | Benoit Steiner | 2016-01-24 |
| | |||
* | Record whether the underlying tensor storage can be accessed directly during ↵ | Benoit Steiner | 2016-01-19 |
| | | | | the evaluation of an expression. | ||
* | Misc improvements and optimizations | Benoit Steiner | 2015-07-01 |
| | |||
* | Silenced a few compilation warnings generated by nvcc | Benoit Steiner | 2015-02-10 |
| | |||
* | Improved support for RowMajor tensors | Benoit Steiner | 2015-01-14 |
| | | | | Misc fixes and API cleanups. | ||
* | Misc improvements and cleanups | Benoit Steiner | 2014-10-13 |
| | |||
* | Improved the performance of the tensor convolution code by a factor of about 4. | Benoit Steiner | 2014-09-03 |
| | |||
* | Reworked the expression evaluation mechanism in order to make it possible to ↵ | Benoit Steiner | 2014-06-13 |
efficiently compute convolutions and contractions in the future: * The scheduling of computation is moved out the the assignment code and into a new TensorExecutor class * The assignment itself is now a regular node on the expression tree * The expression evaluators start by recursively evaluating all their subexpressions if needed |