Marat is at Hot Chips 2013 this week presenting his poster entitled, “What a fast FPU means for algorithms: A story of vector elementary functions.” This work lays the foundations for Yeppp!, his new numerical library that embraces the “flopsarefree” mantra to develop new highspeed implementations of functions like log, exp, sin, cos, among others, and polynomial evaluation. A copy of his poster is available here [PDF, 497 KiB].

About us
The HPC Garage at Georgia Tech studies highperformance computing. Our work spans parallel algorithms, programming models, performance analysis, automated tuning (autotuning), and debugging. We target applications in computational science and engineering (CSE), which include computerbased simulations of natural and engineered systems and analysis of massive data sets. 
Search

Recent
 PMAA’14 July 14, 2014
 PASC’14 June 3, 2014
 IPDPS’14 May 19, 2014
 ISCA’14 paper to appear March 30, 2014
 GPGPU7 March 3, 2014
 SIAM PP14 February 18, 2014
 Check us out at SC’13! November 18, 2013
 VAPLS @ IEEE VIS’13 October 15, 2013
 Dagstuhl 13401 October 1, 2013
 Yeppp! 1.0 is live September 20, 2013
 ModSim’13 September 18, 2013
 Hana’s PhD Defense September 16, 2013
 PPAM’13 September 9, 2013
 PeachPy at the BLIS Retreat September 6, 2013
 Hot Chips ’13 August 26, 2013
Comments
Is there an associated paper with these findings? Would be interested in reading.
Thanks for your interest! Marat (mdukhan3 at gatech) has a draft preprint on this work, which we are wrapping up as a tech report to be released soon. If you followup with him directly, he may be able to give you an early draft.