Curriculum Vitae: E. Jason Riedy

Table of Contents

PDF version, Plain text version, BibLaTeX, CSL JSON

Contact Information

Email
jason@acm.org
Homepage
http://lovesgoodfood.com/jason/cv/

Employment

Institution
Myself, time "off"
Since
Feb 2024
Institution
Advanced Micro Devices, Inc. (AMD)
Until
Jan 2026
Title
Principal Member of Technical Staff
Since
Mar 2024
Previous Institution
Lucata Corporation (née Emu Technology)
Until
Jan 2024
Title
Member of Technical Staff
Since
2020
Previous Institution
School of Computational Science and Engineering, College of Computing, Georgia Institute of Technology
Until
2020
Title
Director of the CRNCH Rogues Gallery with Jeffrey Young
Since
2017
Title
Senior Research Scientist
Since
2016
Title
Research Scientist
Since
2009

Education

Technical Experience

  • Jan 2026 – present:: "Me" time.
    • Building a retrieval-augmented generation agent for maintaining my software development tooling. This includes keeping Emacs packages accessible and consistent. Ideally this will include analyzing and extending CMake build systems.
    • Work on "grading" dense linear algebra routines' accuracy. The grades help users evaluate if fast matrix multiplication algorithms (e.g. Strassen's), reduced floating-point precision, and/or emulated floating-point arithmetic suffice for their applications.
    • Catching up on research literature in applied mathematics, scientific computing, machine learning, and AI.
  • Architecting and developing an AMD port of NVIDIA's cuGraph graph analysis library. Activities include:
    • Educating leadership on the problem space including hardware and software trends, existing and upcoming application areas, and key players in industry and research.
    • Developing maintainable translation and update tooling based on ast-grep for semantic and syntactic manipulation. This included the Python bridge.
    • Consulting on floating-point and linear algebra issues across hardware and software, CPU and GPU groups.
    • Keeping others updated on current floating-point arithmetic, linear algebra, and programming language standardization work.
  • IEEE 754-2029 Working Group
  • IEEE 754 Study Group
  • IEEE P3109 — Arithmetic Formats for Machine Learning
  • Optimizing for the Lucata migratory thread PGAS platform. Tasks / accomplishments include:
    • Porting the required compiler pieces from LLVM 6 to LLVM 14.
    • Supporting and exposing many novel hardware features to programmers.
    • Evaluating concurrent graph analysis on the Lucata architecture, achieving a 19✕ speed-up over RedisGraph running 128 breadth-first searches concurrently.
    • Moving the assembler from an Early grammar to LALR(1), drastically improving compile times.
    • Developing and implementing GraphBLAS components, including support for RedisGraph.
    • General C++ library infrastructure development supporting novel aspects of the architecture.
    • And others…
  • Director of the Rogues Gallery of novel, post-Moore systems in the Center for Research into Novel Computing Hierarchies.
  • Developing a "next generation BLAS" specification to ease tuning, support extended and novel precisions, and include composable reproducible linear algebra primitives.
  • IEEE 754 revision (floating-point arithmetic): Operations to support extended precision and reproducible linear algebra.
  • Development and support for a high-performance shared memory community detection package for massive graphs.
  • Defining the Graph500 benchmark and providing the reference implementations for sequential and shared memory platforms (OpenMP, Cray XMT).
  • Development of STINGER, a framework for analyzing massive graphs with streaming input on both OpenMP platforms and the Cray XMT.
  • Support and porting for GraphCT, a massive graph characterization toolkit.
  • CASS-MT and follow-on projects: Development of STINGER, a framework for analyzing massive graphs with streaming input on both OpenMP platforms and the Cray XMT. Support and porting of GraphCT, a massive graph characterization toolkit, and STINGER, a streaming graph analysis framework.
  • IEEE-754 revision (floating-point arithmetic): Programming language interactions, exceptional behavior, decimal formats and arithmetic.
  • Sca/LAPACK project: Development of coding standards, integration of C routines, multiplatform testing and debugging, code and design review.
  • Systems administration: Maintenance of servers and file systems for CISE Department, Univ. of Florida, including performance tuning, troubleshooting, file system backups, and end-user support.
  • Visualization: Animations of molecular dynamics simulations.

Research Project Experience

2017 – 2020
SuperSTARLU: Developing logical primitives for advanced memory systems (3D stacked, hybrid memory cube) in support of unsymmetric sparse matrix factorization. (co-PI)
2017 – 2019
DHS Center for Accelerating Operational Efficiency: Predictive analysis of massive streaming graphs. (co-PI)
2017 – 2018
Evaluating memory-centric architectures for high performance data analysis: Combining architecture and algorithms to achieve high performance on architectures like the Emu Technology platform, where memory operations are moved to be local. Focuses on streaming graph analysis and sparse tensor decomposition. (PI)
2016 – 2018
High Performance Data Analytics (HPDA): High-performance data analysis for streaming graphs. (PI and co-PI, different years)
2015 – 2017
NSF Embrace: Evolvable Methods for Benchmarking Realism through Application and Community
2014 – 2016
Idaho Bailiff: High-performance data analysis for streaming graphs. (co-PI)
2013 – 2018
NSF XScala: High-performance kernel development, curation, and modeling for accelerators. (co-PI)
2012 – 2018
DARPA GRATEFUL: Graph analysis optimizing power and efficiency. Under the DARPA Power Efficiency Revolution for Embedded Computing Technologies (PERFECT) program. Accelerating, porting, and maintaining RISC-V-based streaming graph analysis. (co-PI)
2010 – 2014
STING: Spatio-Temporal Interaction Networks and Graphs An open-source dynamic graph package for Intel platforms. (co-PI)
2010 – 2013
Evaluation of the IBM PERCS and Cray Cascade HPCS architectures. (co-PI)
2009 – 2013
CASS-MT: Massively parallel graph analysis (537M node, 8.6B edge), threaded architectures, streaming data analysis and error modeling.
2009
NSF I/UCRC: Center for hybrid multi-core productivity research
2002 – 2009
LAPACK, ScaLAPACK, and XBLAS (dense linear algebra): Extra-precise linear system refinement algorithms, eigenvalue routines, and optimization.
1999 – 2009
SuperLU (sparse linear algebra): Parallel combinatorial preprocessing, numerical stability analysis, iterative solver preconditioning.
1996 – 1999
Image Algebra (image analysis): SIMD parallel optimization, edge detection, geometric hashing.

Awards, Recognition, and Honors

  • Georgia Tech College of Computing Outstanding Research Scientist, 2017
  • Georgia Tech "Thank a Teacher" award, fall 2017
  • Georgia Tech Research Teaching Fellow, 2016-2017
  • Best paper award, IEEE High Performance Extreme Computing Conference, 2012
  • The 10th DIMACS Implementation Challenge's Mix and Mix Pareto challenges winner, 2012
  • Institute for Data and High Performance Computing Fellow, 2010-2011

Software

Public source code web sites:

Highlights

(By its nature, this section always will be a bit out of date.)

Refereed Journals

•
Eric R. Hein, Srinivas Eswar, Abdurrahman Yaşar, Jiajia Li, Jeffrey S. Young, Thomas M. Conte, Ümit V. Çatalyürek, Richard Vuduc, Jason Riedy, and Bora Uçar. 2020. Programming strategies for irregular algorithms on the Emu Chick. ACM Trans. Parallel Comput. 7, 4 (October 2020). https://doi.org/10.1145/3418077
•
Jeffrey Young, Eric Hein, Srinivas Eswar, Patrick Lavin, Jiajia Li, Jason Riedy, Richard Vuduc, and Thomas M. Conte. 2019. A microbenchmark characterization of the Emu Chick. Parallel Computing (September 2019). https://doi.org/10.1016/j.parco.2019.04.012
•
Eisha Nathan, Anita Zakrzewska, Jason Riedy, and D. B. 2017. Local community detection in dynamic graphs using personalized centrality. Algorithms 10, 3 (August 2017). https://doi.org/10.3390/a10030102
•
David Ediger, Karl Jiang, Jason Riedy, and D. B. 2013. GraphCT: Multithreaded algorithms for massive graph analysis. IEEE Transactions in Parallel and Distributed Systems (September 2013), 2220–2229. https://doi.org/10.1109/TPDS.2012.323
•
James W. Demmel, Mark Frederick Hoemmen, Yozo Hida, and E. Jason Riedy. 2009. Non-negative diagonals and high performance on low-profile matrices from Householder QR. SIAM Journal on Scientific Computing 31, 4 (July 2009), 2832–2841. https://doi.org/10.1137/080725763
•
James W. Demmel, Yozo Hida, Xiaoye S. Li, and E. Jason Riedy. 2009. Extra-precise iterative refinement for overdetermined least squares problems. ACM Transactions on Mathematical Software 35, 4 (February 2009), 1–32. https://doi.org/10.1145/1462173.1462177
•
James W. Demmel, Yozo Hida, W. Kahan, Xiaoye S. Li, Sonil Mukherjee, and E. Jason Riedy. 2006. Error bounds from extra-precise iterative refinement. ACM Transactions on Mathematical Software 32, 2 (June 2006), 325–351. https://doi.org/10.1145/1141885.1141894
•
Osni Marques, Jason E. Riedy, and Christof Vömel. 2006. Benefits of IEEE-754 features in modern symmetric tridiagonal eigensolvers. SIAM journal on scientific computing 28, 5 (2006), 1613–1633. https://doi.org/10.1137/050641624

Book Chapters

•
David Ediger, Jason Riedy, D. B., and Henning Meyerhenke. 2013. Computational graph analytics for massive streaming data. in Large scale network-centric computing systems, Hamid Sarbazi-azad and Albert Zomaya (eds.). Wiley. https://doi.org/10.1002/9781118640708.ch25
•
E. Jason Riedy, Henning Meyerhenke, David Ediger, and D. B. 2012. Parallel community detection for massive graphs. in Graph partitioning and graph clustering, D. B., Henning Meyerhenke, Peter Sanders and Dorothea Wagner (eds.). American Mathematical Society, 207–222. https://doi.org/10.1090/conm/588/11703
•
Joseph N. Wilson, E. Jason Riedy, Gerhard X. Ritter, and Hongchi Shi. 1999. An Image Algebra based SIMD image processing environment. in Visual information representation, communication, and image processing, C. W. Chen and Y. Q. Zhang (eds.). Marcel Dekker, New York, 523–542.

Conference Proceedings

•
Patrick Lavin, Jeffrey Young, Richard Vuduc, Jason Riedy, Aaron Vose, and Daniel Ernst. 2020. Evaluating gather and scatter performance on cpus and gpus. The International Symposium on Memory Systems (MEMSYS) (September 2020). https://doi.org/10.1145/3422575.3422794
•
Jeffrey Young, Jason Riedy, Tom Conte, Vivek Sarkar, Prasanth Chatarasi, and Srisehan Srikanth. 2019. Experimental insights from the Rogues Gallery testbed. in IEEE international conference on rebooting computing (ICRC19), November 2019. San Mateo, CA. https://doi.org/10.1109/ICRC.2019.8914707
•
Chunxing Yin and Jason Riedy. 2019. Concurrent Katz centrality for streaming graphs. in The IEEE high performance extreme computing conference (HPEC), September 2019. Waltham, MA. https://doi.org/10.1109/HPEC.2019.8916572
•
Will Powell, Jason Riedy, Jeffrey S. Young, and Tom Conte. 2019. Wrangling Rogues: A case study on managing experimental post-Moore architectures. in Practice and experience in advanced research computing (PEARC ’19), July 2019. Chicago, IL. https://doi.org/10.1145/3332186.3332223
•
Jason Riedy and James Demmel. 2018. Augmented arithmetic operations proposed for IEEE-754 2018. in 25th IEEE symposium on computer arithmetic (ARITH 25), June 2018. . https://doi.org/10.1109/ARITH.2018.8464813
•
Eric Hein, Tom Conte, Jeffrey S. Young, Srinivas Eswar, Jiajia Li, Patrick Lavin, Richard Vuduc, and Jason Riedy. 2018. An initial characterization of the Emu Chick. in The eighth international workshop on accelerators and hybrid exascale systems (AsHES), May 2018. 579–588. https://doi.org/10.1109/IPDPSW.2018.00097
•
Chunxing Yin, Jason Riedy, and D. B. 2018. A new algorithmic model for graph analysis of streaming data. in Proceedings of the 14th international workshop on mining and learning with graphs (MLG), May 2018. . Retrieved from http://www.mlgworkshop.org/2018/papers/MLG2018_paper_23.pdf
•
E. Jason Riedy, Chunxing Yin, and D. B. 2017. A new algorithm model for massive-scale streaming graph analysis. in SIAM workshop on network science, July 2017. Pittsburgh, PA. Retrieved from https://www.slideshare.net/jasonriedy/a-new-algorithm-model-for-massivescale-streaming-graph-analysis
•
Marat Dukhan, Richard Vuduc, and Jason Riedy. 2016. Wanted: Floating-point add round-off error instruction. in The 2nd international workshop on performance modeling: Methods and applications (PMMA16), June 2016. Frankfurt, Germany. (Workshop with ISC High Performance). Retrieved from https://blogs.fau.de/hager/files/2016/06/pmma2016-slides_Dukhan.pdf
•
Jason Riedy. 2016. Updating PageRank for streaming graphs. in Graph Algorithms Building Blocks (GABB 2016), May 2016. Chicago, IL. (Workshop with IPDPS 2016).
•
D. B., Aleksandra Michalewicz, Oded Green, Jessie Birkett-Rees, Jason Riedy, James Fairbanks, and Anita Zakrzewska. 2016. Semantic database applications at the Samtavro Cemetery, Georgia. in The 44th computer applications and quantitative methods in archaeology conference (CAA), March 2016. Oslo, Norway.
•
Adam McLaughlin, Jason Riedy, and D. B. 2015. An energy-efficient abstraction for simultaneous breadth-first searches. in The IEEE high performance extreme computing conference (HPEC), September 2015. Waltham, MA.
•
Adam McLaughlin, Jason Riedy, and D. B. 2014. Optimizing energy consumption and parallel performance for betweenness centrality using GPUs. in The IEEE high performance extreme computing conference (HPEC), September 2014. Waltham, MA. “Rising Stars” section. https://doi.org/10.1109/HPEC.2014.7040980
•
E. Jason Riedy and D. B. 2013. Multithreaded community monitoring for massive streaming graph data. in 7th workshop on multithreaded architectures and applications (MTAAP), May 2013. Boston, MA. https://doi.org/10.1109/IPDPSW.2013.229
•
David Ediger, Robert McColl, Jason Riedy, and D. B. 2012. STINGER: High performance data structure for streaming graphs. in The IEEE high performance extreme computing conference (HPEC), September 2012. Waltham, MA. Best paper award. https://doi.org/10.1109/HPEC.2012.6408680
•
E. Jason Riedy, D. B., and Henning Meyerhenke. 2012. Scalable multi-threaded community detection in social networks. in 6th workshop on multithreaded architectures and applications (MTAAP), May 2012. . https://doi.org/10.1109/IPDPSW.2012.203
•
Jason Riedy, Henning Meyerhenke, D. B., David Ediger, and Timothy G. Mattson. 2012. Analysis of streaming social networks and graphs on multicore architectures. in IEEE international conference on acoustics, speech and signal processing (ICASSP). Kyoto, Japan. https://doi.org/10.1109/ICASSP.2012.6289126
•
E. Jason Riedy, Henning Meyerhenke, David Ediger, and D. B. 2012. Parallel community detection for massive graphs. in 10th DIMACS implementation challenge workshop - graph partitioning and graph clustering, February 2012. Atlanta, Georgia. Won first place in the Mix Challenge and Mix Pareto Challenge. Retrieved from http://www.cc.gatech.edu/dimacs10/papers/[15]-dimacs10-community-detection.pdf
•
E. Jason Riedy, Henning Meyerhenke, David Ediger, and D. B. 2011. Parallel community detection for massive graphs. in 9th international conference on parallel processing and applied mathematics (PPAM11), September 2011. Springer. https://doi.org/10.1007/978-3-642-31464-3\_29
•
David Ediger, E. Jason Riedy, D. B., and Henning Meyerhenke. 2011. Tracking structure of streaming social networks. in 5th workshop on multithreaded architectures and applications (MTAAP), May 2011. . https://doi.org/10.1109/IPDPS.2011.326
•
David Ediger, Karl Jiang, E. Jason Riedy, D. B., Courtney Corley, Rob Farber, and William N. Reynolds. 2010. Massive social network analysis: Mining twitter for social good. in 39th international conference on parallel processing (ICPP), September 2010. San Diego, CA. https://doi.org/10.1109/ICPP.2010.66
•
David Ediger, Karl Jiang, E. Jason Riedy, and D. B. 2010. Massive streaming data analytics: A case study with clustering coefficients. in 4th workshop on multithreaded architectures and applications (MTAAP), April 2010. Atlanta, GA. https://doi.org/10.1109/IPDPSW.2010.5470687
•
James W. Demmel, Jack Dongarra, Beresford Parlett, W. Kahan, Ming Gu, David Bindel, Yozo Hida, Xiaoye S. Li, Osni A. Marques, E. Jason Riedy, Christof Vömel, Julien Langou, Piotr Luszczek, Jakub Kurzak, Alfredo Buttari, Julie Langou, and Stanimire Tomov. 2006. Prospectus for the next LAPACK and ScaLAPACK libraries. in PARA’06: State-of-the-art in scientific and parallel computing, June 2006. Springer / High Performance Computing Center North (HPC2N) and the Department of Computing Science, Umeå University, Umeå, Sweden. https://doi.org/10.1007/978-3-540-75755-9\_2
•
David Hough, Bill Hay, Jeff Kidder, E. Jason Riedy, Guy L. Steele Jr., and Jim Thomas. 2005. Arithmetic interactions: From hardware to applications. in 17th IEEE symposium on computer arithmetic (ARITH’05), June 2005. . See http://purl.oclc.org/NET/jason-riedy/resume/material/arith17-slides.pdfrelated presentation. https://doi.org/10.1109/ARITH.2005.10
•
Joseph N. Wilson and E. Jason Riedy. 1997. Efficient SIMD evaluation of image processing programs. in Parallel and distributed methods for image processing, July 1997. SPIE, San Diego, CA, 199–210. https://doi.org/10.1117/12.279618

Technical Reports

•
Ahmad Abdelfattah, Willow Ahrens, Hartwig Anzt, Chris Armstrong, Ben Brock, Aydin Buluc, Federico Busato, Terry Cojean, Tim Davis, Jim Demmel, Grace Dinh, David Gardener, Jan Fiala, Mark Gates, Azzam Haider, Toshiyuki Imamura, Pedro Valero Lara, Jose Moreira, Sherry Li, Piotr Luszczek, Max Melichenko, Jose Moeira, Yvan Mokwinski, Riley Murray, Spencer Patty, Slaven Peles, Tobias Ribizel, Jason Riedy, Siva Rajamanickam, Piyush Sao, Manu Shantharam, Keita Teranishi, Stan Tomov, Yu-Hsiang Tsai, and Heiko Weichelt. 2024. Interface for sparse linear algebra operations. Retrieved from https://arxiv.org/abs/2411.13259
•
James Demmel, Jack Dongarra, Mark Gates, Greg Henry, Julien Langou, Xiaoye Li, Piotr Luszczek, Weslley Pereira, Jason Riedy, and Cindy Rubio-González. 2022. Proposed consistent exception handling for the BLAS and LAPACK. Retrieved from http://arxiv.org/abs/2207.09281v1
•
Emory Smith, Shannon Kuntz, Jason Riedy, and Martin Deneroff. 2022. Concurrent graph queries on the Lucata Pathfinder. Retrieved from http://arxiv.org/abs/2209.11889v1
•
Eric R. Hein, Srinivas Eswar, Abdurrahman Yasar, Jiajia Li, Jeffrey S. Young, Thomas M. Conte, Ümit V. Çatalyürek, Rich Vuduc, E. Jason Riedy, and Bora Uçar. 2019. Programming strategies for irregular algorithms on the Emu Chick. Retrieved from http://arxiv.org/abs/1901.02775
•
IEEE 754 Committee. 2019. IEEE standard for floating-point arithmetic. Microprocessor Standards Committee of the IEEE Computer Society, New York, NY. (committee member and contributor). Retrieved from https://ieeexplore.ieee.org/servlet/opac?punumber=8739148
•
Patrick Lavin, E. Jason Riedy, Rich Vuduc, and Jeffrey Young. 2018. Spatter: A benchmark suite for evaluating sparse access patterns. Retrieved from http://arxiv.org/abs/1811.03743
•
Will Powell, E. Jason Riedy, Jeffrey S. Young, and Thomas M. Conte. 2018. Wrangling rogues: Managing experimental post-moore architectures. Retrieved from http://arxiv.org/abs/1808.06334
•
Jeffrey Young, Eric R. Hein, Srinivas Eswar, Patrick Lavin, Jiajia Li, E. Jason Riedy, Richard W. Vuduc, and Tom Conte. 2018. A microbenchmark characterization of the Emu Chick. Retrieved from http://arxiv.org/abs/1809.07696
•
Lawrence B. Holder, Rajmonda Caceres, David F. Gleich, Jason Riedy, Maleq Khan, Nitesh V. Chawla, Ravi Kumar, Yinghui Wu, Christine Klymko, Tina Eliassi-Rad, and Aditya Prakash. 2016. Current and future challenges in mining large networks: Report on the second SDM workshop on mining networks and graphs. SIGKDD Explorations Newsletter 18, 1 (August 2016), 39–45. https://doi.org/10.1145/2980765.2980770
•
Marat Dukhan, Richard W. Vuduc, and E. Jason Riedy. 2016. Wanted: Floating-point add round-off error instruction. Retrieved from http://arxiv.org/abs/1603.00491
•
Shel Swenson, Yogesh Simmhan, Viktor K. Prasanna, Manish Parashar, E. Jason Riedy, D. B., and Richard W. Vuduc. 2013. Sustainable software development for next-gen sequencing (NGS) bioinformatics on emerging platforms. Retrieved from http://arxiv.org/abs/1309.1828
•
Jason Riedy, D. B., Karl Jiang, Pushkar Pande, and Richa Sharma. 2011. Detecting communities from given seeds in social networks. Georgia Institute of Technology. Retrieved from http://hdl.handle.net/1853/36980
•
IEEE 754 Committee. 2008. IEEE standard for floating-point arithmetic. Microprocessor Standards Committee of the IEEE Computer Society, New York, NY. (committee member and contributor). https://doi.org/10.1109/IEEESTD.2008.4610935
•
James W. Demmel, Mark Frederick Hoemmen, Yozo Hida, and E. Jason Riedy. 2008. Non-negative diagonals and high performance on low-profile matrices from Householder QR. Netlib. Also issued as UCB/EECS-2008-76; modified from SISC version. Retrieved from http://www.netlib.org/lapack/lawnspdf/lawn203.pdf
•
James W. Demmel, Yozo Hida, Xiaoye S. Li, and E. Jason Riedy. 2007. Extra-precise iterative refinement for overdetermined least squares problems. Netlib. Also issued as UCB/EECS-2007-77; version accepted for TOMS. Retrieved from http://www.netlib.org/lapack/lawnspdf/lawn188.pdf
•
James W. Demmel, Jack Dongarra, Beresford Parlett, W. Kahan, Ming Gu, David Bindel, Yozo Hida, Xiaoye S. Li, Osni A. Marques, E. Jason Riedy, Christof Vömel, Julien Langou, Piotr Luszczek, Jakub Kurzak, Alfredo Buttari, Julie Langou, and Stanimire Tomov. 2007. Prospectus for the next LAPACK and ScaLAPACK libraries. Netlib. Also issued as UT-CS-07-592. Retrieved from http://www.netlib.org/lapack/lawnspdf/lawn181.pdf
•
Osni A. Marques, E. Jason Riedy, and Christof Vömel. 2005. Benefits of IEEE-754 features in modern symmetric tridiagonal eigensolvers. Netlib. Also issued as UCB//CSD-05-1414; expanded from SISC version. Retrieved from http://www.netlib.org/lapack/lawnspdf/lawn172.pdf
•
James W. Demmel, Yozo Hida, W. Kahan, Xiaoye S. Li, Sonil Mukherjee, and E. Jason Riedy. 2005. Error bounds from extra-precise iterative refinement. Netlib. Also issued as UCB//CSD-05-1414, UT-CS-05-547, and LBNL-56965; expanded from TOMS version. Retrieved from http://www.netlib.org/lapack/lawnspdf/lawn165.pdf

Invited Presentations

•
Jason Riedy. 2022. Programming on the Lucata data-first architecture. Boston area architecture workshop (BARC). KeynoteKeynote. Retrieved from https://bostonarch.github.io/2022/BARC23.pdf
•
Jason Riedy. 2018. Plans for IEEE standard 754-2028. 25th IEEE symposium on computer arithmetic (ARITH 25). Invited talkInvited talk. Retrieved from https://www.slideshare.net/jasonriedy/plans-for-ieee-standard-7542028
•
Jason Riedy. 2018. Streaming graph analysis: New models, new architectures. ACM international conference on computing frontiers. Invited talk.Invited talk. Retrieved from https://www.slideshare.net/jasonriedy/graph-analysis-new-algorithm-models-new-architectures
•
Jason Riedy. 2015. Network challenge: Error and sensitivity analysis. Invited panelist. Retrieved from http://www.slideshare.net/jasonriedy/network-challenge-error-and-sensitivity-analysis
•
Jason Riedy and D. B. 2014. Graph analysis trends and opportunities. Invited presentationInvited presentation. Retrieved from http://www.slideshare.net/jasonriedy/cmg-20141104
•
Jason Riedy and D. B. 2014. STINGER: Multi-threaded graph streaming. Invited presentation and panelist. (Workshop with IPDPS 2014)Invited presentation and panelist. (Workshop with IPDPS 2014). Retrieved from http://www.slideshare.net/jasonriedy/stinger-multithreaded-graph-streaming
•
Lauren L. Smith and Dolores A. Shaffer. 2012. DARPA’s High Productivity Computing Systems Program: A Final Report. Invited panel speaker.
•
E. Jason Riedy. 2008. Auctions for distributed (and possibly parallel) matchings. Invited presentation. Retrieved from http://www.cerfacs.fr/
•
E. Jason Riedy. 2005. Modern language tools and 754R. Invited presentation and panelist. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/arith17-slides.pdf

Presentations

•
Jason Riedy and Shannon Kuntz. 2021. Lightning talks: Updates/news from the GraphBLAS implementers. Retrieved from https://www.slideshare.net/jasonriedy/lagraph-20211013
•
Jason Riedy. 2021. Lightning talks: Updates/news from the GraphBLAS implementers. Retrieved from https://www.slideshare.net/jasonriedy/lucata-at-the-hpec-graphblas-bof-250439305
•
Jason Riedy. 2020. Graph analysis and novel architectures. Retrieved from https://www2.slideshare.net/jasonriedy/graph-analysis-and-novel-architectures
•
Jason Riedy. 2020. GraphBLAS and Emus. Retrieved from https://www2.slideshare.net/jasonriedy/graphblas-and-emus
•
Jason Riedy. 2020. Potential directions for moving IEEE-754 forward. Retrieved from https://icerm.brown.edu/materials/Slides/htw-20-vp/Potential_Directions_for_Moving_IEEE-754_Forward_%5D_Jason_Riedy,_Georgia_Institute_of_Technology.pdf
•
Jason Riedy, James Demmel, and Peter Ahrens. 2020. Reproducible linear algebra from application to architecture. Retrieved from https://www.slideshare.net/jasonriedy/reproducible-linear-algebra-from-application-to-architecture-228263588
•
David Donofrio and Jason Riedy. 2019. Specializing architectures for data analytics. Introduction to invited panel on “We can’t build specialized architectures for graphs that can work efficiently with other workloads, so we just need to hand-optimize each and every algorithm for each and every architecture”. Retrieved from https://hpc.pnl.gov/armbof/
•
Jason Riedy, James Demmel, and Peter Ahrens. 2019. Reproducible linear algebra from application to architecture. Retrieved from https://www.slideshare.net/jasonriedy/reproducible-linear-algebra-from-application-to-architecture
•
Chunxing Yin and Jason Riedy. 2019. A new algorithm model for massive-scale streaming graph analysis. Retrieved from https://www.slideshare.net/jasonriedy/a-new-algorithm-model-for-massivescale-streaming-graph-analysis-156808819
•
Jason Riedy, Jeffrey Young, and Tom Conte. 2019. Novel architectures for applications in data science and beyond. Minisymposium organizer with Jeffrey Young and Tom Conte. Retrieved from http://www.crnch.gatech.edu/content/siam-cse-2019-go-bananas
•
Mark Gates, James W. Demmel, Greg Henry, Xiaoye S. Li, E. Jason Riedy, and Peter Tang. 2019. A proposal for next-generation BLAS. Retrieved from http://icl.utk.edu/bblas/siam-cse19/
•
E. Jason Riedy. 2019. Characterization of Emu with microbenchmarks.
•
E. Jason Riedy, Greg Henry, James Demmel, Mark Gates, Xiaoye S. Li, and Ping Tak P. Tang. 2018. Updated proposal for a next-generation BLAS. Retrieved from http://icl.utk.edu/bblas/sc18/files/NG_BLAS_SC18.pdf
•
Jason Riedy. 2018. Graph analysis: New algorithm models, new architectures. Minisymposium organizer with Oded Green and David A. Bader.
•
E. Jason Riedy, Greg Henry, James Demmel, Mark Gates, Xiaoye S. Li, and Ping Tak P. Tang. 2017. A proposal for a next-generation BLAS. Retrieved from http://icl.utk.edu/bblas/sc17/files/bblas-sc17-riedy.pdf
•
Eisha Nathan, Anita Zakrzewska, Chunxing Yin, and Jason Riedy. 2017. A new direction for streaming graph analysis.
•
Jason Riedy. 2017. High-performance analysis of streaming graphs. Retrieved from https://www.slideshare.net/jasonriedy/highperformance-analysis-of-streaming-graphs-77348572
•
E. Jason Riedy. 2017. High-performance analysis of streaming graphs. Minisymposium organizer with Henning Meyerhenke. Retrieved from https://www.slideshare.net/jasonriedy/highperformance-analysis-of-streaming-graphs
•
James Demmel, Greg Henry, Xiaoye Li, Jason Riedy, and Peter Tang. 2017. A proposal for a next-generation BLAS. Retrieved from http://www.netlib.org/utk/people/JackDongarra/WEB-PAGES/Batched-BLAS-2017/talk05-demmel.pdf
•
E. Jason Riedy and D. B. 2016. Scalable network analysis: Tools, algorithms, applications. Minisymposium organizer with Henning Meyerhenke and David A. Bader. Retrieved from http://www.slideshare.net/jasonriedy/scalable-and-efficient-algorithms-for-analysis-of-massive-streaming-graphs-60975076
•
E. Jason Riedy. 2015. Graph analysis beyond linear algebra. Invited presentation. Retrieved from http://www.slideshare.net/jasonriedy/graph-analysis-beyond-linear-algebra
•
Jason Riedy. 2014. STINGER: Analyzing massive, streaming graphs.
•
Jason Riedy, D. B., David Ediger, Rob McColl, and Timothy G. Mattson. 2014. STING: Spatio-temporal interaction networks and graphs for Intel platforms. Retrieved from http://www.slideshare.net/jasonriedy/intel-20140117
•
Jason Riedy. 2013. STINGER: Analyzing massive, streaming graphs.
•
D. B., Henning Meyerhenke, and Jason Riedy. 2013. Applications and challenges in large-scale graph analysis. Retrieved from http://www.graphanalysis.org/SIAM-CSE13/01_Bader.pdf
•
Robert C. McColl, David Ediger, D. B., and Jason Riedy. 2013. Analyzing graph structure in streaming data with STINGER.
•
D. B., David Ediger, and Jason Riedy. 2012. Streaming graph analytics for massive graphs. Retrieved from http://www.slideshare.net/jasonriedy/streaming-graph-analytics-for-massive-graphs
•
Jason Riedy, D. B., David Ediger, Rob McColl, and Timothy G. Mattson. 2012. STING: Spatio-temporal interaction networks and graphs for Intel platforms. Retrieved from http://www.slideshare.net/jasonriedy/gt-stingintelslides
•
David Ediger, E. Jason Riedy, Henning Meyerhenke, and D. B. 2012. Analyzing massive networks with GraphCT.
•
Henning Meyerhenke, E. Jason Riedy, and D. B. 2012. Parallel community detection in streaming graphs.
•
E. Jason Riedy and Henning Meyerhenke. 2012. Scalable algorithms for analysis of massive, streaming graphs. Minisymposium organizer with Henning Meyerhenke. Retrieved from http://www.slideshare.net/jasonriedy/siam-pp-2012-scalable-algorithms-for-analysis-of-massive-streaming-graphs
•
E. Jason Riedy, David Ediger, Henning Meyerhenke, and D. B. 2012. STING: Software for analysis of spatio-temporal interaction networks and graphs.
•
Jason Riedy, D. B., Henning Meyerhenke, David Ediger, and Timothy Mattson. 2011. STING: Spatio-temporal interaction networks and graphs for Intel platforms. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/GT-STING-for-Intel-beamer.pdf
•
Jason Riedy, David Ediger, D. B., and Henning Meyerhenke. 2011. Tracking structure of streaming social networks. Invited presentation. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/GraphEx-2011.pdf
•
Jason Riedy, D. B., and David Ediger. 2010. Applications in social networks. NSF workshop on accelerators for data-intensive applications. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/nsf-workshop-socnet.pdf
•
E. Jason Riedy. 2009. Dependable direct solutions for linear systems using a little extra precision. Invited presentation. Retrieved from http://hdl.handle.net/1853/29795
•
James W. Demmel, Yozo Hida, Xiaoye S. Li, E. Jason Riedy, Meghana Vishvanath, and David Vu. 2007. Precise solutions for overdetermined least squares problems. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/bascd2007-poster.pdf
•
E. Jason Riedy. 2006. Making static pivoting dependable. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/bascd2006-poster.pdf
•
E. Jason Riedy, Yozo Hida, and James W. Demmel. 2005. The future of LAPACK and ScaLAPACK. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/future-of-scalapack.pdf
•
E. Jason Riedy. 2005. Parallel combinatorial computing and sparse matrices. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/cse05.pdf
•
E. Jason Riedy. 2004. Parallel weighted bipartite matching and applications. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/pp04.pdf
•
E. Jason Riedy. 2004. Sparse data structures for weighted bipartite matching. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/csc04.pdf
•
E. Jason Riedy. 2003. Practical alternatives for parallel pivoting. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/siam-am03.pdf
•
E. Jason Riedy. 2003. Parallel bipartite matching for sparse matrix computations. Retrieved from http://purl.oclc.org/NET/jason-riedy/resume/material/siam-cse03-poster.pdf
•
David Bindel and E. Jason Riedy. 2002. Exception handling interfaces, implementations, and evaluation. Retrieved from http://grouper.ieee.org/groups/754/meeting-materials/2002-08-22-pres.pdf
•
E. Jason Riedy. 2002. Parallel bipartite matching for sparse matrix computation.

Other Publications

•
James Demmel, Jason Riedy, and Peter Ahrens. 2018. Reproducible BLAS: Make addition associative again! SIAM News 51, 8. Retrieved from https://sinews.siam.org/Details-Page/reproducible-blas-make-addition-associative-again
•
Jason Riedy and D. B. 2013. Massive streaming data analytics: A graph-based approach. XRDS: Crossroads, The ACM Magazine for Students — Scientific Computing 19, 37–43. https://doi.org/10.1145/2425676.2425689

Nontechnical Writing

•
Jason Riedy. 2011. The storm’s coming when the chickens spread out. in Pay attention: A river of stones, Fiona Robyn and Kaspalita (eds.). lulu.com, 77. Retrieved from https://www.lulu.com/en/us/shop/kaspalita-and-fiona-robyn/pay-attention-a-river-of-stones/ebook/product-1vkzw9kr.html
•
E. Jason Riedy. 2010. Here, on the farthest point of the peninsula. in Read write poem NaPoWriMo anthology, Dana Martin Guthrie (ed.). issuu.com, 86. Retrieved from http://issuu.com/readwritepoem/docs/read_write_poem_napowrimo_anthology

External Publication Lists

Lists at various external bibliography services:

Grants

•
Martin Deneroff (PI) and Jason Riedy (coPI). 2021. Non-blocking updates to graph databases. Lucata Corporation. $255 916.
•
Jeffrey Young (PI), Jennifer Hasler, Ada Gavrilovska, Thomas Conte, and Jason Riedy. 2020. CCRI: Medium: Rogues gallery: A community research infrastructure for post-moore computing. Georgia Institute of Technology. $1 351 699.
•
Jeffery Young (PI), Hyesoon Kim, Jason Riedy, and Lee Lerner. 2020. Reconfigurable cluster initiative. Georgia Institute of Technology. $74 905.
•
Jason Riedy (PI), Will Powell, and David Bader. 2019. POWER systems for data analysis and HPC classes. Georgia Institute of Technology. $96 272.
•
Jason Riedy (coPI), Haesun Park, and David A. Bader (PI). 2018. High-performance data analytics (HPDA) research topics. Georgia Institute of Technology. $100 000.
•
E. Jason Riedy (PI), David A. Bader, and Thomas M. Conte. 2017. Evaluating memory-centric architectures for high performance data analysis. Georgia Institute of Technology. $662 525.
•
Jeffrey S. Young (PI), Jason Riedy (coPI), and Richard Vuduc (coPI). 2017. CDS&E: SuperSTARLU - STacked, AcceleRated Algorithms for sparse linear systems. Georgia Institute of Technology. $500 000.
•
E. Jason Riedy (PI) and David Bader. 2016. Support for data analytics for CSE programs and courses. Georgia Institute of Technology. $194 150.
•
Jack Dongarra (PI UTK), Jason Riedy (coPI GT), Richard Vuduc (coPI GT), Piotr Luszczek (coPI UTK), and David A. Bader (PI GT). 2015. Collaborative Research: EMBRACE: Evolvable Methods for Benchmarking Realism through Application and Community Engagement. Georgia Institute of Technology. $125 000.
•
Viktor Prasanna (PI USC), E. Jason Riedy (coPI GT), Rich Vudic (coPI GT), and David A. Bader (PI GT). 2013. SI2-SSI: Collaborative: The XScala project: A community repository for model-driven design and tuning of data-intensive applications for extreme-scale accelerator-based systems. Georgia Institute of Technology. $1 937 624, ($1 188 710 GA Tech portion).
•
Viktor Prasanna (PI USC), Manish Parashar (PI Rutgers), Jason Riedy (coPI GT), Rich Vuduc (coPI GT), Yogesh Simmhan (coPI USC), Shantenu Jha (coPI Rutgers), and David A. Bader (PI GT). 2012. Collaborative research: Software infrastructure for accelerating grand challenge science with future computing platforms. Georgia Institute of Technology. $104 386.
•
E. Jason Riedy (coPI) and David A. Bader (PI). 2012. GRATEFUL: GRaph Analysis Tackling power EFficiency, Uncertainty, and Locality. Georgia Institute of Technology. $2 929 819.
•
E. Jason Riedy (PI) and David A. Bader. 2012. Oracle: Multithreaded algorithms. Georgia Institute of Technology. $118 000.
•
E. Jason Riedy (PI) and Logan Moon. 2011. Teaching massive data analysis and manycore computing. Georgia Institute of Technology. $223 800.
•
E. Jason Riedy (coPI) and David A. Bader (PI). 2011. Benchmarking the IBM PERCS and Cray CASCADE architectures. Georgia Institute of Technology. $287 994.
•
E. Jason Riedy (PI). 2011. Evaluating PGAS scientific graph analysis codes on the Gemini interconnect. Georgia Institute of Technology. 250 000 hours of DoE processing time.
•
E. Jason Riedy (PI) and David A. Bader. 2010. STING: Spatio-temporal interaction networks and graphs; an open-source dynamic graph package for intel platforms. Georgia Institute of Technology. $375 000.
•
E. Jason Riedy (coPI) and David A. Bader (PI). 2009. Dynamic graph data structures in X10. Georgia Institute of Technology. $20 000.

Students Supervised

Teaching Experience

Spring 2021
Teaching/advising Living Building Science. This Vertically Integrated Project is a continuation of Bee-Snap in the wider perspective of the Kendeda Living Building at Georgia Tech. We are continuing the honeybee related projects while also lending data analysis expertise to other groups within the larger project.
Fall 2015 – Fall 2020
Teaching/advising Bee-Snap, a Vertically Integrated Project collecting and analyzing big data about bee-flower interactions on the Georgia Tech campus and beyond to inform property owners and policy makers about how land use can support pollinator health. With Jennifer Leavey in Biology. Students have won Serve-Learn-Sustain poster sessions, both 1st and 2nd place. "Thank a Teacher" award in fall 2017. Number of undergraduates varies per semester. Internal funding for class projects. Internal link: https://vip.gatech.edu/wiki/index.php/Bee-Snap (Previously also with Bistra Dilkina and Polo Chau in CSE.)
Spring 2019 – Spring 2020
Teaching/advising a Vertically Integrated Project introducing undergraduates to novel architectures via the Rogues Gallery. With Jeffrey Young.
Fall 2014 – May 2016
Advising of a Masters thesis into trade-offs between community quality and change size when adapting to streaming data. Student: Pushkar Godbolé. Title: Agglomerative Clustering for Community Detection in Dynamic Graphs. (joined Yelp)
Summer 2014
Advising of two undergraduate CRUISE students in graph analysis projects in projects on sparse matrix - sparse vector products for graph analysis and identifying key members in graph communities.
Spring 2013, Fall 2013
Advising of Masters level research project in social network data acquisition and analysis.
Fall 2012
Guest lectures in CSE8803-MGA, Georgia Tech's special topics class in massive graph analysis. Topics include streaming graph analysis, parallel community detection, and experiment design.
Spring, Fall 2010
Guest lectures in CSE6140, Georgia Tech's parallel algorithms and applications class. Topics include floating-point arithmetic, parallel linear algebra, and parallel programming environments.
Spring 2010
Shared advising of Masters level research project in seeded community detection.
Fall 2008
Adjunct faculty in mathematics at Virginia Intermont College. Teaching Concepts of Modern Mathematics I (focused on elementary education majors) and Discrete Mathematics I (required mathematics class for most majors). Constructed the programs from only the required textbook.
Fall 2006, Spring 2007
Mentor for Intel Undergraduate Research program. Introduced undergraduates into our research group on both mathematical and technical levels.
Spring 2000, 2004
Assistant for Applications of Parallel Computing. Multidisciplinary, graduate level class focused on introducing scientists to practical aspects of high-performance computers, tools, and programming.

Conference Tutorials

•
Jeffrey Young, Patrick Lavin, Jason Riedy, and Srinivas Eswar. 2022. Exploring graph analysis for HPC with near-memory accelerators. IEEE high performance extreme computing (HPEC). https://crnch-rg.gitlab.io/pearc-2019/,. Retrieved from https://github.com/gt-crnch-rg/lucata-pathfinder-tutorial
•
E. Jason Riedy and Jeffrey S. Young. 2019. Programming novel architectures in the post-Moore era with the Rogues Gallery. https://crnch-rg.gitlab.io/pearc-2019/. Retrieved from https://crnch-rg.gitlab.io/pearc-2019/
•
E. Jason Riedy and Jeffrey S. Young. 2019. Programming novel architectures in the post-Moore era with the Rogues Gallery. https://crnch-rg.gitlab.io/asplos-2019/. Retrieved from https://crnch-rg.gitlab.io/asplos-2019/
•
David Ediger, Jason Riedy, Rob McColl, and D. B. 2012. Parallel programming for graph analysis. Retrieved from http://www.cc.gatech.edu/~bader/papers/GraphAnalysisTutorial-PPoPP2012.html
•
D. B., David Ediger, and E. Jason Riedy. 2011. Parallel programming for graph analysis.
•
D. B., David Ediger, and E. Jason Riedy. 2011. Parallel programming for graph analysis. Retrieved from http://www.cc.gatech.edu/~bader/papers/GraphAnalysisTutorial-PPoPP2011.html

Professional Societies

Association for Computing Machinery
Member since 1992. Univ. of Florida secretary 1995-1997.
Society for Industrial and Applied Mathematics
Member since 2000.
Diversity Advisory Committee
2026-01-01 – 2028-12-31
Society of Physics Students
Member 1993-1996. Univ. of Florida local officer 1994-1996.
IEEE
Member since 2009. Standards Association member as necessary.

Professional Service

  • Standardization committees:
    • IEEE 754-2xxx working group
    • IEEE P3109 working group
    • IEEE 754-2019 revision committee member, ballot resolution sub-committee member
    • IEEE 754-2008 revision committee member, website and email archive maintenance
  • Program committee member for (partial list):
    • Euro-PAR 2024, 2025
    • GrAPL 2019, 2025: Workshop on Graphs, Architectures, Programming, and Learning
    • IEEE International Symposium on Computer Arithmetic (ARITH) 2021–2024, 2026
    • IEEE International Parallel & Distributed Processing Symposium (IPDPS) 2013, 2016-2018. 2023, 2024
    • International Conference on Parallel Processing (ICPP) 2015, 2019, 2020
    • Workshop on Irregular Applications: Architectures and Algorithms 2019
    • PAW-ATM 2019: Parallel Applications Workshop – Alternatives to MPI
    • Technical program of the International Conference for High Performance Computing, Networking, Storage, and Analysis (SC) 2019
    • IEEE International Conference on High Performance Computing (HiPC) 2013, 2017, 2018
    • First Workshop on High Performance Graph Data Mining and Machine Learning (HPGDML) 2017
    • First Workshop on the Intersection of Graph Algorithms and Machine Learning (GRAML) 2017
    • Workshop on Irregular Applications: Architectures and Algorithms (IA3) 2016, 2017
    • Architecture, Languages, Compilation and Hardware support for Emerging ManYcore systems (ALCHEMY) 2015, 2017
    • Workshop on High Performance Graph Data Management and Processing (HPGDMP) 2016
    • High Performance Graph Processing 2016
    • Graph Data Management Experiences and Systems (GRADES) 2014, 2015
    • Second SDM Workshop on Mining Networks and Graphs: A Big Data Analytic Challenge 2015
    • 8th Workshop on Multithreaded Architectures and Applications (MTAAP) 2014
  • Referee/technical reviewer for (partial list):
    • ACM Journal of Experimental Algorithmics (JEA)
    • ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)
    • ACM Transactions on Architecture and Code Optimization (TACO)
    • ACM Transactions on Knowledge Discovery from Data (TKDD)
    • ACM Transactions on Mathematical Software (TOMS)
    • ACM/IEEE International Conference on Grid Computing (GRID)
    • Algorithms and Data Structures Symposium (WADS)
    • Circlet Press
    • Computer Journal
    • European Symposium on Algorithms (ESA)
    • IBM Journal of Research and Development
    • IEEE Cluster
    • IEEE International Parallel and Distributed Processing Symposium (IPDPS)
    • IEEE Transactions on Computers
    • IEEE Transactions on Emerging Topics in Computing
    • IEEE Transactions on Intelligent Systems and Technology
    • IEEE Transactions on Knowledge and Data Engineering
    • IEEE Transactions on Parallel and Distributed Systems (TPDS)
    • Innovating Parallel Computing (INPAR)
    • International Conference for High Performance Computing, Networking, Storage and Analysis (SC)
    • International Journal of High Performance Computing (IJHPC)
    • International Symposium on Code Generation and Optimization (CGO)
    • International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)
    • International Symposium on Distributed Computing (DISC)
    • International Symposium on Experimental Algorithms (SEA)
    • International Workshop on Accelerators and Hybrid Exascale Systems (AsHES)
    • Journal of Combinatorial Optimization
    • Journal of Parallel and Distributed Computing (JPDC)
    • Journal of Systems and Software
    • O'Reilly
    • Parallel Computing
    • SIAM Journal on Matrix Analysis and Applications (SIMAX)
    • SIAM Journal on Scientific Computing (SISC)
    • SIAM/ACM Algorithm Engineering and Experiments (ALENEX)
    • 10th DIMACS Implementation Challenge

Pseudo-Social Media

There all are inherently personal and do not represent any entity other than myself:

Interesting Mentions

•
Infocom. 1989. The Status Line. Solved Puzzle #18. Retrieved from https://archive.org/details/Status_Line_The_Vol._VIII_No._1_1984-01_Infocom_US
•
Wikimedia. Various uses. Retrieved from https://www.google.com/search?q=wikimedia+%22Jason+Riedy%22