Monday, September 25, 2023
10:20 a.m. – 11:10 a.m. (CST)
ETB 1034
Laxmikant (Sanjay) Kale
Director & Research Professor at the Parallel Programming Laboratory
Paul and Cynthia Saylor Professor Emeritus of Computer Science
University of Illinois Urbana-Champaign
Title: “The Migratable Objects Parallel Programming Model: Successes and Prospects”
Talking Points:
- Parallel Programming Model with Runtime Adaptivity
- Automated Dynamic Load balancing and energy optimization
- Highly Scalable Parallel Applications
- Coronavirus simulation on supercomputers
Abstract
The Migratable Objects programming model (MOPM) represents an approach to parallel programming where the notion of a processor is virtualized, and represented by an encapsulated object that can be migrated to any physical processor or host at will by an intelligent runtime system. Combined with over-decomposition, it separates concerns about how to partition data and what computations to do in parallel from where the data resides and which processor executes which actions. Thereby, it empowers highly adaptive runtime systems, which supports asynchronous task-based models and uniquely (and most consequentially) dynamic load balancing. It automatically overlaps communication and computation overlap and engenders parallel composition of independent modules efficiency. MOPM also supports automatic power and energy related optimizations as well as fault tolerance.
I will review the basic ideas of the programming model, its baseline implementation in Charm++, and the successes it has notched. The well-known application NAMD, which was used in many highly scaled supercomputer simulations of the coronavirus in recent years, is one such success along with applications in astronomy, fluid dynamics, and other domains. I will illustrate how these application’s successes are based on features of the MOPM.
Charm++ provides a good foundation for development of higher-level languages and frameworks as demonstrated by Adaptive MPI, Charades (discrete event simulation framework), etc.
I will present my assessment of the success and failures of this model over the past two decades, future prospects for it and its software ecosystem, as well as research opportunities.
Biography
Professor Laxmikant Kale is the director of the Parallel Programming Laboratory and Research Professor as well as the Paul and Cynthia Saylor Professor Emeritus of Computer Science at the University of Illinois at Urbana-Champaign.
Prof. Kale has been working on various aspects of parallel computing, with a focus on enhancing performance and productivity via adaptive runtime systems, and with the belief that only interdisciplinary research involving multiple CSE and other applications can bring back well-honed abstractions into Computer Science that will have a long-term impact on the state-of-art.
His collaborations include the widely used Gordon-Bell award winning (SC 2002) biomolecular simulation program NAMD and other collaborations on computational cosmology, quantum chemistry, rocket simulation, space-time meshes, and other unstructured mesh applications.
He takes pride in his group’s success in distributing and supporting software embodying his research ideas, including Charm++, Adaptive MPI and Charm4Py. He and his team won the HPC Challenge award at Supercomputing 2011, for their entry based on Charm++.
Prof. Kale is a fellow of the ACM and IEEE, and a winner of the 2012 IEEE Sidney Fernbach award.
More on Laxmikant Kale: https://charm.cs.illinois.edu/~kale/
More on CESG Seminars: HERE
Please join on Monday, 9/25/23 at 10:20 a.m. in ETB 1034.