Bio

An award-winning researcher, E. Jason Riedy works to develops tools and algorithms for dynamic graph analysis for applications including cybersecurity, social networks, and bioinformatics for the School of Computational Science and Engineering in the College of Computing at the Georgia Institute of Technology. His software framework -- called STINGER -- for parallel analysis of massive, streaming graph data, supports many different analyses of real, dynamic data. A paper describing STINGER won a best paper award from the Institute of Electrical and Electronics Engineers’ (IEEE) High-Performance Extreme Computing (HPEC) Conference. His scalable community detection code won the Mix Competition in the 10th DIMACS Implementation Challenge held in 2012 by the Center for Discrete Mathematics and Theoretical Computer Science. His codes extending (and included within) the widely used LAPACK and the extended-precision BLAS (XBLAS) package have contributed to the development of many scientific software packages. He was a member of the IEEE 754 Revision Committee and has presented extensively on software development and research. He holds dual bachelor’s degrees in computer science and mathematics from the University of Florida. Riedy received his doctorate in computer science from the University of California, Berkeley with a focus in combinatorial optimization and targeted high-precision arithmetic.