Jonathan Lifflander

Jonathan Lifflander is a 5th year computer science PhD candidate at UIUC (University of Illinois Urbana-Champaign) researching parallel computing, systems, and HPC in the Parallel Programming Laboratory (PPL), advised by Laxmikant (Sanjay) V. Kale. In 2013, he won the George Michael High Performance Computing award for research excellence and academic progress.

Research Areas

Reach Me

Selected Talks

  1. [VAPLS 2013] (Atlanta, GA, USA) Projections: Scalable Performance Analysis and Visualization (presentation)
  2. [PLDI 2013] (Seattle, WA, USA) Steal Tree: Low-Overhead Tracing of Work Stealing Schedulers (presentation)
  3. [ICS 2013] (Eugene, OR, USA) Charm++ Tutorial
  4. [PPoPP 2013] (Shenzhen, China) Adoption Protocols for Fanout-Optimal Fault-Tolerant Termination Detection (presentation)
  5. [SC 2012] (Salt Lake City, UT, USA) Charm++ Tutorial
  6. [IPDPS 2012] (Shanghai, China) Mapping Dense LU Factorization on Multicore Supercomputer Nodes (presentation)
  7. [Charm++ 2011] (Urbana, IL, USA) Scaling Dense LU Factorization in Charm++ (presentation)

Programming Languages

Selected Publications

  1. [PLDI 2013] (acceptance rate 17%)
    Steal Tree: Low-Overhead Tracing of Work Stealing Schedulers
    Jonathan Lifflander, Sriram Krishnamoorthy, Laxmikant V. Kale
  2. [PPoPP 2013] (acceptance rate 18%)
    Adoption Protocols for Fanout-Optimal Fault-Tolerant Termination Detection
    Jonathan Lifflander, Phil Miller, Laxmikant V. Kale
  3. [Book Chapter] Parallel Science and Engineering Applications: The Charm++ Approach
    Chapter 3: Tools for Debugging and Performance Analysis
    Filippo Gioachin, Chee Lee, Jonathan Lifflander, Yanhua Sun | Laxmikant Kale
  4. [Concurrent Objects and Beyond 2012]
    Controlling Concurrency and Expressing Synchronization in Charm++ Programs
    Laxmikant V. Kale, Jonathan Lifflander
  5. [SBAC-PAD 2012] (acceptance rate 28%)
    Scalable Algorithms for Distributed-Memory Adaptive Mesh Refinement
    Ahkil Langer, Jonathan Lifflander, Phil Miller, Kuo-Chuan Pan, Laxmikant V. Kale, Paul Ricker
  6. [HPDC 2012] (acceptance rate 16%)
    Work Stealing and Persistence-based Load Balancers for Iterative Overdecomposed Applications
    Jonathan Lifflander, Sriram Krishnamoorthy, Laxmikant V. Kale
  7. [IPDPS 2012] (acceptance rate 21%)
    Mapping Dense LU Factorization on Multicore Supercomputer Nodes
    Jonathan Lifflander, Phil Miller, Ramprasad Venkataraman, Anshu Arya, Terry Jones, Laxmikant V. Kale
  8. [Journal of Measurement Science and Technology 2012]
    A parallel algorithm for 3-D particle tracking and Lagrangian trajectory reconstruction
    Douglas Barker, Jonathan Lifflander, Anshu Arya, Yuanhui Zhang
  9. [Workshop @ IPDPS 2012]
    Dynamic Scheduling for Work Agglomeration on Heterogeneous Clusters
    Jonathan Lifflander, G. Carl Evans, Anshu Arya, Laxmikant V. Kale
  10. [HiPC 2010] (acceptance rate 19%)
    A Study of Memory-Aware Scheduling in Message Driven Parallel Programs
    Isaac Dooley, Chao Mei, Jonathan Lifflander, Laxmikant V. Kale
  11. [Compsac 2009] (acceptance rate 20%)
    Clustering Versus Shared Nothing: A Case Study
    Jonathan Lifflander, Adam McDonald, Orest Pilskalns

Awards

  1. 2013 Winner of the George Michael HPC Fellowship $5000 honorarium, travel to SC'13
  2. 2013 PLDI Travel Grant Scholarship
  3. 2013 PPoPP Travel Grant Scholarship
  4. 2012 HPDC Travel Grant Scholarship
  5. 2012 IPDPS Travel Grant Scholarship
  6. 2011 HPC Challenge Class 2 First Place Award @ SC11
  7. Graduated Summa Cum Laude with a 4.0 GPA from Washington State University.