Research Areas

• Scheduling (including work-stealing), dynamic load balancing, mapping [PLDI'17] [SC'14] [PLDI'13] [HPDC'12] [IPDPS'12] [HiPC'10]
• Fault tolerance [PPoPP'13] [CLUSTER'14]
• Parallel runtime/compiler development (Cilk, Charm++, TASCEL, etc.)

Reach Me

• You can reach me via email at: jonathanl AT liffland.com
• Or call/text my mobile at: +1-217-882-6123
• Research page @ PPL
• On Google scholar
• On DBLP
• View my LinkedIn profile

Selected Talks

1. [SIAM CSE 2015] (Salt Lake City, UT, USA) Structured Dagger: Supporting Asynchrony with Clarity (presentation)
2. [SC 2014] (New Orleans, LA, USA) Optimizing Data Locality for Fork/Join Programs Using Constrained Work Stealing (presentation)
3. [CLUSTER 2014] (Madrid, Spain) Scalable Replay with Partial-Order Dependencies for Message-Logging Fault Tolerance (presentation)
4. [VAPLS 2013] (Atlanta, GA, USA) Projections: Scalable Performance Analysis and Visualization (presentation)
5. [PLDI 2013] (Seattle, WA, USA) Steal Tree: Low-Overhead Tracing of Work Stealing Schedulers (presentation)
6. [ICS 2013] (Eugene, OR, USA) Charm++ Tutorial
7. [PPoPP 2013] (Shenzhen, China) Adoption Protocols for Fanout-Optimal Fault-Tolerant Termination Detection (presentation)
8. [SC 2012] (Salt Lake City, UT, USA) Charm++ Tutorial
9. [IPDPS 2012] (Shanghai, China) Mapping Dense LU Factorization on Multicore Supercomputer Nodes (presentation)
10. [Charm++ 2011] (Urbana, IL, USA) Scaling Dense LU Factorization in Charm++ (presentation)

Selected Publications

1. [CLUSTER 2021]
   Optimizing Distributed Load Balancing for Workloads with Time-Varying Imbalance
   Jonathan Lifflander, Jonathan Lifflander, Nicole Lemaster Slattengren, Philippe P. Pébaÿ, Phil Miller, Francesco Rizzi, Matthew T. Bettencourt
2. [ExaMPI @ SC 2020]
   Design and Implementation Techniques for an MPI-Oriented AMT Runtime
   Jonathan Lifflander, Phil Miller, Nicole Lemaster Slattengren, Nicolas Morales, Paul Stickney, Philippe P. Pébaÿ
3. [TPDS 2018 (IEEE Transactions Parallel Distributed Systems)]
   Argobots: A Lightweight Low-Level Threading and Tasking Framework
   Sangmin Seo, Abdelhalim Amer, Pavan Balaji, Cyril Bordage, George Bosilca, Alex Brooks, Philip H. Carns, Adrian Castello, Damien Genet, Thomas Herault, Shintaro Iwasaki, Prateek Jindal, Laxmikant V. Kale, Sriram Krishnamoorthy, Jonathan Lifflander, Huiwei Lu, Esteban Meneses, Marc Snir, Yanhua Sun, Kenjiro Taura, Peter H. Beckman
4. [PLDI 2017]
   Cache Locality Optimization for Recursive Programs
   Jonathan Lifflander, Sriram Krishnamoorthy
5. [ESPN 2016 (SC'16 workshop)]
   Metaprogramming-Enabled Parallel Execution of Apparently Sequential C++ Code
   David S. Hollman, Janine C. Bennett, Hemanth Kolla, Jonathan Lifflander, Nicole Slattengren, Jeremiah J. Wilke
6. [SC 2015] (acceptance rate 22%)
   Recovering Logical Structure from Charm++ Event Traces
   Katherine E. Isaacs, Abhinav Bhatele, Jonathan Lifflander, David Böhme, Todd Gamblin, Martin Schulz, Bernd Hamann, Peer-Timo Bremer
7. [SC 2014] (acceptance rate 20.8%)
   Optimizing Data Locality for Fork/Join Programs Using Constrained Work Stealing
   Jonathan Lifflander, Sriram Krishnamoorthy, Laxmikant V. Kale
8. [CLUSTER 2014] (acceptance rate 23.8%)
   Best Student Paper, Feng Chen Memorial Award
   Scalable Replay with Partial-Order Dependencies for Message-Logging Fault Tolerance
   Jonathan Lifflander, Esteban Meneses, Harshitha Menon, Phil Miller, Sriram Krishnamoorthy, Laxmikant V. Kale
9. [ROSS 2014 (workshop)]
   PICS: A Performance-Analysis-Based Introspective Control System to Steer Parallel Applications
   Yanhua Sun, Jonathan Lifflander, Laxmikant V. Kale
10. [PLDI 2013] (acceptance rate 17%)
    Steal Tree: Low-Overhead Tracing of Work Stealing Schedulers
    Jonathan Lifflander, Sriram Krishnamoorthy, Laxmikant V. Kale
11. [PPoPP 2013] (acceptance rate 18%)
    Adoption Protocols for Fanout-Optimal Fault-Tolerant Termination Detection
    Jonathan Lifflander, Phil Miller, Laxmikant V. Kale
12. [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
13. [Concurrent Objects and Beyond 2012]
    Controlling Concurrency and Expressing Synchronization in Charm++ Programs
    Laxmikant V. Kale, Jonathan Lifflander
14. [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
15. [HPDC 2012] (acceptance rate 16%)
    Work Stealing and Persistence-based Load Balancers for Iterative Overdecomposed Applications
    Jonathan Lifflander, Sriram Krishnamoorthy, Laxmikant V. Kale
16. [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
17. [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
18. [Workshop @ IPDPS 2012]
    Dynamic Scheduling for Work Agglomeration on Heterogeneous Clusters
    Jonathan Lifflander, G. Carl Evans, Anshu Arya, Laxmikant V. Kale
19. [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
20. [Compsac 2009] (acceptance rate 20%)
    Clustering Versus Shared Nothing: A Case Study
    Jonathan Lifflander, Adam McDonald, Orest Pilskalns