Kamesh Madduri

Computer Science and Engineering
The Pennsylvania State University
343E IST Building, University Park, PA 16802
814-865-0883   madduri at cse.psu.edu

Education

• Georgia Institute of Technology, Atlanta, GA
  Ph.D., Computer Science, 2005 -- 2008.
  Specialization: Computational Science and Engineering.
• University of New Mexico, Albuquerque, NM
  M.S., Electrical and Computer Engineering, 2004 -- 2005.
  
• Indian Institute of Technology Madras, Chennai, India
  B.Tech., Electrical Engineering, 2000 -- 2004.

Employment

• The Pennsylvania State University, University Park, PA
  Assistant Professor, Department of Computer Science and Engineering.
  August 2011 -- Present.
• Lawrence Berkeley National Laboratory, Berkeley, CA
  Guest Scientist, July 2011 -- Present.
  Research Scientist, Aug 2010 -- July 2011.
  Postdoctoral Fellow, Aug 2008 -- Aug 2010.
  

Research Interests

High-performance computing and computational science applications; Parallel combinatorial algorithm design, with applications to computational biology and social network analysis; Scientific data analysis and management.

Honors and Awards

1. Best Paper Award, 42nd International Conference on Parallel Processing (ICPP), 2013
2. NSF CAREER Award, 2013.
3. SIAM Activity Group on Supercomputing Junior Scientist Prize, 2010.
4. Luis W. Alvarez Postdoctoral Fellowship in Computational Science, Lawrence Berkeley National Laboratory, 2008-10.
5. Outstanding Graduate Research Assistant award, College of Computing, Georgia Institute of Technology, 2008.
6. Best Poster Award, IEEE Technical Committee for Parallel Processing (TCPP) PhD Forum held at the 22nd International Parallel and Distributed Processing Symposium (IPDPS), 2008.
7. ACM/IEEE-CS High Performance Computing Ph.D. Fellowship Honorable Mention, 2007.
8. NASA Graduate Student Researchers Program (GSRP) Fellowship, 2006-08.
9. NSF Graduate Research Fellowship Program (GRFP) Honorable Mention, 2005.

Publications

Refereed Journal Publications

1. L. Leonard, K. Madduri, and C. Duffy, “Tuning heterogeneous computing platforms for large-scale hydrology data management,” IEEE Trans. Parallel Distrib. Syst., vol. PP, no. 99, 2015.
2. G. M. Slota and K. Madduri, “Parallel color-coding,” Parallel Computing, vol. 47, pp. 51-69, 2015.
3. K. Z. Ibrahim, K. Madduri, S. Williams, B. Wang, S. Ethier, and L. Oliker, “Analysis and optimization of gyrokinetic toroidal simulations on homogenous and heterogenous platforms,” Int'l. Journal of High Performance Computing Applications (IJHPCA), vol. 27, no. 4, pp. 454-473, 2013.
4. K. Madduri, J. Su, S. Williams, L. Oliker, S. Ethier, and K. Yelick, “Optimization of parallel particle-to-grid interpolation on leading multicore platforms,” IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 10, pp. 1915-1922, 2012.
5. K. Madduri, E.-J. Im, K. Z. Ibrahim, S. Williams, S. Ethier, and L. Oliker, “Gyrokinetic particle-in-cell optimization on emerging multi- and manycore platforms,” Parallel Computing, vol. 37, no. 9, pp. 501-520, 2011.
6. K. Subramani and K. Madduri, “Two-level heaps: a new priority queue structure with applications to the single source shortest path problem,” Computing, vol. 90, no. 3-4, pp. 113-130, 2010.
7. J. Orlin, K. Madduri, K. Subramani, and M. Williamson, “A faster algorithm for the single source shortest path problem with few distinct positive lengths,” Journal of Discrete Algorithms, vol. 8, no. 2, pp. 189-198, 2010.
8. K. Subramani, C. Tauras, and K. Madduri, “Space-time tradeoffs in negative cycle detection - an empirical analysis of the Stressing algorithm,” Applied Mathematics and Computation, vol. 215, no. 10, pp. 3563-3575, 2010.
9. D. A. Bader and K. Madduri, “A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms,” Parallel Computing, vol. 34, no. 11, pp. 627-639, 2008.
10. K. Subramani and K. Madduri, “A Randomized Queueless Algorithm for Breadth-First Search,” Int'l. Journal of Computers and their Applications, vol. 15, no. 3, pp. 177-186, 2008.
11. D. A. Bader, V. Agarwal, K. Madduri, and S. Kang, “High performance combinatorial algorithm design on the Cell Broadband Engine processor,” Parallel Computing, vol. 33, no. 10-11, pp. 720-740, 2007.
12. D. A. Bader, K. Madduri, J. R. Gilbert, V. Shah, J. Kepner, T. Meuse, and A. Krishnamurthy, “Designing Scalable Synthetic Compact Applications for Benchmarking High Productivity Computing Systems,” CTWatch Quarterly, vol. 2, no. 4B, pp. 41-51, 2006.

Refereed Conference and Workshop Publications

1. V. Rengasamy and K. Madduri, “SPRITE: A fast parallel SNP detection pipeline,” in Proc. ISC High Performance. Springer, Jun. 2016.
2. G. M. Slota, S. Rajamanickam, and K. Madduri, “A case study of complex graph analysis in distributed memory: Implementation and optimization,” in Proc. 30th IEEE Int'l. Parallel and Distributed Processing Symposium (IPDPS). IEEE, May 2016.
3. H. Zhan and K. Madduri, “ GSK: Graph Sparsification as a Knapsack problem formulation,” in Proc. 3rd SDM Workshop on Mining Networks and Graphs (MNG), May 2016.
4. L. Leonard, K. Madduri, and C. J. Duffy, “Graph-based analysis for large-scale hydrological modeling,” in Proc. IEEE VIS Exploring Graphs at Scale (EGAS) Workshop, Oct. 2015.
5. G. M. Slota, S. Rajamanickam, and K. Madduri, “High-performance graph analytics on manycore processors,” in Proc. 29th IEEE Int'l. Parallel and Distributed Processing Symposium (IPDPS). IEEE, May 2015, pp. 17-27.
6. G. M. Slota and K. Madduri, “Simple parallel biconnectivity algorithms for multicore platforms,” in Proc. 20th IEEE Int'l. Conf. on High Performance Computing (HiPC). IEEE, Dec. 2014, pp. 1-10.
7. G. M. Slota, K. Madduri, and S. Rajamanickam, “PuLP: Scalable multi-objective multi-constraint partitioning for small-world networks,” in Proc. 2nd IEEE Int'l. Conf. on Big Data (BigData). IEEE, Oct. 2014, pp. 481-490.
8. T. Panitanarak and K. Madduri, “Performance analysis of single-source shortest path algorithms on distributed-memory systems,” in Proc. 6th SIAM Workshop on Combinatorial Scientific Computing (CSC), Jul. 2014, pp. 60-63.
9. G. M. Slota, S. Rajamanickam, and K. Madduri, “BFS and Coloring-based parallel algorithms for strongly connected components and related problems,” in Proc. 28th IEEE Int'l. Parallel and Distributed Processing Symposium (IPDPS). IEEE, May 2014, pp. 550-559.
10. G. M. Slota and K. Madduri, “Complex network analysis using parallel approximate motif counting,” in Proc. 28th IEEE Int'l. Parallel and Distributed Processing Symposium (IPDPS). IEEE, May 2014, pp. 405-414.
11. J. Choi, A. Chandramowlishwaran, K. Madduri, and R. Vuduc, “A CPU-GPU hybrid implementation and model-driven scheduling of the Fast Multipole Method,” in Proc. 7th Workshop on General Purpose Processing using GPUs (GPGPU), Mar. 2014, pp. 64:1-64:8.
12. B. Wang, S. Ethier, W. Tang, T. Williams, K. Ibrahim, K. Madduri, S. Williams, and L. Oliker, “Kinetic turbulence simulations at extreme scale on leadership-class systems,” in Proc. ACM/IEEE Conf. on Supercomputing (SC), Nov. 2013, pp. 82:1-82:12.
13. G. Slota and K. Madduri, “Fast approximate subgraph counting and enumeration,” in Proc. 42nd Int'l. Conf. on Parallel Processing (ICPP), Oct. 2013, pp. 210-219.
14. D. Hadka, P. Reed, and K. Madduri, “Scalability analysis of the asynchronous, master-slave multiobjective evolutionary algorithm,” in Proc. 16th Int'l. Workshop on Nature Inspired Distributed Computing (NIDISC), May 2013, pp. 425-434.
15. M. Frasca, K. Madduri, and P. Raghavan, “NUMA-aware graph mining techniques for performance and energy efficiency,” in Proc. ACM/IEEE Conf. on Supercomputing (SC), Nov. 2012, pp. 95:1-95:11.
16. A. Chandramowlishwaran, J. Choi, K. Madduri, and R. W. Vuduc, “Brief announcement: Towards a Communication optimal Fast Multipole Method and its implications at Exascale,” in Proc. 24th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA). ACM, Jun. 2012, pp. 182-184.
17. A. Buluç and K. Madduri, “Graph partitioning for scalable distributed graph computations,” in Proc. 10th DIMACS Implementation Challenge Workshop - Graph Partitioning and Graph Clustering, Feb. 2012.
18. K. Madduri, K. Z. Ibrahim, S. Williams, E.-J. Im, S. Ethier, J. Shalf, and L. Oliker, “Gyrokinetic toroidal simulations on leading multi- and manycore HPC systems,” in Proc. Conf. on High Performance Computing, Networking, Storage and Analysis (SC). ACM, Nov. 2011, p. 23.
19. A. Buluç and K. Madduri, “Parallel breadth-first search on distributed memory systems,” in Proc. Conf. on High Performance Computing, Networking, Storage and Analysis (SC). ACM, Nov. 2011, p. 65.
20. K. Madduri and K. Wu, “Massive-scale RDF processing using compressed bitmap indexes,” in Proc. 23rd Int'l. Conf. on Scientific and Statistical Database Management (SSDBM), ser. LNCS, J. B. Cushing, J. C. French, and S. Bowers, Eds., vol. 6809. Springer, Jul. 2011, pp. 470-479.
21. R. Sudarsan, J. Borrill, C. Cantalupo, T. Kisner, K. Madduri, L. Oliker, Y. Zheng, and H. Simon, “Cosmic microwave background map-making at the petascale and beyond,” in Proc. 25th Int'l. Conf. on Supercomputing (ICS). ACM, May-June 2011, pp. 305-316.
22. A. Chandramowlishwaran, K. Madduri, and R. Vuduc, “Diagnosis, tuning, and redesign for multicore performance: A case study of the Fast Multipole Method,” in Proc. Conf. on High Performance Computing, Networking, Storage and Analysis (SC). ACM/IEEE, Nov. 2010, pp. 1-12.
23. E. Strohmaier, S. Williams, A. Kaiser, K. Madduri, K. Ibrahim, D. Bailey, and J. W. Demmel, “A kernel testbed for parallel architecture, language, and performance research,” in Proc. 8th Int'l. Conf. of Numerical Analysis and Applied Mathematics (ICNAAM), ser. AIP Conference Proceedings, vol. 1281, Sep. 2010, pp. 1297-1300.
24. K. Wu, K. Madduri, and S. Canon, “Multi-level bitmap indexes for flash memory storage,” in Proc. 14th Int'l. Database Engineering & Applications Symposium (IDEAS). ACM, Aug. 2010, pp. 114-116.
25. A. Kaiser, S. Williams, K. Madduri, K. Ibrahim, D. H. Bailey, J. Demmel, and E. Strohmaier, “A case for a testbed of kernels for software/hardware co-design research,” in Proc. 2nd USENIX Workshop on Hot Topics in Parallelism (HotPar). USENIX, Jun. 2010.
26. K. Madduri, S. Williams, S. Ethier, L. Oliker, J. Shalf, E. Strohmaier, and K. Yelick, “Memory-efficient optimization of gyrokinetic particle-to-grid interpolation for multicore processors,” in Proc. ACM/IEEE Conf. on High Performance Computing (SC). ACM/IEEE, Nov. 2009.
27. K. Madduri and K. Wu, “Efficient joins with compressed bitmap indices,” in Proc. 18th ACM Conf. on Information and Knowledge Management (CIKM). ACM, Nov. 2009, pp. 1017-1026.
28. X. Gu, K. Madduri, K. Subramani, and H.-J. Lai, “Improved algorithms for detecting negative cost cycles in undirected graphs,” in Proc. 3rd Int'l. Frontiers of Algorithmics Workshop (FAW), ser. LNCS, X. Deng, J. Hopcroft, and J. Xue, Eds., vol. 5598. Springer, Jun. 2009, pp. 40-50.
29. K. Subramani and K. Madduri, “Two-level heaps: a new priority queue structure with applications to the single source shortest path problem,” in Proc. 3rd Int'l. Conf. on Combinatorial Optimization and Applications (COCOA), ser. LNCS, D.-Z. Du, X. Hu, and P. Pardalos, Eds., vol. 5573. Springer, Jun. 2009, pp. 186-196.
30. K. Madduri, D. Ediger, K. Jiang, D. A. Bader, and D. Chavarria-Miranda, “A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets,” in Proc. 3rd Workshop on Multithreaded Architectures and Applications (MTAAP). IEEE Computer Society, May 2009.
31. K. Madduri and D. A. Bader, “Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis,” in Proc. 23rd IEEE Int'l. Parallel and Distributed Processing Symposium (IPDPS). IEEE Computer Society, May 2009.
32. D. A. Bader and K. Madduri, “SNAP: Small-world Network Analysis and Partitioning: an open-source parallel graph framework for the exploration of large-scale networks,” in Proc. 22nd IEEE Int'l. Parallel and Distributed Processing Symposium (IPDPS). IEEE, Apr. 2008.
33. K. Subramani and K. Madduri, “Accomplishing Approximate FCFS fairness without queues,” in Proc. 14th Int'l. Conf. on High Performance Computing (HiPC), ser. LNCS, S. Aluru, M. Parashar, R. Badrinath, and V. Prasanna, Eds., vol. 4873. Springer, Dec. 2007, pp. 540-551.
34. D. A. Bader, S. Kintali, K. Madduri, and M. Mihail, “Approximating betweenness centrality,” in Proc. 5th Int'l. Workshop on Algorithms and Models for the Web-Graph (WAW), ser. LNCS, A. Bonato and F. Chung, Eds., vol. 4863. Springer, Dec. 2007, pp. 124-137.
35. J. R. Crobak, J. Berry, K. Madduri, and D. A. Bader, “Advanced shortest paths algorithms on a massively-multithreaded architecture,” in Proc. 1st Workshop on Multithreaded Architectures and Applications (MTAAP). IEEE, Mar. 2007.
36. D. A. Bader, V. Kanade, and K. Madduri, “SWARM: A parallel programming framework for multicore processors,” in Proc. 1st Workshop on Multithreaded Architectures and Applications (MTAAP). IEEE, Mar. 2007.
37. D. A. Bader, V. Agarwal, and K. Madduri, “On the design and analysis of irregular algorithms on the Cell processor: A case study of list ranking,” in Proc. 21st IEEE Int'l. Parallel and Distributed Processing Symposium (IPDPS). IEEE, Mar. 2007.
38. D. A. Bader and K. Madduri, “A graph-theoretic analysis of the human protein-interaction network using multi-core parallel algorithms,” in Proc. 6th IEEE Int'l. Workshop on High-Performance Computational Biology (HiCOMB). IEEE, Mar. 2007.
39. K. Madduri, D. A. Bader, J. W. Berry, and J. R. Crobak, “An experimental study of a parallel shortest path algorithm for solving large-scale graph instances,” in Proc. 9th Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, Jan. 2007.
40. D. A. Bader and K. Madduri, “Parallel algorithms for evaluating centrality indices in real-world networks,” in Proc. 35th Int'l. Conf. on Parallel Processing (ICPP). IEEE Computer Society, Aug. 2006, pp. 539-550.
41. D. A. Bader and K. Madduri, “Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2,” in Proc. 35th Int'l. Conf. on Parallel Processing (ICPP). IEEE Computer Society, Aug. 2006, pp. 523-530.
42. D. A. Bader and K. Madduri, “Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors,” in Proc. 12th Int'l. Conf. on High Performance Computing (HiPC), ser. LNCS, D. A. Bader, M. Parashar, S. Varadarajan, and V. K. Prasanna, Eds., vol. 3769. Springer, Dec. 2005, pp. 465-476.
43. D. A. Bader and K. Madduri, “A parallel state assignment algorithm for finite state machines,” in Proc. 11th Int'l. Conf. on High Performance Computing (HiPC), ser. LNCS, L. Bougé and V. K. Prasanna, Eds., vol. 3296. Springer, Dec. 2004, pp. 297-308.
44. K. Madduri, K. H. Aparna, and V. S. Chakravarthy, “PATRAM: A handwritten word processor for Indian languages,” in Proc. 9th Int'l. Workshop on Frontiers in Handwriting Recognition (IWFHR). IEEE Computer Society, Aug. 2004, pp. 557-562.

Book Chapters

1. A. Buluç and K. Madduri, “Graph partitioning for scalable distributed graph computations,” in Graph Partitioning and Graph Clustering, D. Bader, H. Meyerhenke, P. Sanders, and D. Wagner, Eds. AMS, 2013, ch. 6, pp. 81-100.
2. D. A. Bader and K. Madduri, “Computational challenges in emerging combinatorial scientific computing applications,” in Combinatorial Scientific Computing, U. Naumann and O. Schenk, Eds. Boca Raton, FL: Chapman and Hall/CRC, 2012, ch. 17, pp. 471-494.
3. K. Madduri, “SNAP (Small-World Network Analysis and Partitioning) framework,” in Encyclopedia of Parallel Computing, D. A. Padua, Ed. Springer, 2011, pp. 1832-1837.
4. D. A. Bader, C. E. Heitsch, and K. Madduri, “Large-scale network analysis,” in Graph Algorithms in the Language of Linear Algebra, J. Kepner and J. Gilbert, Eds. Philadelphia, PA: SIAM, 2011, ch. 12, pp. 253-285.
5. D. A. Bader, V. Agarwal, K. Madduri, and F. Petrini, “Combinatorial algorithm design on the Cell/B.E. processor,” in Scientific Computing with Multicore and Accelerators, J. Kurzak, D. A. Bader, and J. Dongarra, Eds. Boca Raton, FL: CRC Press, 2010, ch. 10, pp. 195-216.
6. K. Madduri, D. A. Bader, J. W. Berry, and J. R. Crobak, “Parallel shortest path algorithms for solving large-scale instances,” in The Shortest Path Problem: Ninth DIMACS Implementation Challenge, C. Demetrescu, A. V. Goldberg, and D. Johnson, Eds. Providence, RI: AMS, 2009, vol. 74, pp. 249-290.
7. K. Madduri, D. A. Bader, J. W. Berry, J. R. Crobak, and B. A. Hendrickson, “Multithreaded algorithms for processing massive graphs,” in Petascale Computing: Algorithms and Applications, D. Bader, Ed. Boca Raton, FL: Chapman and Hall/CRC, 2007, ch. 12, pp. 237-262.
8. D. A. Bader, K. Madduri, G. Cong, and J. Feo, “Design of multithreaded algorithms for combinatorial problems,” in Handbook of Parallel Computing: Models, Algorithms, and Applications, S. Rajasekaran and J. Reif, Eds. Boca Raton, FL: Chapman and Hall/CRC, 2007, ch. 31, pp. 1-29.

Conference and Workshop Publications without Proceedings

1. H. Zhan and K. Madduri, “A combinatorially-interpretable matrix factorization for network community structure evaluation,” SIAM Annual Meeting, Jul. 2016.
2. G. M. Slota, S. Rajamanickam, and K. Madduri, “PuLP: Complex objective partitioning of small-world networks using label propagation,” SIAM Conf. on Computational Science and Engineering, March 2015.
3. G. Slota, S. Rajamanickam, and K. Madduri, “Parallel strongly connected components in shared memory architectures,” SIAM Conf. on Parallel Processing for Scientific Computing, Feb. 2014.
4. G. Slota and K. Madduri, “Characterizing biological networks using subgraph counting and enumeration,” SIAM Conf. on Parallel Processing for Scientific Computing, Feb. 2014.
5. K. Madduri, “Parallel analysis of graph-structured data in genomics and proteomics,” First Int'l. Workshop on Big Data in Life Sciences (BigLS), Jun. 2013.
6. K. Madduri, “High-performance metagenomic data clustering and assembly,” SIAM Annual Meeting, Jul. 2012.
7. K. Madduri, “Scalable SPARQL querying with compressed bitmap indexes,” SIAM Conf. on Parallel Processing for Scientific Computing, Mar. 2012.
8. K. Madduri, “Optimizing short-read genome assembly algorithms for emerging multicore platforms,” SIAM Conf. on Computational Science and Engineering, February-March 2011.
9. K. Madduri, “Hybrid parallel programming for massive graph analysis,” SIAM Annual Meeting, Jul. 2010.
10. K. Madduri, “Scaling up graph algorithms on emerging multicore systems,” SIAM Annual Meeting, Jul. 2009.
11. K. Madduri, “High performance combinatorial techniques for processing dynamic interaction networks,” SIAM Conf. on Parallel Processing for Scientific Computing, Mar. 2008.
12. D. A. Bader and K. Madduri, “High-performance combinatorial techniques for analyzing massive dynamic interaction networks,” DIMACS/DyDAn Workshop on Computational Methods for Dynamic Interaction Networks, Sep. 2007.
13. K. Madduri, D. A. Bader, J. W. Berry, and J. R. Crobak, “Parallel shortest path algorithms for solving large-scale instances,” 9th DIMACS Implementation Challenge workshop (The Shortest Path Problem), Nov. 2006.
14. D. A. Bader and K. Madduri, “Efficient shared-memory algorithms and implementations for solving large-scale graph problems,” SIAM Annual Meeting, Jul. 2006.

Thesis

• K. Madduri. A High-Performance Framework for Analyzing Massive Complex Networks. PhD dissertation, Georgia Institute of Technology, Atlanta, GA, July 2008.

Poster Presentations

• K. Madduri, V. Rengasamy, P. Medvedev. SPRITE: A fast parallel SNP detection pipeline. American Society of Human Genetics (ASHG) Annual Meeting, October 2015.
• G. M. Slota, K. Madduri, S. Rajamanickam. Parallel Complex Network Partitioning. Supercomputing 2014, New Orleans, LA, November 2014.
• G. Slota and K. Madduri. FASCIA: Fast Approximate Subgraph Counting and Enumeration. SIAM Workshop on Network Science, San Diego, CA, July 2013.
• B. Wang, S. Ethier, W. Tang, K. Ibrahim, K. Madduri, S. Williams. Advances in Gyrokinetic Particle-in-Cell Simulation for Fusion Plasmas to Extreme Scale. Supercomputing 2012, Salt Lake City, UT, November 2012.
• K. Madduri. High-Performance Computing for Massive Graph Analysis. ATIP First Workshop on High-Performance Computing in India, Portland, OR, November 2009.
• K. Madduri. SNAP: A Parallel Graph Framework for Large-scale Network Analysis. SIAM Conf. on Parallel Processing for Scientific Computing, Atlanta, GA, March 2008.
• V. Agarwal and K. Madduri. Efficient Implementation of Irregular Algorithms on the Cell Multi-core Architecture. Supercomputing 2006 Workshop -- General-Purpose GPU Computing: Practice And Experience, Tampa, FL, November 2006.
• D.A. Bader and K. Madduri. Efficient Graph Algorithms and Implementations on the Cray MTA-2. Fall Creek Falls Conference: Computational Science at Scale, Pikeville, TN, October 2005.

Doctoral Colloquia

• K. Madduri. SNAP: A Parallel Graph Framework for Large-scale Network Analysis. 22nd IEEE Int'l. Parallel and Distributed Processing Symposium (IPDPS), Miami, FL, April 2008.
• K. Madduri. Efficiently Solving Large-scale graph problems on High-Performance Computing Systems. IEEE/ACM Conf. on Supercomputing (SC), Reno, NV, November 2007.

Selected Invited Talks

1. Dagstuhl seminar on High-performance Graph Algorithms and Applications in Computational Science, November 13, 2014.
2. CScADS Workshop on Libraries and Autotuning for Extreme-scale Applications, August 13, 2012.
3. Workshop on Algorithms for Modern Massive Data Sets (MMDS 2012), July 13, 2012.
4. The Pennsylvania State University, November 8, 2010.
5. SIAM Conf. on Parallel Processing for Scientific Computing (SIAM PP10), February 25, 2010.
6. ParLab Winter Retreat 2010, UC Berkeley, January 14, 2010.
7. National Security Agency, October 4, 2009.
8. Bay Area Scientific Computing Day 2009, Lawrence Berkeley National Laboratory, May 9, 2009.
9. Department of Computer Science and Electrical Engineering, West Virginia University, April 24, 2009.
10. Computer Science Research Institute, Sandia National Laboratories, April 9, 2008.
11. Computer Science Department, University of California Davis, April 1, 2008.
12. Computer Science and Mathematics Division, Oak Ridge National Laboratories, March 17, 2008.
13. Computational Research Division, Lawrence Berkeley National Laboratory, March 10, 2008.
14. National Security Agency, May 25, 2006.

Software

Please see software page.

Teaching and Advising

Classes

• CMPSC 465, Data Structures and Algorithms, Fall 2016 and Fall 2014.
• CMPSC/MATH 451, Numerical Computations, Spring 2016, Fall 2013, Fall 2011.
• CMPSC 450, Concurrent Scientific Programming, Spring 2016, Spring 2015, Spring 2014, and Spring 2013.
• CSE 597C, Graph Mining, Spring 2015.
• CSE 557, Concurrent Matrix Computations, Spring 2014 and Spring 2013.
• CMPSC/MATH 455, Numerical Analysis I, Spring 2013 and Fall 2012.

Current Advisees

• Thap Panitanarak. CSE PhD candidate, Fall 2009 -- Present. Co-advised with Prof. Suzanne Shontz, Univ of Kansas.
• Vasudevan Rengasamy. CSE PhD candidate, Fall 2014 -- Present. Co-advised with Prof. Mahmut Kandemir.
• Hongyuan Zhan. CSE PhD candidate, Fall 2014 -- Present.

Alumni

• David Hadka. PhD in Computer Science and Engineering, May 2013. Thesis: The Foundations, Parallelization, and Application of the BORG MOEA. Co-advised with Prof. Patrick Reed, department of Civil and Environmental Engineering.
• Sai Chirravuri. MS in Computer Science and Engineering, July 2014. Thesis: RDF3X-MPI: A Partitioned RDF engine for Data-Parallel SPARQL Querying. First employment: Cloudera.
• Ramachandran K. Narayanan. MS in Computer Science and Engineering, May 2016. Thesis: Parallel Particle-in-cell Performance Optimization: A Case Study of Electrospray Simulation. First employment: RNET Technologies Inc.
• Sindhuja Parimalarangan. MS in Computer Science and Engineering, May 2016. Thesis: Fast Parallel Triad Census and Triangle Listing on Shared-Memory Platforms. First employment: MathWorks.
• George Slota. PhD in Computer Science and Engineering, May 2016. Thesis: Irregular Graph Algorithms on Modern Multicore, Manycore, and Distributed Processing Systems.

Other

• Emmanuel Oppong, Summer 2014 SROP intern.
• Ucheoma Ukah, Summer 2014 SROP intern.
• Aaron Altman, CSE PhD program, 2012-13.
• Fei Wu, CSE PhD program, 2012-13.
• Co-advised Nick Stoler, IBIOS PhD program, in Fall 2012.

Service

Conference Organization

1. Co-chair, Second International Workshop on High Performance Big Graph Data Management, Analysis, and Mining, 2015.
2. Minisymposium co-organizer, SIAM Conf. on Computational Science and Engineering, 2015.
3. Co-chair, Student Research Symposium at the 21st Annual Int'l. Conf. on High Performance Computing (HiPC), 2014.
4. Co-chair, First International Workshop on High Performance Big Graph Data Management, Analysis, and Mining, 2014.
5. Algorithms track co-chair, The 7th Int'l. Conf. on Contemporary Computing, 2014.
6. Organizing Committee, SIAM Conf. on Parallel Processing for Scientific Computing, 2012.
7. Cyber co-chair, The 15th Int'l. Conf. on High Performance Computing (HiPC), 2008.

Technical Conference Program Committees

1. IEEE Int'l. Conf. on High Performance Computing, Data, and Analytics (HiPC), Applications track, 2016.
2. Doctoral Research Showcase, Supercomputing, 2016.
3. IEEE Int'l. Parallel and Distributed Processing Symp. (IPDPS), Algorithms track, 2016.
4. Graph Algorithms Building Blocks (GABB) Workshop, 2016.
5. Int'l. Conf. for High Performance Computing, Networking, Storage and Analysis (SC), Algorithms track, 2015.
6. Workshop on Domain-Specific Languages and High-Level Frameworks for High Performance Computing (WOLFHPC), 2015.
7. Workshop on Irregular Applications: Architectures & Algorithms (IA3), 2015.
8. Workshop on High Performance Computing for Big Data (HPC4BD), 2015.
9. Int'l. Conf. on Contemporary Computing (IC3), 2015.
10. IEEE Int'l. Parallel and Distributed Processing Symp. (IPDPS), Applications track, 2015.
11. Graph Algorithms Building Blocks (GABB) Workshop, 2015.
12. Programming Models, Languages and Compilers for Manycore and Heterogeneous Architectures (PLC) Workshop, 2015.
13. IEEE Int'l. Symp. on Signal Processing and Information Technology (ISSPIT), 2014.
14. Int'l. Conf. for High Performance Computing, Networking, Storage and Analysis (SC), Algorithms track, 2014.
15. Workshop on Domain-Specific Languages and High-Level Frameworks for High Performance Computing (WOLFHPC), 2014.
16. Workshop on Irregular Applications: Architectures & Algorithms (IA3), 2014.
17. Doctoral Research Showcase, Supercomputing, 2014.
18. ACM Int'l. Workshop on Big Data in Life Sciences (BigLS), 2014.
19. Workshop on High Performance Computing for Big Data (HPC4BD), 2014.
20. Int'l. Conf. on Algorithms and Architectures for Parallel Processing (ICA3PP), 2014.
21. IEEE Int'l. Symp. on Parallel and Distributed Processing with Applications (ISPA), 2014.
22. ACM Int'l. Conf. on Supercomputing (ICS), External Committee, 2014.
23. IEEE/ACM Int'l. Symp. on Cluster, Cloud and Grid Computing (CCGrid), Architecture and Accelerators track, 2014.
24. Workshop on Multithreaded Architectures and Applications (MTAAP), 2014.
25. IEEE Int'l. Parallel and Distributed Processing Symp. (IPDPS), Algorithms track, 2014.
26. Workshop on Mining Networks and Graphs: A Big Data Analytics Challenge, 2014.
27. ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP), External Committee, 2014.
28. IEEE Int'l. Conf. on High Performance Computing (HiPC), 2013.
29. Student Research Symp., IEEE Int'l. Conf. on High Performance Computing (HiPC), 2013.
30. Biotechnology and Bioinformatics Symp. (BIOT), 2013.
31. Workshop on Domain-Specific Languages and High-Level Frameworks for High Performance Computing (WOLFHPC), 2013.
32. Workshop on Irregular Applications: Architectures & Algorithms (IA3), 2013.
33. IEEE Int'l. Conf. on High Performance Computing and Communications (HPCC), 2013.
34. Int'l. Conf. on Parallel Processing (ICPP), Applications track, 2013.
35. IEEE Int'l. Parallel and Distributed Processing Symp. (IPDPS), Algorithms track, 2013.
36. Workshop on Parallel Algorithms and Software for Analysis of Massive Graphs (ParGraph), 2013.
37. ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP), External Committee, 2013.
38. Student Research Symp., IEEE Int'l. Conf. on High Performance Computing (HiPC), 2012.
39. Workshop on Parallel Algorithms and Software for Analysis of Massive Graphs (ParGraph), 2012.
40. Workshop on Domain-Specific Languages and High-Level Frameworks for High Performance Computing (WOLFHPC), 2012.
41. Int'l. Conf. for High Performance Computing, Networking, Storage and Analysis (SC), Applications track, 2012.
42. Biotechnology and Bioinformatics Symp. (BIOT), 2012.
43. Int'l. Conf. on Algorithms and Architectures for Parallel Processing (ICA3PP), 2012.
44. IEEE Int'l. Symp. on Parallel and Distributed Processing with Applications (ISPA), Algorithms and Applications track, 2012.
45. Symp. on Application Accelerators in High Performance Computing (SAAHPC), 2012.
46. IEEE Int'l. Conf. on High Performance Computing and Communications (HPCC), 2012.
47. IEEE Int'l. Workshop on High Performance Computational Biology (HiCOMB), 2012.
48. PhD Forum, IEEE Int'l. Parallel and Distributed Processing Symp. (IPDPS), 2012.
49. ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP), External Committee, 2012.
50. Workshop on Parallel Algorithms and Software for Analysis of Massive Graphs (ParGraph), 2011.
51. Student Research Symp., IEEE Int'l. Conf. on High Performance Computing (HiPC), 2011.
52. Network-aware Data Management Workshop (NDM), 2011.
53. Workshop on Parallel Computational Biology (PBC), 2011.
54. IEEE Int'l. Conf. on High Performance Computing and Communications (HPCC), 2011.
55. Symp. on Application Accelerators in High Performance Computing (SAAHPC), 2011.
56. IEEE Int'l. Workshop on High Performance Computational Biology (HiCOMB), 2011.
57. Workshop on Hybrid Multi-core Computing (WHMC), 2010.
58. Student Research Symp., IEEE Int'l. Conf. on High Performance Computing (HiPC), 2010.
59. Symp. on Application Accelerators in High Performance Computing (SAAHPC), 2010.
60. Int'l. Conf. on Parallel Processing (ICPP), Algorithms and Applications track, 2010.
61. IEEE/ACM Int'l. Symp. on Cluster, Cloud and Grid Computing (CCGrid), 2010.
62. IEEE Int'l. Parallel and Distributed Processing Symp. (IPDPS), 2010.
63. PhD Forum, IEEE Int'l. Parallel and Distributed Processing Symp. (IPDPS), 2010.
64. Int'l. Symp. on Computer Architecture and High Performance Computing (SBAC-PAD), 2009.
65. PhD Forum, IEEE Int'l. Parallel and Distributed Processing Symp. (IPDPS), 2009.
66. IEEE Int'l. Conf. on High Performance Computing (HiPC), 2008.

Journal Reviewing

ACM Journal of Computational Science, ACM Journal of Experimental Algorithmics, ACM Transactions on Parallel Computing, Elsevier Artificial Intelligence in Medicine, Elsevier Discrete Applied Mathematics, Elsevier Information Sciences, Elsevier Knowledge-based Systems, Elsevier Journal of Parallel and Distributed Computing, Elsevier Parallel Computing, Elsevier Theoretical Computer Science, IEEE Design and Test of Computers, IEEE Transactions on Knowledge and Data Engineering, IEEE Transactions on Parallel and Distributed Systems, IEEE/ACM Transactions on Computational Biology and Bioinformatics, IEEE Transactions on Network Science and Engineering, Oxford Journals Bioinformatics, PLOS ONE, Sage International Journal of High Performance Computing Applications, SIAM Journal on Scientific Computing, Wiley Concurrency and Computation: Practice and Experience, Wiley Interscience Networks. 2006-15.

Research Proposal Review

• National Science Foundation, 2015, 2014, 2013, 2012.
• Department of Energy, 2013, 2011.

Other

• GLCPC Blue Waters Proposals Review Committee, 2013, 2014.
• Judge, OpenMP Programming Contest, Supercomputing 2005.
• Student volunteer, Supercomputing (SC) conference, 2005, 2006, 2007.

University and Department Service

• CSE colloquium chair, 2013-16.
• CSE curriculum/ABET committee, 2014-Present.
• CSE graduate committee, 2011-Present.
• Numerical Analysis area candidacy exam chair, CSE department, 2012-13 and 2014-15.
• Computer Engineering Faculty Adviser, College of Engineering Advising Center, 2012-13.

Graduate Student Committees

• Yusan Lin, PhD comprehensive exam, CSE, 2015.
• Yi-Shan Sung, PhD comprehensive exam, IE, 2013.
• Lorne Leonard, PhD thesis committee, CE, 2015.
• Burak Korkut, PhD thesis committee, AERSP, 2015.
• Hau-wen Chang, PhD thesis committee, CSE, 2015.
• Nitish Upreti, MS thesis committee, CSE, 2015.
• Ken Hutchison, PhD thesis committee, IE, 2015.
• Jeonghyung Park, PhD thesis committee, CSE, 2015.
• Joshua Booth, PhD thesis committee, CSE, 2014.
• Shad Kirmani, PhD thesis committee, CSE, 2014.
• Sitapa Rujikietgumjorn, PhD thesis committee, CSE, 2014.
• Tyler Jones, MEng committee, CSE, 2014.
• Oscar Bedoya Reina, PhD thesis committee, Integrative Biosciences, 2014.
• Kuan-Bei Chen, PhD thesis committee, CSE, 2013.
• Aamod Gokhale, MEng committee, CSE, 2013.
• Dustin Fairchild, PhD thesis committee, EE, 2013.
• Darshan Palasamudram, MS thesis committee, CSE, 2013.
• Mehmet Resit Teksin, MEng committee, CSE, 2012.
• Bradley Suchoski, MS thesis committee, CSE, 2012.
• Ngai Lam Ho, MS thesis committee, CSE, 2012.