This work is licensed under a Creative Commons
Attribution 3.0 Unported License.
Other formats:
Contents:
What algorithmic, linguistic, and architectural aspects permit high-performance static and dynamic graph analysis? In which graph-structured data domains?
How do we evolve programming environments to support multicore, heterogeneous, and accelerator-based computing’s huge design space?
Which applications benefit from computing precise results with targeted software arithmetic?
How can parallel symbolic matrix analysis incorporate latency-avoiding factorization techniques?
Can formal semantics enable faster, safer floating-point compiler optimizations?
Is a linear-time (O(vertices + edges)) bipartite matching algorithm possible?
Are Sturm count calculations on factored tridiagonal matrices monotonic in floating-point arithmetic?
DARPA GRATEFUL: Graph analysis optimizing power and efficiency.
STING — Spatio-Temporal Interaction Networks and Graphs An open-source dynamic graph package for Intel platforms.
Evaluation of the PERCS architecture.
CASS-MT — Massively parallel graph analysis (currently 537M node, 8.6B edge), threaded architectures, streaming data analysis and error modeling.
LAPACK, ScaLAPACK, and XBLAS (dense linear algebra) — Extra-precise linear system refinement algorithms, eigenvalue routines, and optimization.
SuperLU (sparse linear algebra) — Parallel combinatorial preprocessing, numerical stability analysis, iterative solver preconditioning.
IEEE-754 revision (floating-point arithmetic) — Programming language interactions, exceptional behavior, decimal formats and arithmetic.
Image Algebra (image analysis) — SIMD parallel optimization, edge detection, geometric hashing.
Defining the Graph500 benchmark and providing the reference implementations for sequential and shared memory platforms (OpenMP, Cray XMT).
CASS-MT project — 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.
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.
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.
Shared advising of Master's level research project in seeded community detection.
Adjunct faculty in mathematics at Virginia Intermont College. Teaching Concepts of Modern Mathematics I and Discrete Mathematics I.
Mentor for Intel Undergraduate Research program. Introduced undergraduates into our research group on both mathematical and technical levels.
Assistant for Applications of Parallel Computing: Multidisciplinary, graduate level class focused on introducing scientists to practical aspects of high-performance computers, tools, and programming.
Public, parallel, scale-optimized community detection code for shared-memory platforms that supports plug-able community metrics and high performance. Winner of the 10th DIMACS Implementation Challenge's Mix and Mix Pareto challenges.
Developer for Georgia Tech's STING package for Spatio-Temporal Interaction Networks and Graphs.
Support and optimization in Georgia Tech's Graph Characterization Toolkit.
Research code for distributed-memory weighted bipartite matching through a scaling auction algorithm.
Prototypes for LAPACK’s extra-precise refinement codes; XBLAS Fortran/C integration.
Optimized Sturm count routines and debugged eigenvalue drivers in LAPACK 3.1.
Enhanced and optimized Householder reflection generation and application in LAPACK.
Simple database interface for GNU Octave.
A doubled-native arithmetic library, enabling high-precision sparse matrix factorization with TAUCS.
Contributions and bug fixes to git, GNU Octave, the R Project, GNU Emacs, etc.
Other formats:
with David Ediger, Karl Jiang, and David A. Bader. GraphCT: Multithreaded Algorithms for Massive Graph Analysis. IEEE Transactions in Parallel and Distributed Systems, 2012. (to appear).
with James W. Demmel, Mark Frederick Hoemmen, and Yozo Hida. Non-Negative Diagonals and High Performance on Low-Profile Matrices from Householder QR. SIAM Journal on Scientific Computing, 31(4):2832–2841, 2009. ISSN 1064-8275. doi: 10.1137/080725763.
with James W. Demmel, Yozo Hida, and Xiaoye S. Li. Extra-precise iterative refinement for overdetermined least squares problems. ACM Transactions on Mathematical Software, 35(4):1–32, 2009. ISSN 0098-3500. doi: 10.1145/1462173.1462177
with Osni A. Marques and Christof Vömel. Benefits of IEEE-754 Features in Modern Symmetric Tridiagonal Eigensolvers. SIAM Journal on Scientific Computing, 28(5):1613–1633, 2006. ISSN 1064-8275. doi: 10.1137/050641624.
with James W. Demmel, Yozo Hida, W. Kahan, Xiaoye S. Li, and Sonil Mukherjee. Error bounds from extra-precise iterative refinement. ACM Transactions on Mathematical Software, 32(2):325–351, June 2006. ISSN 0098-3500. doi: 10.1145/1141885.1141894.
Other formats:
with David Ediger, David A. Bader, and Henning Meyerhenke. Computational Graph Analytics for Massive Streaming Data. In Hamid Sarbazi-azad and Albert Zomaya, editors, Large Scale Network-Centric Computing Systems, Parallel and Distributed Computing, chapter 25. Wiley, July 2013. ISBN 978-0470936887. (to appear)
with Joseph N. Wilson, Gerhard X. Ritter, and Hongchi Shi. An Image Algebra Based SIMD Image Processing Environment. In C. W. Chen and Y. Q. Zhang, editors, Visual Information Representation, Communication, and Image Processing, pages 523–542. Marcel Dekker, New York, 1999. ISBN 082471928X. CiteSeer: wilson97image.html.
Other formats:
with David Ediger, Robert McColl, and David A. Bader. STINGER: High Performance Data Structure for Streaming Graphs. In The IEEE High Performance Extreme Computing Conference (HPEC), Waltham, MA, September 2012. Best paper award.
with David A. Bader and Henning Meyerhenke. Scalable Multi-threaded Community Detection in Social Networks. In 6th Workshop on Multithreaded Architectures and Applications (MTAAP), May 2012. (9/15 papers accepted, 60% acceptance)
with Henning Meyerhenke, David Ediger, David A. Bader, and Timothy G. Mattson. Analysis of Streaming Social Networks and Graphs on Multicore Architectures. In IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). Kyoto, Japan, March 2012.
with Henning Meyerhenke, David Ediger, and David A. Bader. Parallel Community Detection for Massive Graphs. In 10th DIMACS Implementation Challenge - Graph Partitioning and Graph Clustering. (workshop paper), Atlanta, Georgia, February 2012. Won first place in the Mix Challenge and Mix Pareto Challenge.
with Henning Meyerhenke, David Ediger, and David A. Bader. Parallel Community Detection for Massive Graphs. In 9th International Conference on Parallel Processing and Applied Mathematics (PPAM11). Springer, September 2011. (134/243 papers accepted, 55% acceptance rate)
with David Ediger and David A. Bader and Henning Meyerhenke. Tracking Structure of Streaming Social Networks. In 5th Workshop on Multithreaded Architectures and Applications (MTAAP), 2011. (10/17 papers accepted, 59% acceptance rate)
with David Ediger, Karl Jiang, David A. Bader, Courtney Corley, Rob Farber, and William N. Reynolds. Massive Social Network Analysis: Mining Twitter for Social Good. In 39th International Conference on Parallel Processing (ICPP), San Diego, CA, September 2010. (70/225 papers accepted: 31.1% acceptance rate)
with David Ediger, Karl Jiang, and David A. Bader. Massive Streaming Data Analytics: A Case Study with Clustering Coefficients. In 4th Workshop on Multithreaded Architectures and Applications (MTAAP), Atlanta, GA, April 2010. (11/22 papers accepted, 50% acceptance rate)
with James W. Demmel, Jack Dongarra, Beresford Parlett, W. Kahan, Ming Gu, David Bindel, Yozo Hida, Xiaoye S. Li, Osni A. Marques, Christof Vömel, Julien Langou, Piotr Luszczek, Jakub Kurzak, Alfredo Buttari, Julie Langou, and Stanimire Tomov. Prospectus for the Next LAPACK and ScaLAPACK Libraries. In PARA'06: State-of-the-Art in Scientific and Parallel Computing, Umeå, Sweden, June 2006. High Performance Computing Center North (HPC2N) and the Department of Computing Science, Umeå University, Springer.
with David Hough, Bill Hay, Jeff Kidder, Guy L. Steele Jr., and Jim Thomas. Arithmetic Interactions: From Hardware to Applications. In 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 2005. ISBN 0-7695-2366-8. doi: 10.1109/ARITH.2005.10. See related presentation.
with Joseph N. Wilson. Efficient SIMD evaluation of image processing programs. In Hongchi Shi and Patrick C. Coffield, editors, Parallel and Distributed Methods for Image Processing, volume 3166, pages 199–210, San Diego, CA, 1997. SPIE. doi: 10.1117/12.279618.
Other formats:
with David Ediger, Rob McColl, and David A. Bader. Parallel Programming for Graph Analysis. In 17th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP), New Orleans, LA, February 2012.
with David A. Bader and David Ediger. Parallel Programming for Graph Analysis. In 16th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP), San Antonio, TX, February 2011.
Other formats:
with David A. Bader, Karl Jiang, Pushkar Pande, and Richa Sharma. Detecting Communities from Given Seeds in Social Networks. Technical Report GT-CSE-11-01, February 2011.
Making Static Pivoting Scalable and Dependable. Technical Report UCB/EECS-2010-172. PhD Thesis, EECS Department, University of California, Berkeley, Dec 2010.
with James W. Demmel, Mark Frederick Hoemmen, and Yozo Hida. Non-Negative Diagonals and High Performance on Low-Profile Matrices from Householder QR. LAPACK Working Note 203, May 2008. Also issued as UCB/EECS-2008-76; modified from SISC version.
with James W. Demmel, Jack Dongarra, Beresford Parlett, W. Kahan, Ming Gu, David Bindel, Yozo Hida, Xiaoye S. Li, Osni A. Marques, Christof Vömel, Julien Langou, Piotr Luszczek, Jakub Kurzak, Alfredo Buttari, Julie Langou, and Stanimire Tomov. Prospectus for the Next LAPACK and ScaLAPACK Libraries. LAPACK Working Note 181, February 2007. Also issued as UT-CS-07-592.
with Osni A. Marques and Christof Vömel. Benefits of IEEE-754 Features in Modern Symmetric Tridiagonal Eigensolvers. LAPACK Working Note 172, September 2005. Also issued as UCB//CSD-05-1414; expanded from SISC version.
with James W. Demmel, Yozo Hida, W. Kahan, Xiaoye S. Li, and Sonil Mukherjee. Error bounds from extra-precise iterative refinement. LAPACK Working Note 165, February 2005. Also issued as UCB//CSD-05-1414, UT-CS-05-547, and LBNL-56965; expanded from TOMS version.
with James W. Demmel, Yozo Hida, and Xiaoye S. Li. Extra-precise iterative refinement for overdetermined least squares problems. LAPACK Working Note 188, May 2007. Also issued as UCB/EECS-2007-77; modified from TOMS version.
Other formats:
with David A. Bader and David Ediger. Streaming Graph Analytics for Massive Graphs. SIAM Annual Meeting, July 2012, (presentation).
with Henning Meyerhenke. Scalable Algorithms for Analysis of Massive, Streaming Graphs. SIAM Parallel Processing for Scientific Computing, February 2012, (minisymposium organizer).
with Henning Meyerhenke. Parallel Community Detection in Streaming Graphs. SIAM Parallel Processing for Scientific Computing, February 2012, (minisymposium organizer).
with David Ediger and Henning Meyerhenke and David A. Bader. Analyzing Massive Networks with GraphCT. SIAM Parallel Processing for Scientific Computing, February 2012, (poster).
with David Ediger and Henning Meyerhenke and David A. Bader. STING: Software for Analysis of Spatio-Temporal Interaction Networks and Graphs. SIAM Parallel Processing for Scientific Computing, February 2012, (poster).
with David A. Bader, Henning Meyerhenke, David Ediger, and Timothy Mattson. STING: Spatio-Temporal Interaction Networks and Graphs for Intel Platforms. Presentation at Intel Corporation, Santa Clara, CA, August 2011, (presentation).
with David Ediger, David A. Bader, and Henning Meyerhenke. Tracking Structure of Streaming Social Networks. 2011 Graph Exploitation Symposium hosted by MIT Lincoln Labs, August 2011, (presentation).
with David Ediger and David A. Bader. Applications in Social Networks. NSF Workshop on Accelerators for Data-Intensive Applications, October 2010, (presentation, ODP).
Dependable direct solutions for linear systems using a little extra precision. CSE Seminar at Georgia Institute of Technology, August 2009, (presentation).
Auctions for Distributed (and Possibly Parallel) Matchings. Visit to CERFACS courtesy of the Franco-Berkeley Fund, December 2008, (presentation).
with James W. Demmel, Yozo Hida, Xiaoye S. Li, Meghana Vishvanath, and David Vu. Precise Solutions for Overdetermined Least Squares Problems. Stanford 50 - Eighth Bay Area Scientific Computing Day, March 2007, (poster).
Making Static Pivoting Dependable. Seventh Bay Area Scientific Computing Day, March 2006, (poster).
with Yozo Hida and James W. Demmel. The Future of LAPACK and ScaLAPACK. Robert C. Thompson Matrix Meeting, November 2005.
Modern Language Tools and 754R. ARITH'05, 2005, (panel participant).
Parallel Combinatorial Computing and Sparse Matrices. SIAM Conference on Computational Science and Engineering, 2005, (minisymposium speaker).
Sparse Data Structures for Weighted Bipartite Matching. SIAM Workshop on Combinatorial Scientific Computing, 2004.
Parallel Weighted Bipartite Matching and Applications. SIAM Parallel Processing for Scientific Computing, 2004, (minisymposium speaker).
Practical Alternatives for Parallel Pivoting. SIAM Annual Meeting, June 2003.
Parallel Bipartite Matching for Sparse Matrix Computations. SIAM Conference on Computational Science and Engineering, February 2003, (poster).
with David Bindel. Exception Handling Interfaces, Implementations, and Evaluation. IEEE-754r revision meeting, August 2002.
Parallel Bipartite Matching for Sparse Matrix Computation. Third Bay Area Scientific Computing Day, March 2002, (poster).
Other formats:
with David A. Bader, Jonathan Berry, Simon Kahan, Richard Murphy, and Jeremiah Willcock. Graph 500 Benchmark 1 ("Search"). October 2010. Version 1.1.
with workshop participants. Report on NSF Workshop on Center Scale Activities Related to Accelerators for Data Intensive Applications, Viktor K. Prasanna and David A. Bader, editors. October 2010. This workshop is supported by NSF Grant Number 1051537, in response to the Call for Exploratory Workshop Proposals for Scientific Software Innovation Institutes (S2I2).
with Jack Dongarra and Julien Langou. Sca/LAPACK Program Style. August 2006.
Type System Support for Floating-Point Computation. May 2001.
with Robert Szewczyk. Power and Control in Networked Sensors. May 2000. CiteSeer: riedy00power.html. Cited.
with Rich Vuduc. Microbenchmarking the Tera MTA. May 1999. Cited, presentation version available.
Other formats:
IEEE-754 revision committee member, website and email archive maintenance.
Program committee member for IEEE Int’l Parallel & Distributed Processing Symposium 2013.
Referee/technical reviewer for Parallel Computing, SIAM Journal on Matrix Analysis and Applications (SIMAX), IBM Journal of Research and Development, IEEE Transactions on Computers, SIAM/ACM ALENEX, INPAR, Algorithms and Data Structures Symposium (WADS), IEEE Cluster, Grid, MTAAP, ACM Trans. on Math. Soft., IEEE Arith, IEEE Int'l Parallel & Distributed Processing Symposium, Int'l Symposium on Experimental Algorithms, Computers and Mathematics with Applications, O'Reilly.
This work is licensed under a Creative Commons
Attribution 3.0 Unported License.