Welcome! We are the Parallel Programming Laboratory.
Our goal is to develop technology that improves performance of parallel applications while also improving programmer productivity. We aim to reach a point where, with our freely distributed software base, complex irregular and dynamic applications can (a) be developed quickly and (b) perform scalably on machines with thousands of processors.
Processor virtualization is one of our core techniques: the programmer divides the computation into a large number of entities, which are mapped to the available processors by an intelligent runtime system. This separation of concerns between programmers and the system is key to attaining both our goals together.
3-D Particle Tracking with Charm++
Particle-tracking methods are widely used in fluid mechanics and multi-target tracking research because of their unique ability to reconstruct long trajectories with high spatial and temporal resolution. Researchers have recently demonstrated 3D tracking of several objects in real time, but as the number of objects is increased, real-time tracking becomes impossible due to data transfer and processing bottlenecks. To solve this problem, a parallel tracking package was developed with Charm++ in collaboration with researchers from...
Recent Activity
- Local SIAM chapter hosting Charm++ Tutorial
- Charm++ version 6.4.0 released
- First Beta of Charm++ version 6.4.0 released
- Jetley and Kale receive best paper award at HiPC 2011
- PPL Awarded 1st Place in HPC Challenge Class 2
- PPL Submission Chosen As Finalist for HPC Challenge
- Scaling to 100 Million Atoms Video
- PPLers Langer and Menon chosen as Siebel Scholars
Recent Publications
- A Semi-Blocking Checkpoint Protocol to Minimize Checkpoint Overhead
- A Message-Logging Protocol for Multicore Systems
- A Scalable Double In-memory Checkpoint and Restart Scheme towards Exascale
- Work Stealing and Persistence-based Load Balancers for Iterative Overdecomposed Applications
- Collective Algorithms for Sub-communicators
















