Publications

Overview Papers and News Articles

Research Papers

Journal Papers:

Conference Papers:

  • E. G. Boman and S. Rajamanickam, A study of combinatorial issues in a sparse hybrid solver, in Proceedings of SciDAC 2011, 2011.
  • M.M.A. Patwary, A.H. Gebremedhin and A. Pothen, New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures. In E. Jeannot, R. Namyst and J. Roman, editors, Euro-Par 2011, volume 6853 of Lecture Notes in Computer Science, pages 250--262. Springer, 2011.
  • S.H.K Narayanan, B. Norris, P. Hovland, D.C. Nguyen and A.H. Gebremedhin, Sparse Jacobian Computation using ADIC2 and ColPack, Procedia Computer Science, 4:2115--2123, 2011. Proceedings of the International Conference on Computational Science, ICCS 2011.
  • U. Catalyurek, F. Dobrian, A.H. Gebremedhin, M. Halappanavar, and A. Pothen, Distributed-memory Parallel Algorithms for Matching and Coloring, Proc. of IPDPS 2011, Workshop on Parallel Computing and Optimization (PCO'11).
  • G. Teodoro, T. Hartley, U. Catalyurek, and R. Ferreira, Run-time optimizations for replicated dataflows on heterogeneous environments , The ACM International Symposium on High Performance Distributed Computing (HPDC), 2010, to appear.
  • Michael M. Wolf, Michael A. Heroux, and Erik G. Boman, Factors Impacting Performance of Multithreaded Sparse Triangular Solve , accepted at VECPAR'10.
  • E. Saule, D. Bozdag, and U. Catalyurek, A Moldable Online Scheduling Algorithm and Its Application to Parallel Short Sequence Mapping , Proceedings of the 15th International Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP 2010), in conjunction with IPDPS 2010, to appear.
  • D. Bozdag, A. Hatem and U. Catalyurek, Exploring Parallelism in Short Sequence Mapping Using Burrows-Wheeler Transform , Proceedings of 24th International Parallel and Distributed Processing Symposium (IPDPS), 9th IEEE International Workshop on High Performance Computational Biology, 2010, to appear.
  • B. Ucar and U. Catalyurek, On scalability of hypergraph models for sparse matrix partitioning, Proceedings of the PDP 2010: 18th Euromicro International Conference on Parallel, Distributed and Network-Based Computing, Jan 2010.
  • S. H. K. Narayanan, B. Norris and B. Winnicka, ADIC2 : development of a component source transformation system for differentiating C and C++ , in Proceedings of International Conference on Computational Science (ICCS 2010), pages 1845-1853, Elsevier , 2010.
  • M. Strout, N. Osheim, D. Rostron, P. Hovland and A. Pothen, Evaluation of Hierarchical Mesh Reorderings, Proceedings of the International Conference on Computational Science (ICCS), May 2009.
  • E.G. Boman, U.V. Catalyurek, C. Chevalier, K.D. Devine, I. Safro, and M.M. Wolf, Advances in Parallel Partitioning, Load Balancing, and Matrix Ordering, SciDAC09 Conference, San Diego, June 2009.
  • O. Roderick, and I. Safro, Polynomial interpolation for predicting decisions and recovering missing data, Preprint ANL/MCS-P1586-0209, 2009, Submitted for Publication.
  • A. Lyons, Restricted Coloring Problems and Forbidden Induced Subgraphs, Preprint ANL/MCS-P1611-0409, 2009, Submitted for Publication.
  • D. Bozdag , C. Barbacioru and U. Catalyurek , Parallel Short Sequence Mapping for High Throughput Genome Sequencing, 23rd International Parallel and Distributed Processing Symposium (IPDPS'09).
  • I. Safro, P. Hovland, J. Shin, and M. Strout, Improving random walk performance, accepted in International Conference on Scientific Computing , 2009.
  • K. Devine, E. Boman, L.A. Riesen, U. Catalyurek, C. Chevalier, Getting Started With Zoltan: a Short Tutorial, to appear in proceedings of Dagstuhl Seminar On Combinatorial Scientific Computing, Feb 2009.
  • C. Chevalier, and I. Safro, Comparison of Coarsening Schemes for Multilevel Graph Partitioning, to appear at the 3rd Workshop on Learning and Intelligent Optimization (LION-3), Trento, Italy, January 2009.
  • A. Lyons, Acyclic and Star Colorings of Joins of Graphs and an Algorithm for Cographs, in Proceedings of the Eighth Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW09), pages 199-204, 2009.
  • M.M. Wolf, E.G. Boman, and B. Hendrickson, Optimizing Parallel Sparse Matrix-Vector Multiplication by Corner Partitioning, PARA08, Trondheim, Norway, May 2008, to appear in LNCS.
  • A.H. Gebremedhin, A. Pothen, and A. Walther, Exploiting Sparsity in Jacobian Computation via Coloring and Automatic Differentiation: a Case Study in a Simulated Moving Bed process, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 339-349, 2008, Springer.
  • H.S. Abdel-Khalik, P. Hovland, A. Lyons, T. Stover and J. Utke, A Low Rank Approach to Automatic Differentiation, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 55-65, 2008, Springer.
  • S. Bhowmick and P. Hovland, A Polynomial-Time Algorithm for Detecting Directed Axial Symmetry in Hessian Computational Graphs, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 91-102, 2008, Springer.
  • A. Lyons and J. Utke, On the Practical Exploitation of Scarsity, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 103-114, 2008, Springer.
  • J. Shin, P. Malusare, and P. Hovland, Design and Implementation of a Context-Sensitive, Flow-Sensitive Activity Analysis Algorithm for Automatic Differentiation, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 115-126, 2008, Springer.
  • I. Charpentier, C.D. Cappello, and J. Utke Efficient Higher-Order Derivatives of the Hypergeometric Function, In C. Bischof et al. (Eds.): Proceeding of AD2008, The 5th Int'l Conference on AD, Lecture Notes in Computational Science and Engineering 64, pp. 127-137, 2008, Springer.
  • U.V. Catalyurek, E.G. Boman, K.D. Devine, D. Bozdag, R. Heaphy, L.A. Riesen, Hypergraph-based Dynamic Load Balancing for Adaptive Scientific Computations, Proceedings of 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS07), 2007. Won best paper award in the Algorithms track.

Book Chapters:

  • E.G. Boman, U.V. Catalyurek, C. Chevalier, K.D. Devine, Parallel partitioning, coloring, and ordering for Scientific Computing with Zoltan, Combinatorial Scientific Computing, editors Uwe Naumann and Olaf Schenk, submitted.
  • U.V. Catalyurek, D. Bozdag, E.G. Boman, K.D. Devine, R. Heaphy and L.A. Riesen, Hypergraph-based Dynamic Partitioning and Load Balancing, Advanced Computational Infrastructures for Parallel/Distributed Adaptive Applications, Wiley Press, M. Parashar, X. Li, S. Chandra, 2009, to appear.

PhD Theses

  • M. Wolf, Hypergraph-based combinatorial optimization of matrix-vector multiplication, PhD Thesis, University of Illinois at Urbana-Champaign, April 2009. Advisor: M. Heath.
  • M. Halappanavar, Algorithms for vertex-weighted matching in graphs, PhD Thesis, Old Dominion University, May 2009. Advisor: A. Pothen.
  • D. Bozdag, Graph Coloring and Clustering Algorithms for Science and Engineering Applications, PhD Thesis, The Ohio State University, Dec 2008. Advisors: U. Catalyurek and F. Ozguner.