David A. Bader

Professor
College of Computing
Georgia Tech
Atlanta, GA
30332

 
 

 

02 October 2008

Curriculum Vitae for David A. Bader

College of Computing
Center for the Study of Systems Biology
Center for Bioinformatics and Computatonal Genomics
Georgia Institute of Technology
Atlanta, GA 30332

Office phone: (404)385-0004
FAX number: (404)506-9492

EDUCATIONAL BACKGROUND

EMPLOYMENT HISTORY

CURRENT FIELDS OF INTEREST

David A. Bader is Executive Director of High-Performance Computing and a Full Professor in Computational Science and Engineering, a division within the College of Computing, at Georgia Institute of Technology. Dr. Bader also serves as Director of the Sony-Toshiba-IBM Center of Competence for the Cell Broadband Engine Processor located at Georgia Tech. He received his Ph.D. in 1996 from The University of Maryland, was awarded a National Science Foundation (NSF) Postdoctoral Research Associateship in Experimental Computer Science. He is an NSF CAREER Award recipient, an investigator on several NSF awards, was a distinguished speaker in the IEEE Computer Society Distinguished Visitors Program, and a member of the IBM PERCS team for the DARPA High Productivity Computing Systems program. Dr. Bader serves on the Research Advisory Council of Internet2 and the Steering Committees of the IPDPS and HiPC conferences, and was the General co-Chair for IPDPS (2004--2005), and Vice General Chair for HiPC (2002--2004). David has chaired several major conference program committees: Program Chair for HiPC 2005, Program Vice-Chair for IPDPS 2006 and Program Vice-Chair for ICPP 2006, and has served on numerous conference program committees related to parallel processing and computational science & engineering, is an associate editor for several high impact publications including the IEEE Transactions on Parallel and Distributed Systems (TPDS), the ACM Journal of Experimental Algorithmics (JEA), IEEE DSOnline, and Parallel Computing, is a Senior Member of the IEEE Computer Society and a Member of the ACM. Dr. Bader has been a pioneer in the field of high-performance computing for problems in bioinformatics and computational genomics. He has co-chaired a series of meetings, the IEEE International Workshop on High-Performance Computational Biology (HiCOMB), written several book chapters, and co-edited special issues of the Journal of Parallel and Distributed Computing (JPDC) and IEEE TPDS on high-performance computational biology. He has co-authored over 90 articles in peer-reviewed journals and conferences, and his main areas of research are in parallel algorithms, combinatorial optimization, and computational biology and genomics.

TEACHING

Continuing Education

  • 1998 NSF Engineering Education Scholars Program, University of Wisconsin-Madison.
  • 1998 Teaching-Wise Educational Workshop, University of New Mexico.
  • 2000 American with Disabilities Act Training, "Access to Education," University of New Mexico.
  • Scholarly Communication and the Common Good: A Symposium for the University of New Mexico's Academic Community, February 27, 2003.
  • Faculty Scholarly Communication Symposium: Stewardship of the University Community's Knowledge-Base, March 12, 2004.
  • 3rd Annual Scholarly Communication Symposium: Cultural Transformation of the University's Knowledge Base, March 3, 2005.

Individual Student Guidance

Postdoctoral Fellows Supervised

  • Tanya (Yonit) Berger-Wolf (PhD, University of Illinois, Urbana-Champaign), NSF Postdoctoral Research Associateship in Experimental Computer Science. Computational methods for controlled breeding programs and evolutionary trees reconstruction. 2002-2004. (joined Univ. of Illinois - Chicago).
  • Yuzhong Sun (PhD, Chinese Academy of Sciences). Hybrid parallel algorithms for routing collective communications on SMP clusters. 1999-2000.
  • Tiffani L. Williams (PhD, Central Florida). Alfred P. Sloan Postdoctoral Fellowship in Computational Molecular Biology. 2001-2004. (joined Texas A&M Univ.).

Postdoctoral Students Supervised

  • James A. McCoy, Sandia National Laboratories Computational Science Retraining Program, "Porting a parallel VHDL simulation environment to Sandia National Labs parallel computing platforms," 1998.
  • Michael Keenan, "Multivariate Image Analysis Tools for Chemical Characterization," Sandia National Laboratories Computational Science Retraining Program, 1999.
  • Doug Wall, Sandia National Laboratories Computational Science Retraining Program, "Improving the Performance of a Crevice Corrosion Code Using Space Iterative Methods and Parallelization," 2000.
  • David Beck, Sandia National Laboratories Computational Science Retraining Program, "Evaluation and Characterization of Secure File Storage in Client Parallel I/O," 2000.

Ph.D. Students Supervised

  • Mi Yan. Thesis Title: ``High Performance Algorithms for Phylogeny Reconstruction with Maximum Parsimony,'' January 2004. (Future Technologies Solution Design Center, IBM Corp.)
  • Guojing Cong, with distinction. Thesis Title: ``On the Design and Implementation of Parallel Algorithms for Graph Problems on Shared-Memory Machines,'' October 2004. (IBM T.J. Watson Research Center)
  • Jinyang Liu. Thesis Title: ``Control and Noise Immunity of High Resolution Experiments on Earth Orbit,'' October 2005. (Janelia Farms Research Center, Howard Hughes Medical Institute)
  • Matthew J. Sottile. Thesis Title: ``A Measurement and Simulation Methodology for Parallel Computing Performance Studies,'' April 2006. (University of Oregon)
  • Xuefei Wang. Thesis Title: ``Hybrid Neuro-Fuzzy Inference Models for Outcome Prediction in Acute Leukemia Using Gene Expression and Covariate Data,'' October 2007. (co-advised with S. Atlas)
  • Kamesh Madduri. Thesis Title: ``A High-Performance Framework for Analyzing Massive Complex Networks,'' July 2008. Recipient of the College of Computing's 2008 Outstanding Graduate Research Assistant Award. (Luis W. Alvarez Postdoctoral Fellowship in Computational Science, Lawrence Berkeley National Laboratory)
  • Virat Agarwal, (B.Tech, IIT-Delhi, entered Fall 2006)
  • Seunghwa Kang (from Seoul National University, Korea, entered Fall 2006)
  • Manisha Gajbe (from Univ. Pune and IBM India, entered Fall 2007)
  • Aparna Chandramowlishwaran, (B.Tech, Anna University, entered Fall 2007)
  • David Ediger, (B.S., George Washington University, entered Fall 2008)

M.S. Thesis Students Supervised

  • Mr. Ajith Kumar Illendula, June 2000, Thesis: "Efficient and Practical Parallel Algorithms for Ear Decomposition with Experimental Studies." (joined Intel Corp., Rio Rancho, NM).
  • Mr. Niranjan Prabhu, December 2000, Thesis: "Practical Parallel Algorithms for Cycle Detection in Planar Partitioned Digraphs." (joined Intel Corp., Chandler, AZ)
  • Ms. Vinila Yarlagadda, December 2000, Thesis: "Design of Practical Parallel Algorithms for Uniform-Memory Access Symmetric Multiprocessors." (joined Intel Corp., Chandler, AZ).
  • Ms. Bei Wang, Summer 2002, Thesis: "Modeling and Simulation of Optimization Problems in Landscape Ecology." (joined Ph.D. program at University of Southern California).
  • Ms. Min Zhu, September 2002, Thesis: "Parallel Branch and Bound Algorithms with Experimental Studies on Shared Memory Multiprocessors." (joined Ph.D. program in Mathematics)
  • Mr. Bhaskar Subramanian, with distinction, December 2002, Thesis: "Automated Synthesis of Pass Transistor Asynchronous Sequential Circuits," (joined Sun Microsystems)
  • Ms. Zhan Li, December 2002, Thesis: ``Parallel Algorithms for Uniform-Memory-Access Shared Memory Multiprocessors,'' (co-advised with B. Moret). (joined Bioinformatics Lab, Penn State University).
  • Ms. Sukanya Sreshta, with distinction, December 2003, Thesis: "Designing Parallel Graph Algorithms for Symmetric Multiprocessors." (joined OpNet Technologies, Bethesda, MD)
  • Ms. Meenakshi Balasubramanian, July 2005, Thesis: ``Design and Implementation of Scalable Synthetic Compact Application (SSCA) Graph Theoretic Benchmark using Unified Parallel C (UPC).'' (joined Merrill Lynch, New York).
  • Mr. Eswaramoorthi Nallusamy, October 2005, Thesis: ``A Framework for Using Processor Cache as RAM in LinuxBIOS on x86 Cluster,'' (joined Intel Corp., DuPont, WA)
  • Mr. Vipin Sachdeva, with distinction, December 2005, Thesis: ``High Performance Computing for Computational Biology and Graph Theory.'' (joined IBM Research, Austin Research Laboratory)
  • Ms. Sirisha Muppavarapu, January 2006, Thesis: ``Analysis of A Sequence Alignment Problem Using Unified Parallel C (UPC),'' (joined Intel Corp., Rio Rancho, NM)
  • Midhun Kumar Allu, Summer 2006, Thesis. (co-advised with E. Ritchie). (joined AT&T, New Jersey)
  • Rick Quax, July 2008, Thesis: ``Modeling and Simulating the Propagation of Infectious Diseases using Complex Networks.''
  • Amrita Mathuriya, (B.Tech, IIT-Roorkee, entered Fall 2007)
  • Karl Jiang, (B.S., Univ of Miami, entered Fall 2008)
  • Swathi Bhat, (B.Tech, UVCE Bangalore, entered Fall 2008)

M.S. Non-Thesis Students Supervised

  • Ms. Kavita Balakavi, Spring 1999. (joined Intel Corp., Beaverton, OR).
  • Ms. Sireesha Sankuratripati, with distinction, Summer 2001. (joined Intel Corp., Chandler, AZ)
  • Mr. Charan Donepudi, Summer 2001. (joined Intel Corp., Chandler, AZ).
  • Mr. Raghuram Mandiga, Summer 2001.
  • Mr. Ram Saran Attaluri, Spring 2002.
  • Mr. JingYi Dong, January 2003. (joined PhD program, Georgia Tech).
  • Mr. Tu-Thach Ong, Fall 2003. (Sandia National Laboratories)
  • Ms. Prishanthy Wilson, Fall 2003. (joined Isochron Data Corporation, Austin, TX).
  • Mr. Susheel Kumar Puthana, Spring 2004. (joined Xilinx Corp., Colorado)
  • Vikas Chaudhary, Spring 2004. (entered PhD Program, Arizona State University).
  • Shruti Krishnamurthy, Spring 2004.
  • Glenn Harper, Fall 2004.
  • Arun Illendula, Fall 2004.
  • Mallikarjun Komma, Fall 2004.
  • Mr. Mehmet Fatih Su, Fall 2005.
  • Sangeetha Illendula, Fall 2006. (joined Lumidigm Inc.)
  • Sulabh Patel, Summer 2007.

Undergraduate Researchers

  • Virat Agarwal (IIT-Delhi, 2004)
  • Nitesh Agrawal (IIT-Roorkee, 2008)
  • Diana Aranda (NSF REU, 2002-2003)
  • Troy Brant (Georgia Tech, 2006-2007)
  • Warren Chancellor (Morehouse College, 2008)
  • Gaurav Goel (IIT-Delhi, 2004)
  • Sonny Hernandez (NSF REU, University of Southern California, 2007)
  • Letisha Kaskaske (NSF REU, 2002-2003)
  • Michael Lee (Univ Maryland, Baltimore County, 2008)
  • Angeline Madrid-Ritchey (NSF REU, 2002-2003)
  • Kamesh Madduri (NSF REU, IIT-Madras, 2003-2004)
  • Nicholas Merryman (Georgia Tech, 2006)
  • Danny Miller (Georgia Tech, 2006-2007)
  • Emeline Picart (INSA, France, 2003)
  • Abhishek Narain Singh (IIT-Delhi, 2004)
  • Manoj Soni (IIT-Roorkee, 2008)
  • Yamini Sridharan (IIT-Kharagpur, 2005)
  • Laura Waymire (NSF REU, 2001-2003)

Teaching Honors and Awards

  • Thank a Teach Certificate ``in recognition for excellence in teaching,'' Center for the Enhancement of Teaching and Learning, Georgia Tech, 2008.

RESEARCH AND CREATIVE SCHOLARSHIP

Thesis

Published Journal Papers (refereed)

  1. D. A. Bader, J. JáJá , R. Chellappa. `` Scalable Data Parallel Algorithms for Texture Synthesis using Gibbs Random Fields,'' IEEE Transactions on Image Processing, 4(10):1456-1460, October 1995.

  2. D. A. Bader and J. JáJá . `` Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study,'' Journal of Parallel and Distributed Computing, 35(2)173-190, June 1996.

  3. D. A. Bader, D. R. Helman, and J. JáJá . `` Practical Parallel Algorithms for Personalized Communication and Integer Sorting,'' ACM Journal of Experimental Algorithmics, 1(3):1-42, 1996.

  4. D. A. Bader, J. JáJá , D. Harwood, and L.S. Davis. `` Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study,'' The Journal of Supercomputing, 10(2):141-168, 1996.

  5. D. R. Helman, D. A. Bader, and J. JáJá . `` A Randomized Parallel Sorting Algorithm With an Experimental Study,'' Journal of Parallel and Distributed Computing, 52(1):1-23, 1998.

  6. D.R. Helman, J. JáJá , D.A. Bader. `` A New Deterministic Parallel Sorting Algorithm With an Experimental Evaluation,'' ACM Journal of Experimental Algorithmics, 3(4):1-24, 1998.

  7. S.N.V. Kalluri, J. JáJá , D.A. Bader, Z. Zhang, J.R.G. Townshend, and H. Fallah-Adl. ``High Performance Computing Algorithms for Land Cover Dynamics Using Remote Sensing Data,'' International Journal of Remote Sensing, 21(6):1513-1536, 2000.

  8. D. A. Bader and J. JáJá `` SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs),'' Journal of Parallel and Distributed Computing, 58(1):92-108, 1999.

  9. Z. Zhang, J. JáJá, D.A. Bader, S. Kalluri, H. Song, N. El Saleous, E. Vermote, and J. Townshend `` Kronos: A Software System for the Processing and Retrieval of Large-Scale AVHRR Data Sets,'' Photogrammetric Engineering & Remote Sensing, 66(9):1073-1082, 2000.

  10. David A. Bader and Robert Pennington, `` Cluster Computing: Applications,'' The International Journal of High Performance Computing, 15(2):181-185, 2001.

  11. D.A. Bader, B. M.E. Moret, and M. Yan, `` A Linear-Time Algorithm for Computing Inversion Distance Between Two Signed Permutations with an Experimental Study,'' Journal of Computational Biology, 8(5):483-491, 2001.

  12. Y. Sun, X. Lin, Y. Pan, R.W.H. Lau, D.A. Bader, and P.Y.S. Cheung, `` Generalized Block Shift Network for Clusters,'' IEEE Trans. Circuits and Systems I, 49(4):543-546, 2002.

  13. B. M.E. Moret, D.A. Bader, and T. Warnow, `` High-Performance Algorithm Engineering for Computational Phylogeny,'' The Journal of Supercomputing, 22:99-111, 2002.

  14. M. Snir and D.A. Bader, `` A Framework for Measuring Supercomputer Productivity,'' The International Journal of High Performance Computing Applications, 18(4): 417-432, 2004.

  15. D.A. Bader, `` An Improved, Randomized Algorithm for Parallel Selection With an Experimental Study,'' Journal of Parallel and Distributed Computing, 64(9):1051-1059, 2004.

  16. D.A. Bader, `` Computational Biology and High-Performance Computing,'' Special Issue on Bioinformatics, C. Stewart (ed.), Communications of the ACM, 47(11):34-41, 2004.

  17. D.A. Bader and G. Cong, ``A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs),'' Journal of Parallel and Distributed Computing, 65(9):994-1006, 2005.

  18. G. Cong and D.A. Bader, ``Designing Irregular Parallel Algorithms With Mutual Exclusion and Lock-free Protocols,'' Journal of Parallel and Distributed Computing, 66(6):854-866, 2006.

  19. D.A. Bader and G. Cong, ``Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs,'' Journal of Parallel and Distributed Computing, 66(11):1366--1378, 2006.

  20. D.A. Bader and S. Sreshta, ``A New Parallel Algorithm for Planarity Testing,'' Parallel Processing Letters, 2006. (to appear)

  21. S. Dhakal, M.M. Hayat, J.E. Pezoa, C. Yang, and D.A. Bader, ``Dynamic Load Balancing in Distributed Systems in the Presence of Delays: A Regeneration-Theory Approach,'' IEEE Transactions on Parallel & Distributed Systems, 18(4):485-497, 2007.

  22. D.H.P. Low, B. Veeravalli, and D.A. Bader, ``On the Design of High-Performance Algorithms for Aligning Multiple Protein Sequences on Mesh-Based Multiprocessor Architectures,'' Journal of Parallel and Distributed Computing, 67(9):1007-1017, 2007.

  23. D.A. Bader, V. Agarwal, K. Madduri, and S. Kang, ``High Performance Combinatorial Algorithm Design on the Cell Broadband Engine Processor,'' Parallel Computing, 33(10-11):720-740, 2007.

  24. D.A. Bader and K. Madduri, ``A Graph-Theoretic Analysis of the Human Protein-Interaction Network Using Multi-core Parallel Algorithms,'' Parallel Computing, 2008, to appear.

Papers in Special Volumes

  1. D.A. Bader, B.M.E. Moret, and P. Sanders, `` Algorithm Engineering for Parallel Computation,'' Experimental Algorithmics, Lecture Notes in Computer Science, 2547:1-23, 2002.

  2. 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, 2(4B):41-51, November 2006.

  3. D.A. Bader, ``Petascale Computing for Large-Scale Graph Problems,'' 7th International Conference on Parallel Processing and Applied Mathematics (PPAM 2007), Lecture Notes in Computer Science, 4967:166-169, 2008.

Published Books and Parts of Books

  1. David A. Bader, William E. Hart, and Cynthia A. Phillips, ``Parallel Algorithm Design for Branch and Bound,'' in H.J. Greenberg, editor, Tutorials on Emerging Methodologies and Applications in Operations Research, Kluwer Academic Press, Chapter 5, pp. 1-44, 2004.

  2. David A. Bader and Mi Yan, ``High Performance Algorithms for Phylogeny Reconstruction with Maximum Parsimony,'' in S. Aluru, editor, Handbook of Computational Molecular Biology, Chapman & Hall / CRC Computer and Information Science Series, Chapter 22, pp. 1-19, 2006.

  3. David A. Bader, Bernard M.E. Moret, Tiffani L. Williams, and Mi Yan, ``High-Performance Phylogeny Reconstruction Under Maximum Parsimony,'' in A.Y. Zomaya, editor, Parallel Computing for Bioinformatics and Computational Biology, Wiley, Chapter 16, 2006.

  4. Srinivas Aluru, Nancy Amato, David A. Bader, Suchendra Bhandarkar, Laxmikant Kale, and Dan Marinescu, ``Parallel Computational Biology,'' in M.H. Heroux, P. Raghavan, and H.D. Simon, editors, Frontiers of Scientific Computing, SIAM Series on Software, Environments, and Tools, 2006.

  5. David A. Bader, Usman Roshan, and Alexandros Stamatakis, ``Computational Grand Challenges in Assembling the Tree of Life: Problems & Solutions,'' in C.-W. Tseng, editor, Advances in Computing, 68: Computational Biology and Bioinformatics, Elsevier, Chapter 4, pages 127--176, 2006.

  6. David A. Bader, Kamesh Madduri, Guojing Cong, and John Feo, ``Design of Multithreaded Algorithms for Combinatorial Problems,'' in S. Rajasekaran and J. Reif, editors, Handbook of Parallel Computing: Models, Algorithms, and Applications, CRC Press, Chapter 31, 2007.

  7. David A. Bader and Guojing Cong, ``Efficient Parallel Graph Algorithms for Shared-memory Multiprocessors,'' in S. Rajasekaran and J. Reif, editors, Handbook of Parallel Computing: Models, Algorithms, and Applications, CRC Press, Chapter 26, 2007.

  8. Kamesh Madduri, David A. Bader, Jonathan W. Berry, Joseph R. Crobak, and Bruce A. Hendrickson, ``Multithreaded Algorithms for Processing Massive Graphs,'' in D.A. Bader, editor, Petascale Computing: Algorithms and Applications, Chapman & Hall / CRC Press, Chapter 12, 2007.

  9. David A. Bader (ed.), Petascale Computing: Algorithms and Applications, Chapman & Hall / CRC Press, 2007.

  10. David A. Bader and Kamesh Madduri, ``Large-Scale Network Analysis,'' in J. Kepner and J. Gilbert, editor, Graph Algorithms in the Language of Linear Algebra, SIAM Press, 2008, to appear.

  11. Kamesh Madduri, David A. Bader, Jonathan W. Berry, Joe R. Crobak, ``Parallel Shortest Path Algorithms for Solving Large-Scale Instances,'' in C. Demetrescu, A.V. Goldberg, and D. Johnson, editors, Shortest Path Computations: Ninth DIMACS Challenge, American Mathematical Society, 2008, to appear.

Edited Special Issues of Journals

  1. David A. Bader and Srinivas Aluru, Guest Editors, Special Issue on High-Performance Computational Biology, Journal of Parallel and Distributed Computing 63(7-8):671-673 (issue: 671-773), 2003.

  2. David A. Bader and Srinivas Aluru, Guest Editors, Concurrency and Computation: Practice and Experience Special Issue: High Performance Computational Biology, John Wiley & Sons, 16(9):817-821 (issue: 817-988), 2004.

  3. David A. Bader, Srinivas Aluru, and Nancy Amato, Guest Editors, Special Issue on High-Performance Computational Biology, IEEE Transactions on Parallel and Distributed Systems 17(8):737-739 (issue: 737-807), 2006.

Edited Proceedings

  1. David A. Bader and Srinivas Aluru, Editors, Proceedings of the First IEEE International Workshop on High Performance Computational Biology (HiCOMB 2002), Fort Lauderdale, FL, April 2002.

  2. David A. Bader and Srinivas Aluru, Editors, Proceedings of the Second IEEE International Workshop on High Performance Computational Biology (HiCOMB 2003), IEEE Computer Society Press, Nice, France, April 2003.

  3. Dan C. Marinescu, David A. Bader, and Srinivas Aluru, Editors, Proceedings of the Third IEEE International Workshop on High Performance Computational Biology (HiCOMB 2004), IEEE Computer Society Press, Santa Fe, NM, April 2004.

  4. Mohammed J. Zaki, David A. Bader, Johan Montagnat and Concettina Guerra, Topic Editors, ``High Performance Bioinformatics,'' Proceedings of the 10th International Euro-Par Conference, Pisa, Italy, August 31 - September 3, 2004. Springer-Verlag LNCS, 3149:988, 2004.

  5. David A. Bader and Ashfaq A. Khokhar, Editors, Proceedings of the 17th ISCA International Conference on Parallel and Distributed Computing Systems (PDCS 2004), San Francisco, CA, September 15-17, 2004.

  6. Nancy Amato, David A. Bader, and Srinivas Aluru, Editors, Proceedings of the Fourth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2005), IEEE Computer Society Press, Denver, CO, April 2005.

  7. David A. Bader, Manish Parashar, Varadarajan Sridhar, and Viktor K. Prasanna, Editors, Proceedings of the 12th International Conference on High Performance Computing (HiPC 2005), Goa, India, Lecture Notes in Computer Science, 3769, December 2005.

  8. Chau-Wen Tseng, David A. Bader, and Srinivas Aluru, Editors, Proceedings of the Fifth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2006), IEEE Computer Society Press, Rhodes Island, Greece, April 2006.

  9. Ananth Grama, Shankar Subramaniam, David A. Bader, and Srinivas Aluru, Editors, Proceedings of the Sixth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2007), IEEE Computer Society Press, Long Beach, CA, April 2007.

  10. Bertil Schmidt, David A. Bader, and Srinivas Aluru, Editors, Proceedings of the Seventh IEEE International Workshop on High Performance Computational Biology (HiCOMB 2008), IEEE Computer Society Press, Miami, FL, April 2008.

Conference Presentations

Invited Keynote Addresses

  1. ``Using PRAM Algorithms on a Uniform Memory Access Shared-Memory Architecture,'' The Sixth International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS'01), San Francisco, CA, April 23, 2001.

  2. ``Massively Parallel Processing for Computational Genomics: Reconstructing Evolutionary Trees from Gene-Order Data,'' Second Workshop on Massively Parallel Processing (WMPP 2002), held in conjunction with The International Parallel and Distributed Processing Symposium (IPDPS 2002), Fort Lauderdale, FL, April 19, 2002.

  3. ``High-Performance Computing for Reconstructing Evolutionary Trees from Gene-Order Data,'' Workshop on Bioinformatics and Computational Biology (BCB 2002), Bangalore, India, December 18, 2002.

  4. `` High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology,'' D.A. Bader, Proc. 4th International Workshop on Efficient and Experimental Algorithms (WEA), Lecture Notes in Computer Science, 3503:16-21, May 2005.

  5. `` An Open Benchmark Suite for Evaluating Computer Architecture on Bioinformatics and Life Science Applications,'' D.A. Bader, Proc. SPEC Benchmark Workshop 2006, Austin, TX, January 2006.

  6. ``Petascale Computing for Large-Scale Graph Problems,'' Second International Conference on High Performance Computing and Communications (HPCC-06), Munich, Germany, September 13-15, 2006.

  7. ``Solving Massive Graph Problems using Petascale Computing,'' The Ninth DIMACS Implementation Challenge: The Shortest Path Problem, DIMACS Center, Rutgers University, Piscataway, NJ, November 14, 2006.

  8. ``Solving Massive Graph Problems using Petascale Computing,'' DIMACS-Georgia Tech Workshop on Complex Networks and their Applications, Atlanta, GA, January 22-24, 2007.

  9. ``Petascale Computing for Large-Scale Graph Problems,'' Eighth IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC-07), Long Beach, CA, March 30, 2007.

  10. ``Petascale Computing for Large-Scale Graph Problems,'' Seventh International Conference on Parallel Processing and Applied Mathematics (PPAM), Gdansk, Poland, September 11, 2007.

  11. ``Petascale Computing for Large-Scale Graph Problems,'' The 2008 International Workshop on Multi-Core Computing Systems (MuCoCoS'08), Barcelona, Spain, March 7, 2008.

  12. ``Petascale Phylogenetic Reconstruction of Evolutionary Histories,'' 3rd Annual High Performance Computing Day at Lehigh Lehigh University, Bethlehem, PA, April 4, 2008.

  13. ``TBD,'' SC08 Workshop on Bridging Multicore's Programmability Gap Austin, TX, November 11, 2008.

Conference Presentations with Proceedings (refereed)

  1. D. A. Bader and J. JáJá . `` Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study,'' Fifth ACM SIGPLAN Symposium of Principles and Practice of Parallel Programming (PPoPP), Santa Barbara, CA, July 19-21, 1995. (22 papers accepted)

  2. D. A. Bader and J. JáJá. `` Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection,'' 10th International Parallel Processing Symposium (IPPS), Honolulu, HI, pp. 292-301, April 15-19, 1996. (126 papers accepted out of 353 papers submitted: 35.7% acceptance rate)

  3. D. A. Bader, J. JáJá , D. Harwood, and L.S. Davis. `` Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study,'' 10th International Parallel Processing Symposium (IPPS) Conference, Honolulu, HI, pp. 414-423, April 15-19, 1996. (126 papers accepted out of 353 papers submitted: 35.7% acceptance rate)

  4. D. R. Helman, D. A. Bader, and J. JáJá . `` Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study,'' Eighth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Padua, Italy, pp. 211-220, June 1996. (39 papers accepted out of 106 papers submitted: 36.8% acceptance rate)

  5. S.N.V. Kalluri, Z. Zhang, J. JáJá, D.A. Bader, H. Song, N. El Saleous, E. Vermote, and J.R.G. Townshend `` A Hierarchical Data Archiving and Processing System to Generate Custom Tailored Products from AVHRR Data,'' IEEE 1999 International Geoscience and Remote Sensing Symposium (IGARSS), Hamburg, Germany, pp. 2374-2376, Vol. 5, June/July 1999.

  6. D.A. Bader, A.B. Maccabe, J.R. Mastaler, J.K. McIver III, and P.A. Kovatch, `` Design and Analysis of the Alliance / University of New Mexico Roadrunner Linux SMP SuperCluster,'' First IEEE Computer Society International Workshop on Cluster Computing (IWCC), Melbourne, Australia, December 1999. (37 papers accepted)

  7. D.A. Bader, ``High-Performance Algorithms and Applications for SMP Clusters,'' NASA High Performance Computing and Communications Computational Aerosciences Workshop (CAS 2000), NASA Ames Research Center, February 15-17, 2000.

  8. D.A. Bader, `` An Improved Randomized Selection Algorithm With an Experimental Study,'' Second Workshop on Algorithm Engineering and Experiments (ALENEX00), (sponsored by DIMACS, ACM SIGACT, and SIAM), San Francisco, CA, January 7-8, 2000. (15 papers accepted out of 35 papers submitted: 42.8% acceptance rate)

  9. B.M.E. Moret, S. Wyman, D.A. Bader, T. Warnow, M. Yan, `` A New Implementation and Detailed Study of Breakpoint Analysis,'' Sixth Pacific Symposium on Biocomputing 2001 (PSB2001), pp. 583-594, Big Island, Hawaii, January 3-7, 2001.

  10. D.A. Bader, B. M.E. Moret, T. Warnow, S.K. Wyman, and M. Yan, ``High-Performance Algorithm Engineering for Gene-Order Phylogenies,'' DIMACS Workshop on Whole Genome Comparison, DIMACS Center, Rutgers University, Piscataway, NJ, March 1, 2001.

  11. C. Restrepo, B.T. Milne, D. Bader, W. Pockman, and A. Kerkhoff, ``Variation in vegetation growth rates: Implications for the evolution of semi-arid landscapes,'' 16th Annual Symposium of the US-International Association of Landscape Ecology, Arizona State University, Tempe, April 25-29, 2001.

  12. B. M.E. Moret, D.A. Bader, and T. Warnow, `` High-Performance Algorithm Engineering for Computational Phylogeny,'' The 2001 International Conference on Computational Science (ICCS 2001), V. Alexandrov and J. Dongarra and C.J.K. Tan (eds.), Springer-Verlag LNCS 2074, 1012-1021, San Francisco, CA, May 29, 2001. (230 accepted and invited papers)

  13. D.A. Bader, B. M.E. Moret, and M. Yan, `` A Linear-Time Algorithm for Computing Inversion Distance Between Two Signed Permutations with an Experimental Study,'' Seventh International Workshop on Algorithms and Data Structures (WADS 2001), F. Dehne, J.-R. Sack, and R. Tamassia (eds.), Springer-Verlag LNCS 2125, 365-376, Brown University, Providence, RI, August 8-10, 2001. (40 papers accepted out of 89 papers submitted: 44.9% acceptance rate)

  14. D.A. Bader, B. M.E. Moret, and L. Vawter, `` Industrial Applications of High-Performance Computing for Phylogeny Reconstruction,'' SPIE ITCom: Commercial Applications for High-Performance Computing (SPIE ITCom2001), Denver, CO, SPIE Vol. 4528, pp. 159-168, August 21-22, 2001. (21 papers accepted)

  15. D.A. Bader, A. Illendula, B. M.E. Moret, and N.R. Weisse-Bernstein, `` Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture,'' Fifth Workshop on Algorithm Engineering (WAE 2001), G.S. Brodal, D. Frigioni, and A. Marchetti-Spaccamela, (eds.), Springer-Verlag LNCS 2141, 129-144, University of Aarhus, Denmark, August 28-31, 2001. (15 papers accepted out of 25 papers submitted: 60% acceptance rate)

  16. Y. Sun, D.A. Bader, X. Lin, and Y. Ling, `` Broadcast on Clusters of SMPs with Optimal Concurrency,'' The 2002 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, NV, June 2002.

  17. D.A. Bader, S. Sreshta, and N.R. Weisse-Bernstein, `` Evaluating Arithmetic Expressions using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs),'' 9th International Conference on High Performance Computing (HiPC 2002), Bangalore, India, Lecture Notes in Computer Science, 2552:63-75, December 2002. (57 papers accepted out of 145 papers submitted: 39.3% acceptance rate)

  18. D.A. Bader and G. Cong, ``A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs),'' 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Santa Fe, NM, April 26-30, 2004. (142 papers accepted out of 447 papers submitted: 31.8% acceptance rate)

  19. D.A. Bader and G. Cong, ``Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs,'' 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Santa Fe, NM, April 26-30, 2004. (142 papers accepted out of 447 papers submitted: 31.8% acceptance rate)

  20. G. Cong and D.A. Bader, ``The Euler Tour Technique and Parallel Rooted Spanning Tree,'' 33rd International Conference on Parallel Processing (ICPP), Montreal, Canada, pages 448-457, August 15-18, 2004. (65 papers accepted out of 190 papers submitted: 34.2% acceptance rate)

  21. M. F. Su, I. El-Kady, D. A. Bader, and S.-Y. Lin, ``A Novel FDTD Application Featuring OpenMP-MPI Hybrid Parallelization,'' 33rd International Conference on Parallel Processing (ICPP), Montreal, Canada, pages 373-379, August 15-18, 2004. (65 papers accepted out of 190 papers submitted: 34.2% acceptance rate)

  22. D.A. Bader and K. Madduri, ``A Parallel State Assignment Algorithm for Finite State Machines,'' The 11th International Conference on High Performance Computing (HiPC 2004), L. Bougé and V.K. Prasanna, (eds.), Springer-Verlag LNCS 3296, 297-308, Bangalore, India, December 2004. (48 papers accepted out of 214 papers submitted: 22.4% acceptance rate)

  23. G. Cong and D.A. Bader, ``Lock-free Parallel Algorithms: An Experimental Study,'' The 11th International Conference on High Performance Computing (HiPC 2004), L. Bougé and V.K. Prasanna, (eds.), Springer-Verlag LNCS 3296, 516-527, Bangalore, India, December 2004. (48 papers accepted out of 214 papers submitted: 22.4% acceptance rate)

  24. G. Cong and D.A. Bader, ``An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs),'' 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Denver, CO, April 4-8, 2005. (115 papers accepted out of 343 papers submitted: 33.5% acceptance rate)

  25. D.A. Bader, G. Cong, and J. Feo, ``On the Architectural Requirements for Efficient Execution of Graph Algorithms,'' The 34th International Conference on Parallel Processing (ICPP 2005), pp. 547-556, Georg Sverdrups House, University of Oslo, Norway, June 14-17, 2005. (69 papers accepted out of 241 papers submitted: 28.6% acceptance rate)

  26. D.A. Bader, V. Sachdeva, A. Trehan, V. Agarwal, G. Gupta, and A.N. Singh, ``BioSPLASH: A sample workload from bioinformatics and computational biology for optimizing next-generation high-performance computer systems,'' (Poster Session), 13th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB 2005), Detroit, MI, June 25-29, 2005.

  27. D.A. Bader, V. Sachdeva, ``BioSPLASH: Incorporating life sciences applications in the architectural optimizations of next-generation petaflop-system,'' (Poster Session), The 4th IEEE Computational Systems Bioinformatics Conference (CSB 2005), Stanford University, CA, August 8-11, 2005.

  28. D.A. Bader, V. Sachdeva, ``A Cache-Aware Parallel Implementation of the Push-Relabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling Heuristic,'' The 18th ISCA International Conference on Parallel and Distributed Computing Systems (PDCS 2005), Las Vegas, NV, September 12-14, 2005.

  29. G. Cong, D.A. Bader, ``An Empirical Analysis of Parallel Random Permutation Algorithms on SMPs,'' The 18th ISCA International Conference on Parallel and Distributed Computing Systems (PDCS 2005), Las Vegas, NV, September 12-14, 2005.

  30. D.A. Bader, Y. Li, T. Li, V. Sachdeva, ``BioPerf: A Benchmark Suite to Evaluate High-Performance Computer Architecture on Bioinformatics Applications,'' The IEEE International Symposium on Workload Characterization (IISWC 2005), Austin, TX, October 6-8, 2005. (17 papers accepted out of 52 papers submitted: 32.6% acceptance rate)

  31. D.A. Bader and K. Madduri, ``Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors,'' The 12th International Conference on High Performance Computing (HiPC 2005), D.A. Bader et al., (eds.), Springer-Verlag LNCS 3769, 465-476, Goa, India, December 2005. (50 papers accepted out of 362 papers submitted: 13.8% acceptance rate)

  32. M. Sottile, V. Chandu, and D.A. Bader, ``Performance analysis of parallel programs via message-passing graph traversal,'' 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Rhodes Island, Greece, April 25-29, 2006. (125 papers accepted out of 531 papers submitted: 23.5% acceptance rate)

  33. D.A. Bader, V. Chandu, and M. Yan, ``ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony,'' The 35th International Conference on Parallel Processing (ICPP 2006), Columbus, OH, August 14-18, 2006. (64 papers accepted out of 200 papers submitted: 32.0% acceptance rate)

  34. D.A. Bader and K. Madduri, ``Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2,'' The 35th International Conference on Parallel Processing (ICPP 2006), Columbus, OH, August 14-18, 2006. (64 papers accepted out of 200 papers submitted: 32.0% acceptance rate)

  35. D.A. Bader and K. Madduri, ``Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks,'' The 35th International Conference on Parallel Processing (ICPP 2006), Columbus, OH, August 14-18, 2006. (64 papers accepted out of 200 papers submitted: 32.0% acceptance rate)

  36. 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 -- The Shortest Path Problem, DIMACS Center, Rutgers University, Piscataway, NJ, November 13-14, 2006.

  37. D.A. Bader, V. Agarwal, and K. Madduri, ``Efficient Implementation of Irregular Algorithms on Cell Multi-core Architecture,'' (Poster Session), Supercomputing '06 Workshop: General-Purpose GPU Computing: Practice And Experience, Tampa, FL, November 13, 2006.

  38. 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,'' Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, January 6, 2007. (15 papers accepted out of 60 papers submitted: 25.0% acceptance rate)

  39. D.A. Bader, V. Agarwal, and K. Madduri, ``On the Design and Analysis of Irregular Algorithms on the Cell Processor: A case study on list ranking,'' 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS), Long Beach, CA, March 26-30, 2007. (109 papers accepted out of 419 papers submitted: 26.0% acceptance rate)

  40. D.A. Bader and K. Madduri, ``A Graph-Theoretic Analysis of the Human Protein-Interaction Network Using Multi-core Parallel Algorithms,'' Sixth IEEE International Workshop on High Performance Computational Biology (HiCOMB), Long Beach, CA, March 26, 2007.

  41. D.A. Bader, V.N. Kanade, and K. Madduri, ``SWARM: A Parallel Programming Framework for Multi-Core Processors,'' First Workshop on Multithreaded Architectures and Applications (MTAAP), Long Beach, CA, March 30, 2007.

  42. J.R. Crobak, J.W. Berry, K. Madduri, and D.A. Bader, ``Advanced Shortest Path Algorithms on a Massively-Multithreaded Architecture,'' First Workshop on Multithreaded Architectures and Applications (MTAAP), Long Beach, CA, March 30, 2007.

  43. G. Cong, D.A. Bader, ``Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors,'' The 5th International Symposium on Parallel and Distributed Processing and Applications (ISPA 2007), Niagara Falls, Ontario, Canada, August 29-31, 2007.

  44. D.A. Bader and K. Madduri, ``High-Performance Combinatorial Techniques for Analyzing Massive Dynamic Interaction Networks,'' DIMACS Workshop on Computational Methods for Dynamic Interaction Networks, DIMACS Center, Rutgers University, Piscataway, NJ, September 24-25, 2007.

  45. D.A. Bader, S. Kintali, K. Madduri, and M. Mihail, ``Approximating Betweenness Centrality,'' The 5th Workshop on Algorithms and Models for the Web-Graph (WAW2007), San Diego, CA, December 11-12, 2007.

  46. D.A. Bader, V. Agarwal, ``FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine,'' The 14th Annual IEEE International Conference on High Performance Computing (HiPC 2007), S. Aluru et al., (eds.), Springer-Verlag LNCS 4873, 172-184, Goa, India, December 18-21, 2007. (52 papers accepted out of 253 papers submitted: 20.5% acceptance rate)

  47. 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,'' 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Miami, FL, April 14-18, 2008. (105 papers accepted out of 410 papers submitted: 25.6% acceptance rate)

  48. D.A. Bader and S. Patel, ``High Performance MPEG-2 Software Decoder on the Cell Broadband Engine,'' 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Miami, FL, April 14-18, 2008. (105 papers accepted out of 410 papers submitted: 25.6% acceptance rate)

  49. V. Agarwal, L.-K. Liu, and D.A. Bader, ``Financial Modeling on the Cell Broadband Engine,'' 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Miami, FL, April 14-18, 2008. (105 papers accepted out of 410 papers submitted: 25.6% acceptance rate)

  50. S. Kang and D.A. Bader, ``Optimizing JPEG2000 Still Image Encoding on the Cell Broadband Engine,'' The 37th International Conference on Parallel Processing (ICPP 2008), Portland, OR, September 8-12, 2008. (81 papers accepted out of 263 papers submitted: 30.8% acceptance rate)

  51. D.A. Bader, A. Chandramowlishwaran, and V. Agarwal, ``On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis,'' The 37th International Conference on Parallel Processing (ICPP 2008), Portland, OR, September 8-12, 2008. (81 papers accepted out of 263 papers submitted: 30.8% acceptance rate)

  52. S. Hao, Z. Du, D.A. Bader, and M. Wang, ``A Prediction Based CMP Cache Migration Policy,'' 10th IEEE International Conference on High Performance Computing and Communications (HPCC), Dalian, China, September 25-27, 2008. (90 papers accepted out of 455 papers submitted: 19.7% acceptance rate)

Conference Presentations with Proceedings (non-refereed)

  1. D.A. Bader and V.K. Prasanna, ``DOSA: Design Optimizer for Scientific Applications,'' NSF Next Generation Workshop, Long Beach, CA, March 25-26, 2007.

  2. D.A. Bader and V.K. Prasanna, ``DOSA: Design Optimizer for Scientific Applications,'' NSF Next Generation Workshop, Miami, FL, April 13-14, 2008.

Conference Presentations without Proceedings

  1. R.K. Jansen, D.A. Bader, B. M. E. Moret, L.A. Raubeson, L.-S. Wang, T. Warnow, and S. Wyman, ``New approaches for using gene order data in phylogeny reconstruction,'' Botany 2001, Albuquerque, NM, August 12-16, 2001.

  2. B. M.E. Moret, D.A. Bader, T. Warnow, S.K. Wyman, and M. Yan, ``GRAPPA: a high-performance computational tool for phylogeny reconstruction from gene-order data,'' Botany 2001, Albuquerque, NM, August 12-16, 2001.

  3. L.A. Raubeson, D.A. Bader, B. M.E. Moret, L.-S. Wang, T. Warnow, and S.K. Wyman, ``Inferring phylogenies of photosynthetic organisms from chloroplast gene orders,'' Botany 2001, Albuquerque, NM, August 12-16, 2001.

  4. T.J. Warnow, J.L. Boore, H.M. Fourcade, R.K. Jansen, R. Haberle, T.W. Chumley, L. Raubeson, S. Wyman, C. dePamphilis, B. Moret, D. Bader, W. Miller, ``Comparative chloroplast genomics of seed plants: integrating computational methods, phylogeny, and molecular evolution,'' (Poster Session), Evolution 2003, Chico, CA, June 20-24, 2003.

  5. D.A. Bader, `` Scalable Graph Algorithms for Shared Memory,'' 11th SIAM Conference on Parallel Processing for Scientific Computing (PP04), San Francisco, CA, February 25-27, 2004.

  6. D.A. Bader, `` High-Performance Computing for Reconstructing Evolutionary Trees from Gene-Order Data,'' Minisymposium on Parallel Computational Biology, 11th SIAM Conference on Parallel Processing for Scientific Computing (PP04), San Francisco, CA, February 25-27, 2004.

  7. D.A. Bader, `` Fast, Sparse Graph Algorithms using Symmetric Multiprocessors,'' Minisymposium on Combinatorial Algorithms and Parallel Computing, 11th SIAM Conference on Parallel Processing for Scientific Computing (PP04), San Francisco, CA, February 25-27, 2004.

  8. D.A. Bader, ``Dynamic Computations in Large-Scale Graphs,'' Minisymposium on Data-Aware Parallel Computing, 12th SIAM Conference on Parallel Processing for Scientific Computing (PP06), San Francisco, CA, February 22-24, 2006.

  9. D.A. Bader and K. Madduri, ``Efficient Shared-memory Algorithms and Implementations for Solving Large-scale Graph Problems,'' Minisymposium on High-Performance Computing with Large Graphs, 2006 SIAM Annual Meeting (AN06), Boston, MA, July 10-14, 2006.

  10. D.A. Bader, V. Agarwal, ``FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine,'' The 11th Annual High Performance Embedded Computing Workshop (HPEC), Lexington, MA, September 18-20, 2007.

  11. D.A. Bader, ``Irregular Algorithms on the Cell Broadband Engine,'' Minisymposium on High Performance Computing on the Cell Processor, 13th SIAM Conference on Parallel Processing for Scientific Computing (PP08), Atlanta, GA, March 12, 2008.

  12. D.A. Bader, ``Accelerators, Cell Broadband Engine, Graphics Processors, and FPGAs,'' Minisymposium on Future Challenges in High Performance Computing for Algorithm and Tool Developers, 13th SIAM Conference on Parallel Processing for Scientific Computing (PP08), Atlanta, GA, March 13, 2008.

  13. D.A. Bader, ``Parallel Algorithms for Small-world Network Analysis and Partitioning,'' Minisymposium on HPC on Large Graphs, 13th SIAM Conference on Parallel Processing for Scientific Computing (PP08), Atlanta, GA, March 13, 2008.

  14. D.A. Bader, ``Accelerating Combinatorial Scientific Computing with the Cell Broadband Engine Processor,'' Minisymposium on Revolutionary Technologies for Acceleration of Emerging Petascale Applications, 13th SIAM Conference on Parallel Processing for Scientific Computing (PP08), Atlanta, GA, March 13, 2008.

  15. S. Kang and D.A. Bader, ``Optimizing Discrete Wavelet Transform on the Cell Broadband Engine,'' The 12th Annual High Performance Embedded Computing Workshop (HPEC), Lexington, MA, September 23-25, 2008.

Conference Tutorials (peer-reviewed)

  1. Robert Pennington, David A. Bader, and Arthur B. Maccabe, ``Design and Analysis of NT and Linux Superclusters for Computational Grids,'' The IEEE and ACM Supercomputing Conference 1999 (SC99), Portland, OR, November 15, 1999.

  2. Robert Pennington, Patricia Kovatch, Arthur B. Maccabe, and David A. Bader, ``Design and Analysis of High Performance Clusters,'' The IEEE and ACM Supercomputing Conference 2000 (SC2000), Dallas, TX, November 5, 2000.

  3. David A. Bader, Bruce Hendrickson, and Steve Plimpton, ``Parallel Programming for Cluster Computers,'' The IEEE and ACM Supercomputing Conference 2000 (SC2000), Dallas, TX, November 6, 2000.

  4. Srinivas Aluru and David A. Bader, ``Opportunities and Challenges in Computational Biology,'' The IEEE and ACM Supercomputing Conference 2002 (SC2002), Baltimore, MD, November 17, 2002.

  5. David A. Bader, Usman Roshan, and Alexandros Stamatakis, ``Computational Grand Challenges in Assembling the Tree of Life: Problems & Solutions,'' The IEEE and ACM Supercomputing Conference 2005 (SC2005), Seattle, WA, November 13, 2005.

  6. Srinivas Aluru, David A. Bader, and Ananth Kalyanaraman, ``High-Performance Computing Methods for Computational Genomics,'' The IEEE and ACM Supercomputing Conference 2006 (SC2006), Tampa, FL, November 13, 2006.

  7. Srinivas Aluru, David A. Bader, and Ananth Kalyanaraman, ``High-Performance Computing Methods for Computational Genomics,'' The 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS 2007), Long Beach, CA, March 27, 2007.

Other

Published Papers (non-refereed)

  1. D. A. Bader, `` Editorial: A New, Architectural Paradigm for High-performance Computing,'' Parallel and Distributed Computing Practices Journal, 2(2), 1999.

Additional Technical Reports

  1. D. A. Bader and P. J. Stinson. ``Table of Lower Bounds on the Minimum Distance of Cyclic and BCH Codes,'' NSF Research Experience for Undergraduates (REU) Program Summer Project Report, Lehigh University Research Report CSEE-TR-90-06, Department of Computer Science and Electrical Engineering, Lehigh University, 1989.

  2. D. A. Bader. ``PARSIM: A Simulator for Designing Parallel Algorithms and Architectures,'' Lehigh University Research Report CSEE-TR-90-07, Department of Computer Science and Electrical Engineering, Lehigh University, 1990.

  3. D. A. Bader. ``Object Oriented Simulation of Systems With Examples in Structural Design And Parallel Processing,'' Master's Thesis, Department of Computer Science and Electrical Engineering, Lehigh University, January 1992.

Research Proposals and Grants (Principal Investigator)

  1. NASA NGT-50951, Graduate Student Researcher Fellowship, $88,000, 1992-1996.
  2. Research Associate, NSF CISE 96-25668, CISE Postdoctoral Research Associate in Computational Science & Engineering Science: High Performance Computing for Remote Sensing Applications with the Institute for Advanced Computer Studies (UMIACS), University of Maryland, College Park. NSF 96-25668.
  3. NRC 9601610, Research Associateship Award, $42,500, 1996-1997. (award declined)
  4. DOE Sandia National Laboratories, Sandia University New Assistant Professorship Program (SUNAPP) Award, PI: D.A. Bader, Collaborative research with the Algorithms & Discrete Math Department at SNL developing methodologies for high performance computing on clusters of symmetric multiprocessors. Contract Number AX-3006, $30,000, 9/01/1998 - 8/31/1999.
  5. DOE Sandia National Laboratories, Sandia University New Assistant Professorship Program (SUNAPP) Award, PI: D.A. Bader, Collaborative research with the Algorithms & Discrete Math Department at SNL developing methodologies for high performance computing on clusters of symmetric multiprocessors. Contract Number AX-3006, $30,000, 10/01/1999 - 9/30/2000.
  6. NSF DEB 99-10123, ``Ecosystem Studies: Self-Organization of Semi-Arid Landscapes: Test of Optimality Principles,'' PIs: B.T. Milne, D.A. Bader, W.T. Pockman, C. Restrepo, National Science Foundation, Division of Environmental Biology, $674,911, 1/1/2000 - 2/29/2004.
  7. NSF ITR 00-81404, ``ITR/ACS: Algorithms for Irregular Discrete Computations on SMPs,'' PIs: B.M. Moret and D.A. Bader, National Science Foundation, Information Technology Research Program, $452,052, 9/1/2000 - 1/31/2004.
  8. DOE Sandia National Laboratories, Computer Science Research Institute Award. "High Performance Computing Algorithms and Applications," PI: D.A. Bader, Contract Number 14968, $35,000, 11/28/2000 - 7/14/2001.
  9. NSF CAREER 00-93039, ``CAREER: High-Performance Algorithms for Scientific Applications,'' PI: D.A. Bader, National Science Foundation, Faculty Early Career Development (CAREER) Program, $635,641 (NSF portion: $385,641, UNM cost share: $250,000), 9/1/2001 - 1/31/2006. Research Experiences for Undergraduate (REU) supplement: $12,000.
  10. NSF EIA 01-21377, ``Collaborative Research: ITR/AP Reconstructing Complex Evolutionary Histories,'' PIs: B.M.E. Moret and D.A. Bader (New Mexico); T. Warnow, R. Jansen, and R. Linder (Texas-Austin); National Science Foundation, Information Technology Research (ITR) Program, $792,540 (UNM portion), 9/15/2001 - 9/30/2006.
  11. NSF DEB 01-20709, ``Comparative Chloroplast Genomics: Integrating Computational Methods, Molecular Evolution, and Phylogeny,'' PIs: R. Jansen, T. Warnow (Texas-Austin); L. Raubeson (Central Wash.); B.M.E. Moret, D.A. Bader (New Mexico); C. dePamphilis, W. Miller (Penn State); and J. Boore (DOE Joint Genome Inst.); National Science Foundation, Biocomplexity in the Environment (BE): Genome-Enabled Environmental Science and Engineering (GEN-EN) Program; $1.35M (total); $192,599 (UNM subcontract), 10/1/2001 - 9/30/2006.
  12. DOE Sandia National Laboratories, Computer Science Research Fund, "Enabling PetaFLOPs Computing Applications," PI: D.A. Bader, Contract Number 27983, $100,000, 2/1/2002 - 1/31/2003.
  13. IBM / DARPA, "PERCS Productive, Easy-to-Use, Reliable Computing Systems," UNM PIs: D.A. Bader and B.M.E. Moret, High Productivity Computing Systems (Phase 1) Program, $3M (total); $65,000 (UNM portion), 7/15/2002 - 9/16/2003.
  14. NSF EIA 02-03584, "Postdoc: A Hierarchical Methodology for SMP Clusters," PIs: B.M.E. Moret and D.A. Bader, National Science Foundation, CISE Postdoctoral Research Associate in Experimental Computer Science, $138,072 (NSF portion: $66,000, UNM cost share: $72,072), 8/1/2002 - 7/31/2004.
  15. Alfred P. Sloan Foundation, "Postdoctoral Fellowship in Computational Molecular Biology for Dr. Tiffani L. Williams," PIs: B.M.E. Moret and D.A. Bader, Sloan Foundation and Department of Energy, $152,072 (Sloan/DOE portion: $120,000, UNM cost share: $32,072), 8/1/2002 - 7/31/2004.
  16. DOE Sandia National Laboratories, Combinatorial Algorithms for Homeland Defense, PI: D.A. Bader, Contract Number 55856, $29,735, 8/26/2002 - 5/30/2003.
  17. IBM / DARPA, "PERCS Productive, Easy-to-Use, Reliable Computing Systems," UNM PIs: D.A. Bader, B.M.E. Moret, A.B. Maccabe, P.G. Bridges, High Productivity Computing Systems (Phase 2) Program, $53.3M (total); $900,000 (UNM portion, from DARPA: $600K, and UNM cost share: $300K), 7/15/2003 - 9/16/2006.
  18. DOE Sandia National Laboratories, Parallel Algorithms for Computational Electromagnetics, PI: D.A. Bader, Contract Number 161449, $13,000, 8/1/2003 - 7/31/2004.
  19. NSF Emerging Frontiers / BIO 03-31654, ``ITR Collaborative Research: Building the Tree of Life -- A National Resource for Phyloinformatics and Computational Phylogenetics,'' PI: B.M.E. Moret (U New Mexico); coPI's: D.A. Bader (U New Mexico), F. Berman (UC San Diego), P. Bourne (UC San Diego), M. Donoghue (Yale), D.M. Hillis (U Texas-Austin), W. Hunt (U Texas-Austin), J. Kim (U Pennsylvania), P. Lewis (U Connecticut), D. Maddison (U Arizona), W. Maddison (U Arizona), D. Miranker (U Texas-Austin), B. Mischler (UC Berkeley), L. Meyers (U Texas-Austin), E. Myers (UC Berkeley), S. Rao (UC Berkeley), S. Russell (UC Berkeley), D. Swofford (Florida State U), T. Warnow (U Texas-Austin), W. Wheeler (American Museum of Natural History), T. Williams (U New Mexico); National Science Foundation, Information Technology Research Program, $11.6M Total, (UNM: $3,540,907), 10/1/2003 -- 9/30/2008.
  20. DOE Sandia National Laboratories, Innovative Parallel Algorithms for Computational Electromagnetics, PI: D.A. Bader, Contract Number 305103, $29,640, 6/1/2004 - 5/31/2005.
  21. NSF DBI 04-20513, "Acquisition of a High Performance Shared-Memory Computer for Computational Science and Engineering at the University of New Mexico," PIs: H. Guo, D.A. Bader, S.R. Atlas, M.S. Ingber, and T. Oprea. National Science Foundation, Major Research Instrumentation Program, $350,378 (NSF), $150,162 (UNM cost share), 9/1/2004 - 8/31/2007.
  22. DOE Sandia National Laboratories, Designing Parallel Graph Algorithms for Multi-Threaded Architectures, PI: D.A. Bader, $73,000, 1/1/2005 -- 12/31/2005.
  23. Los Alamos National Laboratory, LinuxBIOS support on advanced 64-bit systems, PI: D.A. Bader, $40,000, 1/1/2005 -- 12/31/2005.
  24. NSF 05-29795, ``CAREER: High-Performance Algorithms for Scientific Applications, Research Experience for Undergraduate (REU) Supplement'' PI: D.A. Bader, National Science Foundation, Faculty Early Career Development (CAREER) Program, 5/27/2005 - 5/31/2006. $15,000.
  25. Los Alamos National Laboratory, Performance Evaluation of Large-Scale Parallel Programs, PI: D.A. Bader, $75,000, 9/1/2005 -- 6/30/2006.
  26. NSF CCF 06-11589, ``CAREER: High-Performance Algorithms for Scientific Applications,'' PI: D.A. Bader, National Science Foundation, Faculty Early Career Development (CAREER) Program, $96,037 (NSF portion, transfered from NSF 00-93039), $12,000 (new NSF Research Experience for Undergraduates supplement), $42,109 (Georgia Tech cost share), 12/1/2005 -- 12/31/2006.
  27. NSF CSR 06-14915, ``Collaborative Research: CSR---AES: A Framework for Optimizing Scientific Applications,'' Lead PI: David A. Bader, and USC PI: Viktor Prasanna (U Southern California), National Science Foundation, Computer Systems Research, $200,000 Total (Georgia Tech portion: $100,000), 6/15/06 - 6/15/08.
  28. NSF DBI 06-32517, ``Workshop Proposal: Petascale Computing in the Biosciences is Being Held on August 29-30, 2006 in Arlington, VA.,'' PIs: Allan Snavely (University of California, San Diego), David A. Bader, and Gwen A. Jacobs (Montana State University), Biological Sciences Directorate National Science Foundation, $54,488, 8/15/06 - 7/31/07.
  29. IBM Faculty Fellowship Award, ``Optimizing Data-Intensive Applications for Cell BE,'' $40,000, 7/1/2006.
  30. NASA ARC 5119/NNA06CN37H, ``Performance Analysis and Optimization of NASA Scientific Applications on the NAS Supercomputers,'' NASA Graduate Student Researcher Program (GSRP) Fellowship for Kamesh Madduri, NASA NP-2005-07-375-HQ, $24,000, 10/1/2006-9/30/2007.
  31. Sony-Toshiba-IBM Cell Center of Competence, Director: D.A. Bader; Associate Directors: Santosh Pande, Karsten Schwan, and Irfan Essa, Supported by an award from IBM Corp. and Sony Corp., $320,000, 11/1/2006.
  32. Microsoft Research, ``Enabling MS Visual Studio Programmers to Design Efficient Parallel Algorithms for Multi-Core Processors,'' External Reseach & Programs ``Parallel and Concurrent Programming 2006-2007'' Program, $75,000, 10/24/2006.
  33. NASA ARC, ``Performance Analysis and Optimization of NASA Scientific Applications on the NAS Supercomputers,'' NASA Graduate Student Researcher Program (GSRP) Fellowship for Kamesh Madduri (Second Year Renewal), $30,000, 10/1/2007-9/30/2008.
  34. NIH R01 GM083621, ``Combinatorial and Computational Methods for the Analysis, Prediction, and Design of Viral RNA Structures,'' PIs: Christine Heitsch, David A. Bader, Steve Harvey. NSF-NIH Joint DMS/NIGMS Initiative to Support Research in the Area of Mathematical Biology, National Institutes of Health, \$720,000, 9/1/07 - 8/31/11.
  35. NSF CNS-0708307, ``Collaborative Research: CRI: IAD: Development of a Research Infrastructure,'' PIs: Jay Brockman (University of Notre Dame), David A. Bader, Guang Gao (University of Delaware), John Gilbert (University of California, Santa Barbara), Ed Upchurch (California Institute of Technology), Kathy Yelick (University of California, Berkeley), Computing Research Infrastructure (CRI) Program, National Science Foundation, $787,150, 8/1/07 - 7/31/12.
  36. ``Focused Research Program in High-Performance Computing,'' Coordinator: David A. Bader, and 29 other Engineering, Sciences, and Computing faculty, Georgia Institute of Technology, 8/1/07 - 7/30/08, \$30,000 May 30, 2007. (Georgia Tech selects five FRP proposals for award each year.)
  37. NSF OCI-0749223, ``Collaborative Research: Enabling Discovery in High Reynolds Number Turbulence via Advanced Tools for Petascale Simulation and Analysis,'' Lead PI: Pui-Kuen Yeung, coPIs: David A. Bader; Amitava Majumdar, Dmitry Pekurovsky (University of California, San Diego), James J. Riley (University of Washington), Robert D. Moser (University of Texas at Austin) ; National Science Foundation, Accelerating Discovery in Science and Engineering Through Petascale Simulations and Analysis (PetaApps), $1.6M, 10/1/07 - 9/30/12.
  38. MIT Lincoln Laboratory, ``High Performance Computing for Massive Graph Analysis,'' $50,000, 4/1/2008-10/31/2008.
  39. Department of Defense, ``DoD HPCMP Summer Intern Program at Georgia Tech,'' $68.738, 5/17/2008-7/26/2008.
  40. NVIDIA Professor Partnership Award, D.A. Bader, $25,000, 8/1/2008.
  41. ``Focused Research Program in High-Performance Computing,'' Coordinator: David A. Bader, and 50 other Engineering, Sciences, and Computing faculty, Georgia Institute of Technology, 8/1/08 - 7/30/09, \$30,000 May 30, 2008. (Georgia Tech selects five FRP proposals for award each year.)
  42. NSF IIP-0708307, ``Collaborative Research: Establishing an I/UCRC Center for Multicore Productivity Research (CMPR),'' Georgia Tech PI: David A. Bader; CoPIs: Rich Vuduc, Ada Gavrilovska, and Nathan Clark. University of Maryland, Baltimore County PI: Milton Halem; CoPI: Yelena Yesha. University of California, San Diego PI: Sheldon Brown. Industry/University Cooperative Research Centers (I/UCRC) Program, National Science Foundation, $30,000, ($10,000 Georgia Tech portion) 8/15/08 - 7/31/09.
  43. ``High-Performance Computing for Massive Graph Analysis,'' Georgia Tech PI: David A. Bader, Pacific Northwest National Laboratory, $180,000, (of DoD $4.0M award for the Center for Adaptive Supercomputign Software (CASS)), 8/1/08 - 7/7/09.

Research Proposals and Grants (Contributor)

  1. NSF DEB 00-80529, ``Sevilleta LTER III: Long Term Ecological Research in a Biome Transition Zone,'' National Science Foundation, Division of Environmental Biology, PIs: C.N. Dahm (current), J.R. Gosz (former), J.W. Brunt, T.K. Lowrey, W.T. Pockman, D. Pennington, R.R. Parmenter, $1,400,000, 10/15/2000 - 10/14/2002. (Senior Personnel)
  2. NSF EIA 01-13095, ``ITR/AP(DEB): Collaborative Research `Computing Optimal Phylogenetic Trees under Genome Rearrangement Metrics','' PIs: R. Jansen and B.M.E. Moret), National Science Foundation, Information Technology Research (ITR) Program, $450,000 (total); $161,903 (UNM portion), 10/1/2001 - 9/30/2004. (Senior Personnel)
  3. NSF INT 01-29062, ``Time-Delay Systems: Analysis, Computer Aided Design and Applications,'' PI: K. Gu, (Southern Illinois), National Science Foundation, U.S.-France Cooperative Research International Program, $10,000 (total); $1,000 (UNM portion), 3/15/2002 - 2/28/2003.

Equipment Grants

  1. NSF PACI/NCSA, ``Linux Based Clusters for the Alliance: A Proposal to Establish a Linux Based Cluster (LBC) at the University of New Mexico,'' PIs: D.A. Bader, A.B. Maccabe, F. Gilfeather, approx. $200,000, March 1999.
  2. IBM, "Development and Investigation of an Interoperable, Hybrid Technology System for Local/Remote Scientific and Visual Computing," PIs: S.R. Atlas, D.A. Bader, R.A. Ballance, T.P. Caudell, B.T. Smith, J. Sobolewski, IBM Shared University Research (SUR) Program, approx. $3M, 1/1/2000.
  3. Sun Microsystems, ``Sun StorEdge Array for Computational Science,'' PIs: D.A. Bader, K. Schwan, M. Wolf, Academic Equipment Grant (AEG) Program, approx. $42,800, 6/13/2005.
  4. Xilinx Corp., ``Reconfigurable Computing with FPGA Devices,'' (two Digilent Spartan 3 development boards), PI: D.A. Bader, Xilinx University Program (XUP), 2/28/2006.
  5. IBM Corp., ``Optimizing Scientific Libraries for IBM Cell,'' PI: D.A. Bader; Additional Researchers: Santosh Pande, Karsten Schwan, and Irfan Essa, Shared University Research (SUR) Program, approx. $55K, 7/1/2006.
  6. Sun Microsystems, ``Optimizing Computational Science Applications on Sun Multithreaded Processors,'' (two Sun T2000 blades with UltraSPARC ``Niagara'' T1 processors), PI: D.A. Bader, Academic Excellence Grant (AEG) Program, approx. $34K, 7/5/2006.
  7. NVIDIA Research, (two Tesla C870 HPC compute boards), PI: D.A. Bader, Professor Partnership Program, approx. $2,500, 3/26/2008.
  8. IBM Corp., ``Optimizing R Libraries for IBM Cell Broadband Engine,'' PI: D.A. Bader; Additional Researcher: Richard Vuduc, Shared University Research (SUR) Program, $40K, 7/29/2008.

SERVICE

Professional Activities

Memberships and Activities in Professional Societies

Conference Committee Activities