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.
Partitioning in Charm++
Support for system-driven partitioning has been added to Charm++ in the latest stable version 6.5.0.
In many scenarios, simultaneous execution of multiple instances of similar jobs is required or is beneficial. For example, in NAMD, multiple instances of the same molecular system with similar but different initial conditions can be used to reduce the time to solution, and gain insight into the behavior of the molecular system. Alternatively, one may want to...
Recent Activity
- Harshitha Menon was selected as a finalist for the Anita Borg Scholarship for 2013.
- Meneses, Sarood and Kale receive Feng Chen Memorial Award
- Charm++ issue tracker now publically accessible
- Stable release of Charm++ version 6.5.0
- IEEE Video Tribute to Profs. Schulten and Kale for the Fernbach award
- Meneses, Sarood and Kale receive Best Paper Award at SBAC-PAD 2012
Recent Publications
- Toward Runtime Power Management of Exascale Networks by On/Off Control of Links
- In Search of a Scalable, Parallel Branch-and-Bound for Two-Stage Stochastic Integer Optimization
- Towards Efficient Mapping, Scheduling, and Execution of HPC Applications on Platforms in Cloud
- Improving HPC Application Performance in Cloud through Dynamic Load Balancing
- Steal Tree: Low-Overhead Tracing of Work Stealing Schedulers