Follow
Olivier Temam
Olivier Temam
DeepMind
Verified email at google.com
Title
Cited by
Cited by
Year
Diannao: A small-footprint high-throughput accelerator for ubiquitous machine-learning
T Chen, Z Du, N Sun, J Wang, C Wu, Y Chen, O Temam
ACM SIGARCH Computer Architecture News 42 (1), 269-284, 2014
19842014
Dadiannao: A machine-learning supercomputer
Y Chen, T Luo, S Liu, S Zhang, L He, J Wang, L Li, T Chen, Z Xu, N Sun, ...
2014 47th Annual IEEE/ACM International Symposium on Microarchitecture, 609-622, 2014
19782014
ShiDianNao: Shifting vision processing closer to the sensor
Z Du, R Fasthuber, T Chen, P Ienne, L Li, T Luo, X Feng, Y Chen, ...
Proceedings of the 42nd annual international symposium on computer …, 2015
13292015
Rapidly selecting good compiler optimizations using performance counters
J Cavazos, G Fursin, F Agakov, E Bonilla, MFP O'Boyle, O Temam
International Symposium on Code Generation and Optimization (CGO'07), 185-197, 2007
3542007
Milepost gcc: Machine learning enabled self-tuning compiler
G Fursin, Y Kashnikov, AW Memon, Z Chamski, O Temam, M Namolaru, ...
International journal of parallel programming 39, 296-327, 2011
3352011
DianNao family: energy-efficient hardware accelerators for machine learning
Y Chen, T Chen, Z Xu, N Sun, O Temam
Communications of the ACM 59 (11), 105-112, 2016
3282016
Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies
S Girbal, N Vasilache, C Bastoul, A Cohen, D Parello, M Sigler, O Temam
International Journal of Parallel Programming 34, 261-317, 2006
3262006
DaDianNao: A neural network supercomputer
T Luo, S Liu, L Li, Y Wang, S Zhang, T Chen, Z Xu, O Temam, Y Chen
IEEE Transactions on Computers 66 (1), 73-88, 2016
2702016
Hardware spiking neurons design: Analog or digital?
A Joubert, B Belhadj, O Temam, R Héliot
The 2012 International Joint Conference on Neural Networks (IJCNN), 1-5, 2012
2302012
Putting polyhedral loop transformations to work
C Bastoul, A Cohen, S Girbal, S Sharma, O Temam
Languages and Compilers for Parallel Computing: 16th International Workshop …, 2004
2232004
To copy or not to copy: A compile-time technique for assessing when data copying should be used to eliminate cache conflicts
O Temam, ED Granston, W Jalby
Proceedings of the 1993 ACM/IEEE conference on Supercomputing, 410-419, 1993
2171993
A defect-tolerant accelerator for emerging high-performance applications
O Temam
ACM SIGARCH Computer Architecture News 40 (3), 356-367, 2012
2132012
Cache interference phenomena
O Temam, C Fricker, W Jalby
ACM SIGMETRICS Performance Evaluation Review 22 (1), 261-271, 1994
1721994
MILEPOST GCC: machine learning based research compiler
G Fursin, C Miranda, O Temam, M Namolaru, E Yom-Tov, A Zaks, ...
Proceedings of the GCC Developers' Summit, 2008
1712008
A quantitative analysis of loop nest locality
KS McKinley, O Temam
Proceedings of the seventh international conference on Architectural support …, 1996
1591996
Leveraging the error resilience of machine-learning applications for designing highly energy efficient accelerators
Z Du, K Palem, A Lingamneni, O Temam, Y Chen, C Wu
2014 19th Asia and South Pacific design automation conference (ASP-DAC), 201-206, 2014
1522014
BenchNN: On the broad potential application scope of hardware neural network accelerators
T Chen, Y Chen, M Duranton, Q Guo, A Hashmi, M Lipasti, A Nere, S Qiu, ...
2012 IEEE International Symposium on Workload Characterization (IISWC), 36-45, 2012
1392012
Characterizing the behavior of sparse algorithms on caches
O Temam, W Jalby
INRIA, 1992
1391992
Facilitating the search for compositions of program transformations
A Cohen, M Sigler, S Girbal, O Temam, D Parello, N Vasilache
Proceedings of the 19th annual international conference on Supercomputing …, 2005
1332005
Unisim: An open simulation environment and library for complex architecture design and collaborative development
D August, J Chang, S Girbal, D Gracia-Perez, G Mouchard, DA Penry, ...
IEEE Computer Architecture Letters 6 (2), 45-48, 2007
1322007
The system can't perform the operation now. Try again later.
Articles 1–20